Variable length data sequence backtracking a trie structure

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