Expansion of database search queries
First Claim
Patent Images
1. A method comprising:
- identifying a token that is usable in search queries for items of data in a database having a hierarchical tree structure and having categories at a plurality of levels in the hierarchical tree structure;
determining a synonym candidate for the token;
determining whether a number of items of data in the database having the synonym candidate exceeds a threshold, and if so, for a level in the hierarchical tree structure;
identifying a first category of the level of the hierarchal tree structure based on the first category having the most items of data in the database with the token,identifying a second category of the level of the hierarchal tree based on the second category having the most items of data in the database with the synonym candidate, anddetermining that the first category and the second category are the same;
adding the synonym candidate as a synonym for the token into an expansion dictionary in response to the determination that the number of items of data in the database having the synonym candidate exceeds the threshold and the determination that the first category and the second category are the same, the adding of the synonym candidate as a synonym for the token into the expansion dictionary including updating a data structure in the database to be associated the synonym candidate with the token;
receiving a search query that includes the token;
determining that the search query is expandable based on the expansion dictionary including the synonym candidate as a synonym for the token;
expanding the search query to include the synonym candidate to form an expanded search query; and
performing a search, using the expanded search query, for data in the database.
2 Assignments
0 Petitions
Accused Products
Abstract
Systems and methods are provided for expanding database search queries. In one embodiment, a method comprises receiving a token that is usable in search queries for data in a database, the database including items of data stored in a tree hierarchy of categories. The method further comprises determining a synonym candidate for the token, and identifying the synonym candidate as a synonym for the token in response to a determination that the token and the synonym candidate are in a same category for a level of the tree hierarchy.
-
Citations
16 Claims
-
1. A method comprising:
-
identifying a token that is usable in search queries for items of data in a database having a hierarchical tree structure and having categories at a plurality of levels in the hierarchical tree structure; determining a synonym candidate for the token; determining whether a number of items of data in the database having the synonym candidate exceeds a threshold, and if so, for a level in the hierarchical tree structure; identifying a first category of the level of the hierarchal tree structure based on the first category having the most items of data in the database with the token, identifying a second category of the level of the hierarchal tree based on the second category having the most items of data in the database with the synonym candidate, and determining that the first category and the second category are the same; adding the synonym candidate as a synonym for the token into an expansion dictionary in response to the determination that the number of items of data in the database having the synonym candidate exceeds the threshold and the determination that the first category and the second category are the same, the adding of the synonym candidate as a synonym for the token into the expansion dictionary including updating a data structure in the database to be associated the synonym candidate with the token; receiving a search query that includes the token; determining that the search query is expandable based on the expansion dictionary including the synonym candidate as a synonym for the token; expanding the search query to include the synonym candidate to form an expanded search query; and performing a search, using the expanded search query, for data in the database. - View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. A system comprising:
-
a memory to store items of data in a database having a hierarchical tree structure and having categories at a plurality of levels in the hierarchical tree structure; and one or more processors, configured to cause the system to perform operations, the operations comprising; identify a token; determine a synonym candidate for the token; determine whether a number of items of data in the database having the synonym candidate exceeds a threshold, and if so, for a level in the hierarchical tree structure; identify a first category of the level of the hierarchal tree structure based on the first category having the most items of data in the database with the token, a second category of the level of the hierarchal tree based on the second category having the most items of data in the database with the synonym candidate, and determine that the first category and the second category are the same; add the synonym candidate as a synonym for the token into an expansion dictionary in response to the determination that the number of items of data in the database having the synonym candidate exceeds the threshold and the determination that the first category and the second category are the same; receive a search query that includes the token; determine that the search query is expandable based on the expansion dictionary including the synonym candidate as a synonym for the token; expand the search query to include the synonym candidate to form an expanded search query; and perform a search, using the expanded search query, for data in the database. - View Dependent Claims (8, 9, 10, 11)
-
-
12. A machine-readable medium carrying instructions which, in response to being executed by a system, cause the system to perform operations including:
-
identifying a token that is usable in search queries for items of data in a database having a hierarchical tree structure and having categories at a plurality of levels in the hierarchical tree structure; determining a synonym candidate for the token; determining whether a number of items of data in the database having the synonym candidate exceeds a threshold, and if so, for a level in the hierarchical tree structure; identifying a first category of the level of the hierarchal tree structure based on the first category having the most items of data in the database with the token, identifying a second category of the level of the hierarchal tree based on the second category having the most items of data in the database with the synonym candidate, and determining that the first category and the second category are the same; and adding the synonym candidate as a synonym for the token into an expansion dictionary in response to the determination that the number of items of data in the database having the synonym candidate exceeds the threshold and the determination that the first category and the second category are the same. - View Dependent Claims (13, 14, 15, 16)
-
Specification