System and method for query auto-completion using a data structure with trie and ternary query nodes
First Claim
1. A method of providing predictive search query recommendations for a search query, the method being implemented via execution of computer instructions configured to run at one or more processing modules and configured to be stored at one or more non-transitory memory storage modules, the method comprising:
- receiving the search query from a user;
determining the predictive search query recommendations for the search query using a tree data structure, wherein at least one top layer of the tree data structure comprise at least one trie query node, and wherein bottom layers of the tree data structure comprise ternary tree query nodes; and
sending the predictive search query recommendations to the user,wherein;
the at least one top layer of the tree data structure having the at least one trie query node are at least three layers at a top of the tree data structure;
the tree data structure comprises query nodes and solution nodes;
the query nodes comprise the at least one trie query node and the ternary tree query nodes;
each of the solution nodes is a leaf node of the tree data structure, is a child of a ternary tree query node within the ternary tree query nodes, and comprises a predictive query solution and a score;
each of the ternary tree query nodes comprises a subtree score that is equal to a highest score of any of the solution nodes in a subtree that is rooted at the ternary tree query node; and
determining the predictive search query recommendations comprises;
determining an ending-character query node from among the query nodes based on the search query; and
if the ending-character query node is one of the ternary tree query nodes;
determining a subset of the solution nodes having scores that are in a group of highest scores in any of the solution nodes that are in an ending-character subtree that is rooted at the ending-character query node; and
using the predictive query solutions of the solution nodes in the subset of the solution nodes as the predictive search query recommendations.
4 Assignments
0 Petitions
Accused Products
Abstract
A method of providing predictive search query recommendations for a search query. The method can be implemented via execution of computer instructions configured to run at one or more processing modules and configured to be stored at one or more non-transitory memory storage modules. The method can include receiving the search query from a user. The method also can include determining the predictive search query recommendations for the search query using a tree data structure. At least one top layer of the tree data structure can include at least one trie query node and bottom layers of the tree data structure can include ternary tree query nodes. The method further can include sending the predictive search query recommendations to the user. Other embodiments of related systems and methods are also disclosed.
39 Citations
20 Claims
-
1. A method of providing predictive search query recommendations for a search query, the method being implemented via execution of computer instructions configured to run at one or more processing modules and configured to be stored at one or more non-transitory memory storage modules, the method comprising:
-
receiving the search query from a user; determining the predictive search query recommendations for the search query using a tree data structure, wherein at least one top layer of the tree data structure comprise at least one trie query node, and wherein bottom layers of the tree data structure comprise ternary tree query nodes; and sending the predictive search query recommendations to the user, wherein; the at least one top layer of the tree data structure having the at least one trie query node are at least three layers at a top of the tree data structure; the tree data structure comprises query nodes and solution nodes; the query nodes comprise the at least one trie query node and the ternary tree query nodes; each of the solution nodes is a leaf node of the tree data structure, is a child of a ternary tree query node within the ternary tree query nodes, and comprises a predictive query solution and a score; each of the ternary tree query nodes comprises a subtree score that is equal to a highest score of any of the solution nodes in a subtree that is rooted at the ternary tree query node; and determining the predictive search query recommendations comprises; determining an ending-character query node from among the query nodes based on the search query; and if the ending-character query node is one of the ternary tree query nodes; determining a subset of the solution nodes having scores that are in a group of highest scores in any of the solution nodes that are in an ending-character subtree that is rooted at the ending-character query node; and using the predictive query solutions of the solution nodes in the subset of the solution nodes as the predictive search query recommendations. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13)
-
-
14. A system for providing predictive search query recommendations for a search query, the system comprising:
-
one or more processing modules; and one or more non-transitory memory storage modules storing computing instructions configured to run on the one or more processing modules and perform; receiving the search query from a user; determining the predictive search query recommendations for the search query using a tree data structure, wherein at least one top layer of the tree data structure comprise at least one trie query node, and wherein bottom layers of the tree data structure comprise ternary tree query nodes; and sending the predictive search query recommendations to the user, wherein; the at least one top layer of the tree data structure having the at least one trie query node are at least three layers at a top of the tree data structure; the tree data structure comprises query nodes and solution nodes; the query nodes comprise the at least one trie query node and the ternary tree query nodes; each of the solution nodes is a leaf node of the tree data structure, is a child of a ternary tree query node within the ternary tree query nodes, and comprises a predictive query solution and a score; each of the ternary tree query nodes comprises a subtree score that is equal to a highest score of any of the solution nodes in a subtree that is rooted at the ternary tree query node; and determining the predictive search query recommendations comprises; determining an ending-character query node from among the query nodes based on the search query; and if the ending-character query node is one of the ternary tree query nodes; determining a subset of the solution nodes having scores that are in a group of highest scores in any of the solution nodes that are in an ending-character subtree that is rooted at the ending-character query node; and using the predictive query solutions of the solution nodes in the subset of the solution nodes as the predictive search query recommendations. - View Dependent Claims (15, 16, 17, 18, 19, 20)
-
Specification