Abstract:
Systems and methods for managing data, such as metadata or indexes for index databases. In one exemplary method, different processing priorities are assigned to different indexing tasks based upon the origin of the task. In another exemplary method, indexing tasks are processed in a first mode when a data processing system is in a first power state and indexing tasks are processed in a second mode when the data processing system is in a second power state.
Abstract:
In one embodiment, a method for data migration includes: receiving intermediate data and corresponding key value-row location information mapping list; importing each row of the intermediate data to a corresponding row of a target data table, where each row of the target data table has a target physical row ID; and establishing, by a computer processor, a target index of the target data table based on the target physical row IDs and the key value-row location information mapping list. With the method or system of this invention, the efficiency of reestablishing a data index after data migration can be improved.
Abstract:
A method, system and computer program product for generating answers to questions. In one embodiment, the method comprises receiving an input query, identifying a plurality of candidate answers to the query; and for at least one of these candidate answers, identifying at least one proof of the answer. This proof includes a series of premises, and a multitude of documents are identified that include references to the premises. A set of these documents is selected that include references to all of the premises. This set of documents is used to generate one or more scores for the one of the candidate answers. A defined procedure is applied to the candidate answers to determine a ranking for the answers, and this includes using the one or more scores for the at least one of the candidate answers in the defined procedure to determine the ranking for this one candidate answer.
Abstract:
Techniques are disclosed for maintaining a search index used to support application searches. The techniques include receiving application data from one or more data sources, identifying an application referenced in the application data. The techniques further include extracting a plurality of attributes corresponding to the application from the application data based on an application specific search schema. The techniques also include generating an application representation of the application based on the plurality of attributes and the application specific search schema. The techniques also include updating a search index with the application representation.
Abstract:
A method, system and computer program product for generating answers to questions. In one embodiment, the method comprises receiving an input query, identifying a plurality of candidate answers to the query; and for at least one of these candidate answers, identifying at least one proof of the answer. This proof includes a series of premises, and a multitude of documents are identified that include references to the premises. A set of these documents is selected that include references to all of the premises. This set of documents is used to generate one or more scores for the one of the candidate answers. A defined procedure is applied to the candidate answers to determine a ranking for the answers, and this includes using the one or more scores for the at least one of the candidate answers in the defined procedure to determine the ranking for this one candidate answer.
Abstract:
The present disclosure describes a data indexing and search service that resides locally on a computing device (e.g., a mobile phone) and that can host data for multiple applications on the device. By centralizing the storage of data as well as the search and query functions, unified search queries can be performed by the service.
Abstract:
An illustrative embodiment includes processing parse tree data. A parse tree data structure that is representative of a document object model (DOM) tree data structure is received. Concomitant to receiving the parse tree data structure, an assignment of index values for the DOM nodes consisting of distinct index values for each existing DOM node is received by the processor. Requests to manipulate the parse tree data structure that include node inserts and document order comparisons are also performed.
Abstract:
One or more techniques and/or systems are provided for tagging search results, organizing tagged search results for later access from various devices, public sharing of tagged search results, and/or providing targeted content based upon search results tagged by a user. That is, a user may tag a search result (e.g., a website, an image, a social network profile, etc.), such as through a one-click user input, with a tag to create a tagged search result. The tagged search result may be organized into a public tag collection for sharing and/or exploration of tagged search results by other users. The tagged search result may be organized into a personal tag collection for later access by the user from any device. Because the tagged search result may be indicative of an interest of the user, targeted content associated with the tagged search result may be provided to the user.
Abstract:
One or more techniques and/or systems are provided for tagging search results, organizing tagged search results for later access from various devices, public sharing of tagged search results, and/or providing targeted content based upon search results tagged by a user. That is, a user may tag a search result (e.g., a website, an image, a social network profile, etc.), such as through a one-click user input, with a tag to create a tagged search result. The tagged search result may be organized into a public tag collection for sharing and/or exploration of tagged search results by other users. The tagged search result may be organized into a personal tag collection for later access by the user from any device. Because the tagged search result may be indicative of an interest of the user, targeted content associated with the tagged search result may be provided to the user.
Abstract:
A parsing method and system. The method includes generating an n-gram model of a domain and computing a tf-idf frequency associated with n-grams of the n-gram model. A list including a frequently occurring group of n-grams based on the tf-idf frequency is generated. The frequently occurring group of n-grams is transmitted to a deep parser component and a deep parse output from the deep parser component is generated. The deep parse output is stored within a cache and a processor verifies if a specified text word sequence of the deep parse output is available in the cache.