Data processing: database and file management or data structures – Database design – Data structure types
Patent
1995-06-07
2000-01-11
Kulik, Paul V.
Data processing: database and file management or data structures
Database design
Data structure types
370351, 370389, 370392, 709238, G06F 1730
Patent
active
060146591
ABSTRACT:
Aspects of the invention include a method of conducting a reduced length search along a search path. A node which would otherwise occur between a previous and a following node in the search path is eliminated, and information is stored as to whether, had said eliminated node been present, the search would have proceeded to the following node. During the search, a search argument is compared with the stored information, and the search effectively progresses from the previous node directly to the following node if the comparison is positive. In preferred embodiments, some nodes provide result values for the search, and a node is eliminated only if its presence would not affect the result value for the search. In another aspect, the invention features a method of conducting a two mode search of reduced length. For a first mode of the search, nodes along a search path are provided, at least some of the nodes including one or more pointers pointing to other nodes. A search argument comprising a series of search segments is provided, some values of segments of the argument corresponding to nodes along the search path, some other values of the segments relating to a second mode of the search. Indicators associated with nodes are provided, each indicator indicating the segments corresponding to the second mode. The search path is searched by processing successive search segments by inspecting the indicator associated with each node, and proceeding to the second search mode if the indicator indicates that the segment relates to the second mode.
REFERENCES:
patent: 3676851 (1972-07-01), Eastman
patent: 4384325 (1983-05-01), Slechth, Jr. et al.
patent: 4433392 (1984-02-01), Beaven
patent: 4453217 (1984-06-01), Boivie
patent: 4464650 (1984-08-01), Eastman et al.
patent: 4464718 (1984-08-01), Dixon et al.
patent: 4468728 (1984-08-01), Wang
patent: 4606002 (1986-08-01), Waisman et al.
patent: 4621362 (1986-11-01), Sy
patent: 4644496 (1987-02-01), Andrews
patent: 4677550 (1987-06-01), Ferguson
patent: 4706081 (1987-11-01), Hart et al.
patent: 4811337 (1989-03-01), Hart
patent: 4823111 (1989-04-01), Tsuchiya et al.
patent: 4882699 (1989-11-01), Evensen
patent: 4906991 (1990-03-01), Fiala et al.
patent: 4914571 (1990-04-01), Baratz et al.
patent: 5001755 (1991-03-01), Skret
patent: 5008882 (1991-04-01), Peterson et al.
patent: 5079767 (1992-01-01), Perlman
patent: 5202986 (1993-04-01), Nickel
patent: 5497485 (1996-03-01), Ferguson et al.
patent: 5519858 (1996-05-01), Walton et al.
patent: 5721899 (1998-02-01), Namba
patent: 5781772 (1998-07-01), Wilkinson, III et al.
Ai-Suwaiyel and Horowitz, Algorithms for Trie Compaction, ACM Trans. Database System, 9(2):243-263, 1977.
Amer et al., A Survey of Hierarchical Routing Algorithms and a New Hierarchical Hybrid Adaptive Routing Algorithm for Large . . . Networks, Communications, IEEE Int. Conf., Jun. 12-15 1988, pp. 999-1003, 1988.
Comer and Sethi, The Complexity of Trie Index Construction, Jour. ACM, 24(3):428-440, 1977.
Comer, Heuristics for Trie Index Minimization, ACM Trans. Database System, 4(3):383-395, 1979.
Fredkin, Trie Memory, Comm. ACM 3(9):490-499, 1960.
Garcia-Luna-Aceves, Routing Management in Very Large-Scale Networks, Future Generations Computer Systems 4:81-93, 1988.
Knuth, "Patricia" Algorithm from Sorting and Searching, The Art of Computer Programming III, Addison-Wesley Publishing Co., Reading, MA, 1970, pp. 490-493.
Ramesh et al., Variable-Depth Trie Index Optimization: Theory and Experimental Results, ACM Transactions on Database Systems 14:41-74, 1989.
Seifert, Bridges and Routers, IEEE Network Magazine, 2(1):57-64, 1988.
Wolstenholme, Filtering of Network Addresses in Real Time by Sequential Decoding, IEEE Proceedings 135:55-59, 1988.
Poole Nigel T.
Varghese George
Wilkinson, III Hugh M.
Cabletron Systems Inc.
Kulik Paul V.
LandOfFree
Compressed prefix matching database searching does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Compressed prefix matching database searching, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compressed prefix matching database searching will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1469704