Efficient use of trie data structure in databases
AssigneeCenshare GmbH
InventorWalter Bauer
Life of this patent
Estimating the term…
Loading patent…
AssigneeCenshare GmbH
InventorWalter Bauer
Estimating the term…
The invention provides a time-efficient way of performing a query in a database or information retrieval system comprising operations such as intersection, union, difference and exclusive disjunction on two or more sets of keys stored in a database or information retrieval system. In a novel execution model, all data sources and operators are tries, and in input trie for a higher-order set operation can be the output of a lower-order set operation which is evaluated on demand. Two or more input tries are combined in accordance with the respective set operation, to obtain the set of keys associated with the nodes of a respective resulting trie. The physical algebra of the implementation of tries based on bitmaps corresponds directly to the logical algebra for the set operations and allows for efficient implementation by means of bitwise Boolean operations.
A method of retrieving data from an electronic database or information retrieval system, comprising the steps of:
Dependencies are inferred from the claim text.