Abstract: A computer-implemented method according to one embodiment includes receiving a search query; determining a first set of categories associated with the search query, including performing a reverse lookup for the search query using a dynamic inference map in order to determine the first set of categories, where each category of the first set of categories includes one or more words that describe one or more aspects of the search query; determining a second set of categories associated with preliminary results of the search query; and filtering the preliminary results of the search query, including removing a subset of the preliminary results of the search query based on a comparison of the first set of categories to the second set of categories.

Abstract: A computer-implemented method according to one embodiment includes identifying a plurality of related web pages, extracting textual data within the identified plurality of related web pages, determining a plurality of groupings of the extracted textual data, calculating a frequency of each of the determined plurality of groupings within the identified plurality of related web pages, creating a subset of the determined plurality of groupings, based on the calculated frequency of each of the plurality of groupings, and returning the subset of the determined plurality of groupings.

Abstract: A method, according to one embodiment, includes receiving, at a first node of a distributed database system from one or more caller nodes of the distributed database system, a predetermined number of service tasks to add to a value in a row stored in the distributed database system at a write daemon. Additionally, a time of receipt of the predetermined number of service tasks is recorded. Further, the predetermined number of service tasks are combined to a single row in the distributed database system at the write daemon. Further still, a number of operations to attend to the predetermined number of service tasks is reduced by sending the predetermined number of service tasks to at least two bucket daemons on at least two other nodes of the distributed database system.

Abstract: A computer-implemented method according to one embodiment includes receiving a search query; determining a first set of categories associated with the search query, including performing a reverse lookup for the search query using a dynamic inference map in order to determine the first set of categories, where each category of the first set of categories includes one or more words that describe one or more aspects of the search query; determining a second set of categories associated with preliminary results of the search query; and filtering the preliminary results of the search query, including removing a subset of the preliminary results of the search query based on a comparison of the first set of categories to the second set of categories.

Abstract: A computer-implemented method according to one embodiment includes identifying a search query, determining a first set of categories associated with the search query, determining a second set of categories associated with preliminary results of the search query, and filtering the preliminary results of the search query based on an analysis utilizing the first set of categories and the second set of categories.

Abstract: Embodiments provide a computer implemented method, in a data processing system comprising a processor and a memory comprising instructions which are executed by the processor to cause the processor to implement a full question generation system, the method comprising ingesting, into the full question generation system, a query dataset derived from one or more search queries entered by one or more users of an internet search engine; identifying questions from the ingested query dataset; separating, through a full question identification module, one or more prior full questions from the ingested dataset; identifying, through a question intent query identification module, one or more question intent queries from the query dataset; for each identified question intent query: sorting, through a sorting module, the question intent query into one or more bins based on one or more missing interrogative words; and appending, through an appending module, the missing interrogative word and a verb onto the question intent

Abstract: Embodiments provide a computer implemented method, in a data processing system comprising a processor and a memory comprising instructions which are executed by the processor to cause the processor to implement a full question generation system, the method comprising ingesting a query dataset derived from one or more search queries entered by one or more users of an internet search engine; identifying questions from the ingested query dataset; separating one or more prior full questions from the ingested dataset; identifying one or more question intent queries from the query dataset; for each identified question intent query; sorting the question intent query into one or more bins based on one or more missing interrogative words; and appending the missing interrogative word and a verb onto the question intent query to generate a full question. The full question generation method can additionally generate un-canonical questions.

Abstract: A method, according to one embodiment, includes receiving, at a first node of a distributed database system from one or more caller nodes of the distributed database system, a predetermined number of service tasks to add to a value in a row stored in the distributed database system at a write daemon. Additionally, a time of receipt of the predetermined number of service tasks is recorded. Further, the predetermined number of service tasks are combined to a single row in the distributed database system at the write daemon. Further still, a number of operations to attend to the predetermined number of service tasks is reduced by sending the predetermined number of service tasks to at least two bucket daemons on at least two other nodes of the distributed database system.

Abstract: A method, according to one embodiment, includes identifying data to be stored in one or more tables on a bucket, where the bucket is an allocation of a partitioned storage in a node of one or more nodes of a swarm database, the bucket having at least one replica, and where no two identical bucket replicas reside on a single node. An identifier and a data storage hierarchical level are assigned to the data. The data is mapped to an index and the data is stored in accordance with the index and the data storage hierarchical level, the storing including writing the data to a row in one of the one or more tables on the bucket and recording a write operation into a transaction log of the node. A plurality of write operations are received, and a plurality of write tasks of the bucket are combined for a predetermined time period.

Abstract: Embodiments provide a computer implemented method, in a data processing system comprising a processor and a memory comprising instructions which are executed by the processor to cause the processor to implement a full question generation system, the method comprising ingesting, into the full question generation system, a query dataset derived from one or more search queries entered by one or more users of an internet search engine; identifying questions from the ingested query dataset; separating, through a full question identification module, one or more prior full questions from the ingested dataset; identifying, through a question intent query identification module, one or more question intent queries from the query dataset; for each identified question intent query: sorting, through a sorting module, the question intent query into one or more bins based on one or more missing interrogative words; and appending, through an appending module, the missing interrogative word and a verb onto the question intent

Abstract: Embodiments provide a computer implemented method, in a data processing system comprising a processor and a memory comprising instructions which are executed by the processor to cause the processor to implement a full question generation system, the method comprising ingesting a query dataset derived from one or more search queries entered by one or more users of an internet search engine; identifying questions from the ingested query dataset; separating one or more prior full questions from the ingested dataset; identifying one or more question intent queries from the query dataset; for each identified question intent query; sorting the question intent query into one or more bins based on one or more missing interrogative words; and appending the missing interrogative word and a verb onto the question intent query to generate a full question. The full question generation method can additionally generate un-canonical questions.

Abstract: A computer-implemented method according to one embodiment includes identifying a search query, determining a first set of categories associated with the search query, determining a second set of categories associated with preliminary results of the search query, and filtering the preliminary results of the search query based on an analysis utilizing the first set of categories and the second set of categories.

Abstract: A computer-implemented method according to one embodiment includes identifying a plurality of related web pages, extracting textual data within the identified plurality of related web pages, determining a plurality of groupings of the extracted textual data, calculating a frequency of each of the determined plurality of groupings within the identified plurality of related web pages, creating a subset of the determined plurality of groupings, based on the calculated frequency of each of the plurality of groupings, and returning the subset of the determined plurality of groupings.

Abstract: A method, according to one embodiment, includes identifying data to be stored in one or more tables on a bucket, where the bucket is an allocation of a partitioned storage in a node of one or more nodes of a swarm database, the bucket having at least one replica, and where no two identical bucket replicas reside on a single node. An identifier and a data storage hierarchical level are assigned to the data. The data is mapped to an index and the data is stored in accordance with the index and the data storage hierarchical level, the storing including writing the data to a row in one of the one or more tables on the bucket and recording a write operation into a transaction log of the node. A plurality of write operations are received, and a plurality of write tasks of the bucket are combined for a predetermined time period.