The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
May. 31, 2022

Filed:

Apr. 24, 2019
Applicant:

Censhare Gmbh, Munich, DE;

Inventor:

Walter Bauer, Munich, DE;

Assignee:

Censhare GMBH, Munich, DE;

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G06F 16/2455 (2019.01); G06F 16/2453 (2019.01); G06F 9/30 (2018.01); G06F 17/11 (2006.01); G06F 16/22 (2019.01);
U.S. Cl.
CPC ...
G06F 16/24558 (2019.01); G06F 9/30029 (2013.01); G06F 16/2237 (2019.01); G06F 16/2246 (2019.01); G06F 16/2453 (2019.01); G06F 16/24561 (2019.01); G06F 17/11 (2013.01);
Abstract

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 are tries. 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. An intersection operation performed in this way can be used for efficient range queries, in particular when two or more data items are involved in the query. 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.


Find Patent Forward Citations

Loading…