05787430 is referenced by 182 patents and cites 5 patents.

The building, maintenance, and use of a database is described having a trie-like structure for storing entries and retrieving an at least partial match, preferably the longest partial match, or all partial matches of a search argument (input key) from said entries, said database having nodes (20), with each node containing first link information (21) leading to at least one previous node (parent pointer) and second link information (25,26) leading to at least one following node (child pointer), at least a stored key (entry, 23, 24), or a combination, thereof. The particular structure of the nodes allows a two-step search process, in which segments of a search argument are firstly used to determine a search path through the trie-like database, said search path being backtracked in the second part of the search. During the second part of the search the entire search argument is compared to entries stored in the nodes until a match is found. The described database allows an efficient use of memories and is advantageously applied to fast data retrieval, in particular related to communication within computer networks. No recursive procedures are applied.

Title
Variable length data sequence backtracking a trie structure
Application Number
8/765764
Publication Number
5787430
Application Date
December 17, 1996
Publication Date
July 28, 1998
Inventor
Mohan Sharma
Mountain View
CA, US
Mehdi Nassehi
Horgen
CH
Gunter Karjoth
Waedenswil
CH
Douglas Dykeman
Richterswil
CH
Willibald Doeringer
Fussgoenheim
DE
Agent
Douglas W Cameron
Assignee
International Business Machines Corporation
NY, US
IPC
G06F 17/30
View Original Source