US 11,899,641 B2
Trie-based indices for databases
Branimir Zdravkov Lambov, Nesebar (BG)
Assigned to DataStax, Inc., Santa Clara, CA (US)
Filed by DataStax, Inc., Santa Clara, CA (US)
Filed on Dec. 13, 2021, as Appl. No. 17/549,570.
Application 17/549,570 is a continuation of application No. 16/020,936, filed on Jun. 27, 2018, granted, now 11,204,905.
Prior Publication US 2022/0255014 A1, Aug. 11, 2022
Prior Publication US 2023/0006144 A9, Jan. 5, 2023
This patent is subject to a terminal disclaimer.
Int. Cl. G06F 16/22 (2019.01); C07D 209/86 (2006.01); H10K 85/60 (2023.01); H10K 50/15 (2023.01); H10K 50/17 (2023.01)
CPC G06F 16/2246 (2019.01) [C07D 209/86 (2013.01); G06F 16/2255 (2019.01); H10K 85/624 (2023.02); H10K 85/626 (2023.02); H10K 85/6572 (2023.02); H10K 50/15 (2023.02); H10K 50/17 (2023.02)] 20 Claims
OG exemplary drawing
 
1. A database system, comprising:
a cluster of database nodes that stores a distributed database, each database node storing one or more partitions of the distributed database, each partition including a set of database rows, each database node including:
one or more processors; and
a memory storing instructions that, when executed by the one or more processors, cause the one or more processors to:
access a key for a record including a partition key and a clustering key;
convert the key into a byte-comparable sequence of byte values comprising a first portion of the byte-comparable sequence of bytes obtained from the partition key and a second portion of the byte-comparable sequence of bytes obtained from the clustering key;
reference a partition trie index using the byte-comparable sequence of byte values of the record generated from the key to determine a partition of the distributed database; and
access the record from the partition of the distributed database.