Comparison tree data structures of particular use in performing lookup operations
US7415472B2 · kind B2 · utility
Assignee
Inventor
Key dates
| Filing date | May 13, 2003 |
| Grant date | Aug 19, 2008 |
| Priority date | — |
| Expiry date | Mar 11, 2025 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/74591
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
Comparison tree data structures of particular use in performing lookup operations are disclosed. A data structure typically includes first and second elements of a subtree, the subtree including a root node. The first and the second elements each include: a node value field for indicating one or more paths from the root node through the subtree for reaching the respective first or second element. The first node also includes a next node indication for use in traversing to the second element. Additionally, one embodiment identifies a lookup value, wherein lookup value includes a first lookup path and a next portion of the lookup value. A first node including a first node value is identified, with the first node value. The first node value is compared with the first lookup path to identify that a matching child node has been identified.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.