Linear programming approach for querying a trie data structure

摘要

The present invention provides a method and system for querying a trie data structure. The method and system include constructing a pool of linear programming problems for a trie data structure, storing the pool of linear programming problems in a memory, receiving a request, setting variables in one linear programming problem to unity, sending the one linear programming problem to a solver, wherein the solver sets a p variable corresponding to each path to 0 or 1, iterating through p variables corresponding to one or more paths, considering at most n paths, selecting one path from the n paths, assigning same values as that of one or more variables of the unknown value type nodes that are present in the selected one path, and reselling variables in the one linear programming problem to zero that was previously set to unity.