Efficient high speed trie search process
US5640551A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Apr 14, 1993 |
| Grant date | Jun 17, 1997 |
| Priority date | — |
| Expiry date | Apr 14, 2013 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99935
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
An efficient speed trie search process which generates a sequence of pointers for each family of children in a trie, the sequences of pointers being organized in a predefined order according to a detected data type information of the input data stream. In response to the detected data type information, the trie search process selects a pointer sequence organization from one or more predefined organization sequences, such as an organization sequence from the most recently matched data in a family of nodes to the least recently matched data in that family of nodes, an organization in accordance to a predetermined frequency distribution of a predefined set of data symbol, or an adaptive frequency distribution sequence of a set of symbols detected in an input data stream. Such arrangement of pointers, in response to the detected input data type, reduces significantly the process time to search through a trie for matching data strings. In an another alternative embodiment, a lookup table is provided for the first level search, comprising searching the family consisting the children of the root of the trie.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.