Abstract: Provided are techniques for dynamically mapping zones. For a file and a field, while receiving text characters, possible terms for the text characters are provided by querying an index. In response to receiving selection of a possible term from the possible terms, each occurrence and position of the selected term in the file is determined. In response to selection of an occurrence and position of the selected term, the file is marked to identify the selected occurrence at the position in the file. The selected term and the position are associated with the field for any other files that match a type of the file.

Abstract: A method, apparatus and computer program product selectively delete records from a cache in a manner that not only takes into account usage of the record, but also the cost associated with the generation of the record. In regards to a method, a cost associated with generation of a record maintained in a cache is determined. The cost may be defined in terms of the time consumed to generate the record. The method also determines usage of the record. At least one of the cost or the usage may be determined on a relative basis with respect to the cost or the usage, respectively, of other records maintained in the cache. Further, the method determines whether the record should be deleted from the cache based upon the cost and the usage of the record. Based on this determination, the record may be selectively deleted from or retained within the cache.

Abstract: The present invention generally relates to storing sequence read data. The invention can involve obtaining a plurality of sequence reads from a sample, identifying one or more sets of duplicative sequence reads within the plurality of sequence reads, and storing only one of the sequence reads from each set of duplicative sequence reads in a text file using nucleotide characters.

Abstract: A computing device identifies a plurality of media files within a data store, each of the media files lacking user established file names. The computing device analyzing the plurality of media files to recognize humans in the media files based on facial recognition and/or voice recognition programs. Using results of the analyzing to generate a plurality of content identification keywords, which are scored and ranked. Establishing a filename prefix for the media files using scored and ranked content identification keywords. Automatically generating a unique file name for each of the media files, wherein each unique file name includes the established filename prefix.

Abstract: A method for disk image access in a storage system includes prefetching a disk image metadata structure. An input/output (I/O) request to the disk image is received. In response to the I/O request, a file system request is reconstructed by laying out the disk image, performing type-specific introspection on the disk image, and mapping data ranges in the disk image to blocks or files within the file system based on results of the introspection.

Abstract: According to embodiments of the present invention, machines, systems, methods and computer program products for hierarchical compression of data are presented comprising creating a compression hierarchy of compression nodes, wherein each compression node is associated with a compression operation to produce compressed data. An output of any of the compression nodes may be compressed by another compression node or the same compression node. A path of one or more compression nodes is determined through said compression hierarchy based upon compression statistics to compress data, and the data is compressed by the compression nodes of the path. Various computational techniques are presented herein for manipulating the compression hierarchy to defer or reduce computation during query evaluation.

Abstract: Techniques are disclosed for improving scalability in a system which incrementally updates remote clients with events that occurred in a cloud-enabled platform. In one embodiment, a method comprises, in response to an action from a user in the cloud-enabled platform, determining a list of events to update one or more collaborators of the user about the action. The method further comprises separating the list of events into a plurality of sub-lists of events such that each sub-list of events can be stored in a database within a designated amount of time, and further comprises storing the plurality of sub-lists of events into the database to be read by the one or more collaborators. Among other advantages, embodiments disclosed herein provide enhancement in scalability, robustness and availability for cloud-based collaboration platforms with large numbers of collaborators by incorporating mechanisms to divide-and-conquer the workload of event updates in such platforms.

Abstract: File link migration is described. A method may include identifying a first file link referencing a file residing at a first computer system, and identifying, at the first computer system, a first inode data structure referenced by the first file link, the first inode data structure comprising a first link count. The method may also include creating a second inode data structure at a second computer system, wherein the second data structure comprises a second link count, and creating a second file link to reference the second inode data structure at the second computer system. The method may also include, responsive to determining that the first link count matches the second link count, migrating file data referenced by the first data structure to the second computer system.

Abstract: A server computer system performs a first set of operations for a first transaction. The first transaction pertaining to data stored in a file system. The server computer system delays a second set of operations for the first transaction and identifies a second transaction pertaining to the data. In response to identifying the second transaction, the server computer system cancels the second set of operations for the first transaction, and cancels a first set of operations for the second transaction.

Abstract: Described is a method and apparatus for constructing a boundary comprising a set of contextual square quadrangles. Also described is a method and apparatus for searching a set of contextual square quadrangles.

Abstract: Content-based retrieval of digital pathology images (DPI) is a fundamental component in an intelligent DPI processing and management system. One key issue of content-based DPI retrieval is how to represent an image as a feature vector, capturing its key information that is most relevant to the goal of retrieval. A unified framework of extracting information of different levels for DPI, namely low level color information, middle level texture information and high level diagnostic information is described herein. Such information from all the levels are integrated to the end of content-based DPI retrieval.

Abstract: A Method for retrieving at least one image from a database (DB) of images based on at least two input images (image i, image j), comprises the steps of determining (120) first low level feature correspondences (LC1) between said at least two input images (image i, image j), searching (200) within said database (DB) for at least two sets (Mi, Mj) of images respectively matching said at least to images (image i, image j), determining (120) second low level features correspondences (LC2) between respective images from said at least two sets of images (Mi, Mj), determining (130) a first set of relationships (RLC1) between entities of said at least two input images (image i, image j) based on said first low level feature correspondences (LC1), determining (130) a second set of relationships (RLC2) between respective entities of said respective images from said at least two sets of images (Mi, Mj) based on said second low level feature correspondences (LC2), identifying (300) matching relationships between said fir

Abstract: A system and method uses one or more images provided to an image recognition capable search engine to obtain search results. The image recognition system may use one or more image match algorithms to create one or more possible product match sets. In the event multiple product match sets are created, the search results may be limited to product that appears in one or more of the plural possible product match sets.

Abstract: Streaming database replication is provided by merging a stream of user transactions with a stream of copy transactions comprising copy data into a combined stream on a source. A target receives a single stream that includes copy transaction and concurrent user transactions in an order that enables conflicts between data being copied and user transactions to be handled correctly. Furthermore, locks applied to data subject to a copy transaction or user transaction can be released once the copy transaction or user transaction is added to the combined stream.

Abstract: A logical backup of a database is performed that allows physical properties of the database to be preserved upon restore. The physical properties of the database include properties related to storage of the data on the hard disk. Preserving the physical properties of a database allows performance debugging of the source database by performing performance tests on the target database rather than a production system. Incremental backup of metadata of a database is performed to minimize execution of statements that provide the final configuration of the database. Incremental backup is performed by restoring a database using a full backup and applying incremental backups to reach a particular state. The user can inspect the restored database after applying each incremental backup to determine whether the database has reached a desired state.

Abstract: A method for measuring a change between two values for one or more data elements over time uses a “delta” value to indicate the significance of the change. The delta value is the difference between the two values, added to the ratio between those values multiplied by an asymptote. Experimental data sets with known values may be used to create data sets to which selection criteria are applied in order to calculate an optimal asymptote for the application of the delta values. This optimal asymptote may then be used for calculating delta values across an entire population for predictive purposes.

Abstract: Techniques are described for schema lifecycle management. In one example, a method includes dividing, with one or more processing devices, a plurality of statements of a data definition language (DDL) script into a plurality of groups, the plurality of groups configured to be executed in parallel by a persistence layer. The method further includes assigning, with the one or more processing devices, one or more of the plurality of groups to a plurality of worker applications. The method further includes executing, with the one or more processing devices, constituent statements of the plurality of statements of the DDL script within each group of the plurality of groups by the plurality of worker applications in a session.

Abstract: Technologies are provided for validating application models within a database environment. For example, an application model can be provided to a database environment and validated against a meta-schema and/or an application schema stored within the database environment. Successful validation can be required before the application model is allowed to run within the database environment (e.g., before the application model can be stored within the database environment).

Abstract: A method of correlating data for multiple product configurations is provided comprising enhancing, by a processor, data set definition to accommodate data models of data sets describing multiple product configurations. The method also comprises comparing, by the processor, values of the data sets utilizing at least one matching algorithm and effectivity expressions identifying relevant rows for comparison in the data sets. The method also comprises enhancing, by the processor, the at least one matching algorithm to identify perfect and partial matches between the data sets wherein values of all data contained in the data sets are compared in one single operation comprising simultaneous validation of engineering data for the multiple product configurations.

Abstract: A method for implementing a geometric array in a computing environment is disclosed. In one embodiment, such a method includes providing an array of slots, where each slot is configured to store a pointer. Each pointer in the array points to a block of elements. Each pointer with the exception of the first pointer in the array points to a block of elements that is twice as large as the block of elements associated with the preceding pointer. Such a structure allows the geometric array to grow by simply adding a pointer to the array that points to a new block of elements that is twice as large as the block of elements associated with the preceding pointer in the array. A corresponding computer program product, as well as a method for accessing data in the geometric array, are also disclosed.

Abstract: A method for estimating model parameters. The method comprises receiving a data set related to a plurality of users and associated content, partitioning the data set into a plurality of sub data sets in accordance with the users so that data associated with each user are not partitioned into more than one sub data set, storing each of the sub data sets in a separate one of a plurality of user data storages, each of said data storages being coupled with a separate one of a plurality of estimators, storing content associated with the plurality of users in a content storage, where the content storage is coupled to the plurality of estimators so that the content in the content storage is shared by the estimators, and estimating, asynchronously by each estimator, one or more parameters associated with a model based on data from one of the sub data sets.

Abstract: A method for storing database information includes storing a table having data values in a column major order. The data values are stored in a list of blocks. The method also includes assigning a tuple sequence number (TSN) to each data value in each column of the table according to a sequence order in the table. The data values that correspond to each other across a plurality of columns of the table have equivalent TSNs. The method also includes assigning each data value to a partition based on a representation of the data value. The method also includes assigning a tuple map value to each data value. The tuple map value identifies the partition in which each data value is located.

Abstract: A method for storing database information includes storing a table having data values in a column major order. The data values are stored in a list of blocks. The method also includes assigning a tuple sequence number (TSN) to each data value in each column of the table according to a sequence order in the table. The data values that correspond to each other across a plurality of columns of the table have equivalent TSNs. The method also includes assigning each data value to a partition based on a representation of the data value. The method also includes assigning a tuple map value to each data value. The tuple map value identifies the partition in which each data value is located.

Abstract: Systems and methods are provided for data object change history. A first data object and a second data object are retrieved, wherein the first data object includes an identifier, a field name, a first value, and a first date, and wherein the second data object includes the identifier, the field name, a second value, and a second date. A history object is stored, wherein the history object comprises the identifier, the field name, the first value, the first date, and the second date. The history object is output in response to a query which specifies the identifier, the field name, and a query date within a range of the first date and the second date.

Abstract: The present invention relates to an apparatus for managing an APK file in the Android platform in order to forestall an executable file in an APK file from being analyzed by reverse engineering or decompiling that comprises a file reader that reads an original .dex file in the APK file, a file modifier that modifies the original .dex file the file reader has read and stores the modified .dex file in a readable folder in the APK file, a file creator that accesses the folder to read and restore the original .dex file, creates a temporary .dex file that is can be loaded onto memory and adds the temporary .dex file to the APK file in order to create a protected APK file and a file executer that reads from the folder and restores, if the Android platform requests the protected APK file to be executed, the modified original .dex file by executing the temporary .dex file and loads the restored original .dex file onto memory in order to execute the protected APK file.

Abstract: Electronic data file and content capturing systems and methods enable enhanced accessibility and reduced complexity for clients managing large volumes of digital data files. According to one aspect, a system and method provided for validation and tracking of content collection tasks. According to another aspect, systems and methods are disclosed for error management through integrated interfaces that are capable of interacting with and correcting the results of content collection tasks.

Abstract: A social networking system receives contact information from a social networking system user. The received contact information is stored and associated with a user profile in the social networking system including information matching at least a portion of the stored content information. This increases the information associated with the user profile. Subsequently received content information is compared to user profiles and stored contact information associated with one or more user profiles. User profiles including information matching at least a portion of the subsequently received content information or associated with stored contact information matching at least a portion of the subsequently received content information are identified as potential connections for the user providing the subsequently received contact information.

Abstract: A modular search object framework provides modular search results including entity search results reflecting the intent of a searcher. Also, an interface (such as a graphical user interface provided by the framework), aids in organizing results (such as links, titles, and description) according to the intent of the user as manifest in the search query and interactions with the interface. Circuitry of the framework also predicts user intent from historical information corresponding to the searcher (or to a group with which the searcher is associated).

Abstract: A system, a method, and a computer readable media for identifying a user-initiated log file record in a log file are provided. The log file has a user-initiated log file record and a repeating pattern of log file records automatically generated by a software program. The system allows a user to identify first and second timestamp values corresponding to first and second times which identify a time interval of interest in the log file. The system further analyzes the log file to identify the user-initiated log file record having a timestamp value between the first and second timestamp values. The system further identifies the repeating pattern of log file records in the log file.

Abstract: In some embodiments, a query recipient is configured to determine that a database query warrants a first projection operation to project a plurality of input rows to a plurality of projected rows. Each of the input rows has one or more variable-length columns. A projection controller is configured to construct a first projection control block to describe the first projection operation. For this construction, the projection controller is configured to construct a plurality of projection control elements, each one corresponding to a corresponding column in the input rows, and a header to specify the order of the projection control elements. The projection controller is further configured to offload the first projection operation to a hardware accelerator, and to provide the first projection control block to the hardware accelerator, where the first projection control block enables the hardware accelerator to perform the first projection operation at streaming rate.

Abstract: Techniques are described for dynamic translation of data access statements. A first set of statements is sent by an executing process to access a first data storage that supports a first query language. The first set of statements is intercepted and translated into a second set of statements configured to access a second data storage that supports a second query language. The second set of statements may be executed on the second data storage, and the result data set may be sent to the executing process that generated the first set of statements. The first and second storages may employ different data storage formats, such as relational and non-relational storage formats. The behavior of the executing process may be monitored to determine the feasibility of modifying the source code of the process to employ a different query language.

Abstract: One or more processors apply rules to a first query to generate a modified query such that processing of the modified query is improved for a first set of processing conditions. One or more processors measure a degree of latency experienced during processing of the modified query under a second set of processing conditions. One or more processors generate other rules to be applied to queries based, at least in part, on the measured degree of latency.

Abstract: A semantic query over an RDF database is received with RDF database statistics and access methods for evaluating triple patterns in the query. The semantic query is expressed as a parse tree containing triple patterns and logical relationships among the triple patterns. The parse tree and access methods create a data flow graph containing a plurality of triple pattern and access method pair nodes connected by a plurality of edges, and an optimal flow tree through the data flow graph is determined such that costs are minimized and all triple patterns in the semantic query are contained in the optimal flow tree. A structure independent execution tree defining a sequence of evaluation through the optimal flow tree is created and is transformed into a database structure dependent query plan. This is used to create an SQL query that is used to evaluate the semantic query over the RDF database.

Abstract: Embodiments of the present invention relate to a new method of entity integration using high-level scripting languages. In one embodiment, a method of and computer product for entity integration is provided. An entity declaration is read from a machine readable medium. The entity declaration describes an entity including at least one nested entity. An index declaration is read from a machine readable medium. The index declaration describes an index of nested entities. An entity population rule is read from a machine readable medium. The entity population rule describes a mapping from an input schema to an output schema. The output schema conforms to the entity declaration. A plurality of input records is read from a first data store. The input records conform to the input schema. The entity population rule applies to the plurality of records to create a plurality of output records complying with the output schema. An index of nested entities is populated. The index complies with the index declaration.

Abstract: A method, apparatus, and article of manufacture for optimizing a query in a computer system. Grouping operations are optimized during execution of the query in the computer system by: (1) translating the grouping operations into a plurality of levels, wherein each of the levels is comprised of one or more grouping sets with the same number of grouping expressions; (2) deriving the grouping sets on a level-by-level basis, wherein the grouping sets in a base level are obtained from the database and the grouping sets in a next one of the levels are derived by selecting as an input a smallest one of the grouping sets in a previous one of the levels with which it has a derivation relationship; and (3) combining the derived grouping sets into an output for the query.

Abstract: One example discloses a database management system that can comprise a memory for storing computer executable instructions and a processing unit for accessing the memory and executing the computer executable instructions. The computer executable instructions can comprise a query data collector to access a query repository table to determine if a first query plan for a first configuration executed on a relational database has a lowest resource cost of execution between the first query plan and a second query plan for a second configuration. The query repository table can include a plurality of query records with annotated query plans, each annotated query plan comprising text sufficient to generate a query plan of a certain form.

Abstract: Provided is a join processing device that performs a similarity join process to plural tuples using an edit distance threshold value ? (positive integer). The join processing device includes a join processing unit that excludes, from a target of edit distance calculation, a pair of tuples that do not have any common character in an end portion ranging from a head character or a tail character to a (?+1)th character in a join key string in each of the tuples.

Abstract: Methods, apparatus and articles of manufacture for modifying queries and rules for profile fetching and risk calculation are provided herein. A method includes comparing at least one aspect of a query submitted to access a data store to rule sets associated with the data store to determine a potential access path within the data store for responding to the query, comparing information pertaining to an entity identified via the query to risk information pertaining to entities to determine a level of risk associated with the entity identified via the query, generating a modified version of the query based on information derived from the potential access path within the data store for responding to the query, and calculating a risk score associated with the modified version of the query based on the aspect of the query and the level of risk associated with the entity identified via the query.

Abstract: Techniques are described herein for efficient set operation execution. According to some embodiments, a request is received to perform a set operation with respect to a first data set and a second data set. The request may identify the first data set, the second data set, and a type of set operation to perform. In response to receiving the request, a hash table is generated in memory from a first set of records in the first data set, and a second set of records from the second data set is probed against the hash table. Based on probing the hash table and the type of set operation identified in the request, records that satisfy the set operation are identified and output from the hash table.

Abstract: A method, computer program product and computer system are provided. A processor receives a plurality of pointers corresponding to a plurality of electronic files. A processor determines at least one affinity score for the plurality of electronic files based, at least in part, on one or more usage patterns of a user. A processor generates a geometric diagram including a plurality of regions, wherein the geometric diagram is represented by a matrix. A processor assigns the plurality of pointers to the plurality of regions based, at least in part, on the at least one affinity score. A processor selects at least one pointer of the plurality of pointers based, at least in part, on a selection area of the geometric area, where the at least one pointer is located within the selection area. A processor generates a list including the at least one pointer of the plurality of pointers.

Abstract: A method and system for synchronizing contents is provided. The method includes retrieving a user profile associated with a user. A user specified order for presenting data from a services content repository is determined. A context of the data is determined and the user profile is compared to additional user profiles. In response, commonly followed orders of presenting the data to a plurality of users are determined. Specified data and a specified order for presenting the specified data to the user via a personal device are determined.

Abstract: A computer-implemented method for reconciling records from a plurality of data sets includes receiving a first data set from a left data source, retrieving data from the first data set, and placing the retrieved data from the first data set into a first abstract record from the left data source. The method also includes receiving a second data set from a right data source, retrieving data from the second data set, and placing the retrieved data from the second data set into a second abstract record from the right data source. The computer-implemented method also includes comparing the first abstract record and the second abstract record.

Abstract: A search engine is described herein for providing search results based on a context in which a query has been submitted, as expressed by context information. The search engine operates by ranking a plurality of documents based on a consideration of the query, and based, in part, on a context concept vector and a plurality of document concept vectors, both generated using a deep learning model (such as a deep neural network). The context concept vector is formed by a projection of the context information into a semantic space using the deep learning model. Each document concept vector is formed by a projection of document information, associated with a particular document, into the same semantic space using the deep learning model. The ranking operates by favoring documents that are relevant to the context within the semantic space, and disfavoring documents that are not relevant to the context.

Abstract: A data storage system includes a column store and a row store. The data storage system may generate a query summary. The data storage system determines query summary fields comprised of a subset of fields from a schema used to store data in the row store. The data storage system searches the column store or the row store for query results in the query summary fields. A query summary field is generated from the query results in the query summary fields.

Abstract: The invention relates to systems and methods of providing in-view and out-of-view request-related result regions for respective result categories. The system may facilitate result presentation by providing, in response to a user request, at least one region that is designated to initially be in-view and at least one region that is designated to initially be out-of-view where: (i) the initial in-view region comprises one or more results related to the user request and a first category; and (ii) the initial out-of-view region comprises one or more results related to the user request and the second category. A result related to a category may comprise a result related to a specific topic, a result of a specific type, a result from a specific source, or other result. A user request may comprise a query, a command, or other user request.

Abstract: In order to request desired information from a graph database, a system executes a query against the graph database. The graph database may store a graph that includes nodes, edges between the nodes, and predicates to represent and store data with index-free adjacency. Moreover, the query may identify a first edge associated with a predicate that specifies one or more of the nodes in the graph. In response to the query, the system receives a result that includes a subset of the graph. In particular, the subset of the graph may include the desired information expressed within an associated structure of the graph.

Abstract: Certain aspects of the present disclosure relate to a technique to access a data source from a client using a driver. A data source name (DSN) is provided to connect to the data source using the driver. The driver is used to interface between the client and an implementation of a driver interface to access the data source based on the DSN.

Abstract: An input extension specification can be generated, via an administration tool on a business intelligence (BI) server, for an extender associated with a data warehouse in order to extend the data warehouse. The administration tool can request for data flow information of the data warehouse from the extender. The data flow information indicates the mapping relationship between one or more source data objects and one or more target tables in the data warehouse. The administration tool further allows a user to select said one or more target tables in the data warehouse to be extended based on the data flow information, and builds the input extension specification for the extender.

Abstract: Systems and methods for providing information responsive to a request. In an embodiment, a request from a requestor is received. A plurality of eligible information sources that are capable of providing data at least partially responsive to the information request are identified. For each identified information source, a data request according to a schema accepted by the identified information source is prepared and responses from the eligible information sources are received. The responses are homogenized according to a common schema and information from the homogenized responses are provided to the requestor.

Abstract: Methods, systems, and apparatus provide efficient and complex database functionality for an electronic device, e.g. a mobile device. These mechanisms and methods for providing efficient and complex database functionality to an electronic device can enable embodiments to provide quick access to certain data using a local application and seamless access within the local application to other data and complex presentation formats that are supplied by a server. The ability of embodiments to provide this hybrid functionality can enable users of the electronic devices to be more productive.