Abstract: The present invention extends to methods, systems, and computer program products for training a classification model to predict categories. In one implementation, a method identifies category mappings generated for dominant queries associated with a query log. The method identifies mappings between a first set of queries and categories shown for the first set of queries, and identifies mappings between a second set of queries and clicked products for the second set of queries. A classification model is trained based on the mappings generated for dominant queries, the mappings between queries and the shown categories, and the mappings between queries and the clicked products.

Abstract: Resources for data lineage discovery, data lineage analysis, role-based security, notification. The resources may include or involve machine readable memory that is configured to store a technical data element (“TDE”); a receiver that is configured to receive a query for data lineage information corresponding to a business element identifier; and a processor configured to: register a logical association between the business element identifier and the TDE; and formulate the data lineage information of the TDE associated with the business element identifier. The receiver may be configured to receive a criterion that is required to access one or more technical data elements (“TDEs”) associated with the business element identifier. The receiver may be configured to receive an election to receive a notification of a change of data lineage. The processor may be configured to toggle between a first data lineage graph and a second data lineage graph.

Abstract: A system and machine-implemented method including receiving a request for a set of content items within a session, identifying, in response to the request, one or more content items, determining if the session is associated with a continuation token, wherein the continuation token provides information regarding the content items provided for display during the session, generating a continuation token for the session when the session is not associated with a continuation token, providing at least one of the one or more content items for display and updating the continuation token with information regarding the at least one of the one or more content items provided for display and a time stamp.

Abstract: The present invention relates to processing of time series data. There is disclosed a method and apparatus for processing time series data, the method comprising: receiving a time series data set, wherein each element of the time series data set contains a timestamp and an original value associated with the timestamp, and times represented by all timestamps constitute a time series having fixed time intervals; converting each original value into a coded value occupying a smaller storage space, according to a predetermined monotone numerical compression coding scheme; dividing the times represented by all timestamps into a plurality of time intervals having a predetermined length; assembling coded values corresponding to all timestamps within each time interval into a data package such that the data package contains coded values arranged in an order of timestamps; and storing in a database record each data package and its associated identification of a time interval.

Abstract: According to an example, data analysis control may include receiving a predetermined number of search results for a query, and organizing the predetermined number of search results by checksum values of content of the search results in an ascending or a descending order. A generally final or a generally initial checksum value may be respectively used from the ascending or the descending order of the organized search results to determine a total content number representing an approximate total content of a search related to the query, where the total content number is greater than the predetermined number of search results. Further, the determined total content number may be used to determine a number of sub-tasks needed to complete a full search of the approximate total content.

Abstract: A data storage and retrieval method of an electronic device is provided. More particularly, an apparatus and a method for retrieving data through a contact application in the electronic device are provided. The method for retrieving data in the electronic device includes generating tagging data including added tag information when data is stored in the electronic device by executing a first application, storing the tagging data, updating a tagging data table which contains tagging data information, executing a second application, and when a search word for data retrieval is input, retrieving and outputting tagging data including the same tag information as the search word.

Abstract: A method and system for placing database. The method includes: receiving a request of creating a new database; determining whether there is a need to migrate current database among current virtual machines based on resource demand and free resource in the current virtual machines; determining database placement plan based on the resource demand, migration strategy and migration cost associated with the migration strategy in response to whether there is a need to migrate the database; and executing the database placement plan. The invention can help a database service provider to optimize database layout in database provision through database migration.

Abstract: The information processing apparatus includes: a search unit configured to search an application, which satisfies a condition; a data share unit configured to output location information; and a computer controlled to function as: a first request control unit that requests with a first condition; a first reception unit that receives first application information, satisfying the first condition; a second request control unit that requests with a second condition; a second reception unit that receives second application information satisfying the second condition; a display control unit that displays options to receive an operation of selecting any one of the application indicated by the first application information and the second application information; and an output unit that designates a selected application corresponding to the selected options and outputs location information.

Abstract: A method for identifying a motor vehicle for a plurality of motor vehicle inspection devices, including ascertaining a distinct characteristic of the motor vehicle; ascertaining basic identification data of the motor vehicle; storing the distinct characteristic and the basic identification data in an identification data set for this motor vehicle on a storage medium; identifying the identification data set associated with the motor vehicle on the storage medium based on the distinct characteristic with a first of the plurality of motor vehicle inspection devices; reading out the identified identification data set of the motor vehicle from the storage medium; ascertaining first identification data of the motor vehicle, which are specific to the first of the plurality of motor vehicle inspection devices; supplementing the read-out identification data set by the first identification data; storing the supplemented identification data set on the storage medium; identifying the identification data set associated wi

Abstract: Optimizing a bitmap data tree and a corresponding lookup operation in the bit map data tree may be provided. A number of branches for each search node of a data tree may be counted. The data tree may comprise a plurality of search nodes. Then an optimum depth for the plurality of search nodes may be identified based on the number of branches in the data tree. Next, a hash node may be added to replace a search node of the data tree when a number of branches for the search node is greater than the identified optimum depth.

Abstract: Techniques for migrating data in a database include identifying an update to one or more data entries of a source table; determining that a status of a trigger associated with the source table indicates to update a logging table, and in response: updating, in a first transaction, (i) the one or more data entries of the source table, and (ii) one or more data entries of the logging table based on the user input, and copying content of the source table to a target table; and determining that the status indicates to update the target table, and in response: updating, in a second transaction, (i) the one or more data entries of the source table and (ii) one or more data entries of the target table based on the user input, and updating the content of the target table based on the one or more data entries of the logging table.

Abstract: Methods, systems, and apparatus include computer programs encoded on a computer-readable storage medium for providing content to a user. A method includes: receiving a query; receiving query results based on the query; determining for each of a predetermined number of top results entities associated therewith; using the determined entities to either augment or filter the query producing an enhanced query; and using the enhanced query to identify one or more sponsored content items for presentation to a user along with the query results.

Abstract: A system and method for evaluating claims is disclosed. The system comprises a selection module, a query module, a communication module and a determination module. The selection module determines a review set including one or more claims based at least in part on claim data. The query module determines, based at least in part on the review set, an evaluation form including one or more queries associated with a first claim. The communication module receives answer data describing one or more answers responsive to the one or more queries included in the evaluation form. The determination module determines a validity decision associated with the first claim based at least in part on the answer data.

Abstract: Embodiments of techniques and systems for parallel processing of B+ trees are described. A parallel B+ tree processing module with partitioning and redistribution may include a set of threads executing a batch of B+ tree operations on a B+ tree in parallel. The batch of operations may be partitioned amongst the threads. Next, a search may be performed to determine which leaf nodes in the B+ tree are to be affected by which operations. Then, the threads may redistribute operations between each other such that multiple threads will not operate on the same leaf node. The threads may then perform B+ tree operations on the leaf nodes of the B+ tree in parallel. Subsequent modifications to nodes in the B+ may similarly be redistributed and performed in parallel as the threads work up the tree.

Abstract: A pivot analysis method using a condition group is applicable to a front end processing device and includes the following steps. A file name processing interface is presented according to a plurality of file names. A file name selection value is received via a first sub interface of the file name processing interface. A range setting value is received via a second sub interface of the file name processing interface. A file name computing value is received via a third sub interface of the file name processing interface. A file name processing value generated by integrating the file name selection value, the file name range setting value and the file name computing value, is outputted. A multidimensional array is received to present a pivot analysis table.

Abstract: The present disclosure involves systems, software, and computer implemented methods for operating on database queries. One example method includes identifying a parameterized input query in a first database query language. The parameterized input query includes one or more parameter placeholders. A random value is generated, for each parameter placeholder. A concrete instance of the parameterized input query in the first database query language is constructed. The concrete instance of the parameterized input query replaces each parameter placeholder with the corresponding generated random value. A translated output query in a second database query language is generated, from the concrete instance of the parameterized input query. The translated output query includes the generated random values. Each of the generated random values are replaced within the translated output query in the second database query language with a placeholder value associated with the second database query language.

Abstract: Embodiments of the invention relate to systems, methods, and computer program products for automated data purge in an e-discovery system. The automated data purge process determines files within an e-discovery file system that qualify for purging based on one or more purge policies, locates the files within the file system and automatically purges the data from the file system. Additional embodiments provide for automatically creating log entries that track the details of the purge and automatically generating and communicating alerts/messages that notify concerned parties of the data purge. As such the present invention is able to accurately and automatically purge data from an electronic discovery file system and provide for detailed purge data tracking, as well as, purge notification.

Abstract: A technique for managing a file system includes dividing the addressable space of a file system into multiple subspaces: a data subspace for user data; an inode subspace for inodes describing the user data; and an MDB (metadata block) subspace for indirect blocks and/or directory structures pertaining to the user data. In response to storage requests to write user files to the file system, the file system stores user data of the files in the data subspace, stores inodes pertaining to the user files in the inode subspace, and stores indirect blocks and/or directories in the MDB subspace.