Patent · US Expired

System and methodology for providing compact B-Tree

US6694323B2 · kind B2 · utility

67Cited by
4References
59Claims
0Family size

Assignee

Inventor

Key dates

Filing dateJan 27, 2003
Grant dateFeb 17, 2004
Priority date
Expiry dateJan 27, 2023

Classification

  • Technology area (CPC Y)Emerging Cross-Sectional Technologies
  • CPC primaryY10S707/99943
  • WIPO fieldComputer technology
  • WIPO sectorElectrical engineering

Abstract

An improved method for creating an index based on a path-compressed binary trie in a database system comprising database tables and indexes on those tables is described. For a given index to be created, a path-compressed binary trie for the given index is determined. The path-compressed binary trie comprises internal nodes and leaf nodes. Based on a traversal of the path-compressed binary trie, an index is created comprising a first array of internal nodes encountered during the traversal, and a second array of leaf nodes encountered during the traversal. The database system employs said first and second arrays for providing index-based access for a given key value.

Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.