US 11,693,866 B2
Efficient in-memory multi-version concurrency control for a trie data structure based database
Walter Bauer, Munich (DE)
Assigned to CENSHARE GMBH, Munich (DE)
Appl. No. 17/277,238
Filed by CENSHARE GMBH, Munich (DE)
PCT Filed Sep. 18, 2019, PCT No. PCT/EP2019/074932
§ 371(c)(1), (2) Date Mar. 17, 2021,
PCT Pub. No. WO2020/058300, PCT Pub. Date Mar. 26, 2020.
Claims priority of application No. 18195454 (EP), filed on Sep. 19, 2018.
Prior Publication US 2021/0357400 A1, Nov. 18, 2021
Int. Cl. G06F 16/2458 (2019.01); G06F 16/23 (2019.01); G06F 16/22 (2019.01); G06F 12/02 (2006.01)
CPC G06F 16/2474 (2019.01) [G06F 12/0253 (2013.01); G06F 16/2246 (2019.01); G06F 16/2272 (2019.01); G06F 16/2329 (2019.01)] 24 Claims
OG exemplary drawing
 
1. A computer-implemented method for determining, in an electronic database application or information retrieval system, a storage location of a database object of a specific version, wherein indexes for each version of the database object are stored in a trie having a root node corresponding to the specific version, the method comprising:
determining a trie corresponding to the specific version by accessing the root node of the trie corresponding to the specific version;
determining an object identifier of the database object by traversing the trie corresponding to the specific version using a secondary key related to the database object as search key; and
determining the storage location of the database object by traversing the trie corresponding to the specific version using the determined object identifier as search key,
wherein the trie having a root node corresponding to the specific version is created by:
creating a new root node for the specific version,
copying and modifying the nodes that have been amended with regard to the nodes of a previous trie having a root node corresponding to the previous version, and
creating references pointing to the nodes in the previous trie that have not been amended.