Techniques for searching for best matches in tables of information
First Claim
Patent Images
1. A computer-implemented method of searching for best matches in a table storing information for dynamic call routing, the method comprising:
- generating a first tree comprising first tree data, wherein the first tree data stores information from rows of the table including the information for dynamic call routing;
dynamically modifying the information for dynamic call routing in the table;
updating the first tree data based on the dynamically modified information for dynamic call routing;
traversing the first tree according to a first value for a first field of the table; and
generating a second tree comprising second tree data wherein generating the second tree comprises saving in the second tree the information that is encountered when traversing the first tree.
2 Assignments
0 Petitions
Accused Products
Abstract
Techniques for searching for best matches in tables of information are provided. A first tree is traversed according to a first value for a first field and as information is encountered at each node, the information is written to a second tree. The second tree is traversed according to a second value for a second field to determine the best match for the first and second values. By utilizing the first and second trees, efficient searching for best matches can be achieved while allowing for dynamic modification of the data.
-
Citations
13 Claims
-
1. A computer-implemented method of searching for best matches in a table storing information for dynamic call routing, the method comprising:
-
generating a first tree comprising first tree data, wherein the first tree data stores information from rows of the table including the information for dynamic call routing; dynamically modifying the information for dynamic call routing in the table; updating the first tree data based on the dynamically modified information for dynamic call routing; traversing the first tree according to a first value for a first field of the table; and generating a second tree comprising second tree data wherein generating the second tree comprises saving in the second tree the information that is encountered when traversing the first tree. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A system comprising:
-
a processor; and a memory coupled with the processor and having stored therein computer code for causing the processor to search for best matches in a table storing information for dynamic call routing by; generating a first tree comprising first tree data, wherein the first tree data stores information from rows of the table including the information for dynamic call routing; dynamically modifying the information for dynamic call routing in the table; updating the first tree data based on the dynamically modified information for dynamic call routing; traversing the first tree according to a first value for a first field of the table; and generating a second tree comprising second tree data wherein generating the second tree comprises saving in the second tree the information that is encountered when traversing the first tree. - View Dependent Claims (9, 10, 11, 12, 13)
-
Specification