Patent · US Active

Hash trie based optimization of database operations

US11556532B2 · kind B2 · utility

0Cited by

3References

16Claims

0Family size

Assignee

SAP SE · DE

Inventors

Nico Bohnsack · Ingersleben, DE
Dennis Felsing · Leimen, DE
Arnaud Lacurie · Mannheim, DE
Wolfgang Stephan · Heidelberg, DE

Key dates

Filing date	Mar 27, 2019
Grant date	Jan 17, 2023
Priority date	—
Expiry date	Oct 18, 2039

Classification

Technology area (CPC G)Physics
CPC primaryG06F16/244
WIPO fieldComputer technology
WIPO sectorElectrical engineering

Abstract

A method may include inserting, into a hash trie, data records from a database table. The inserting may include traversing the hash trie to identify, for each data record included in the database table, a corresponding node at which to insert the data record. The hash trie may be traversed based on a hash of a key value associated with each data record. The node at which to insert a data record may be identified based on an offset forming a binary representation of the hash of a key value associated with that data record. The offset may include a portion of a plurality of binary digits forming the binary representation. A data record may be inserted at a corresponding node by updating a data structure included at the node. A database operation may be performed based on the hash trie filled with the data records from the database table.

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