US 11,886,411 B2
Data storage using roaring binary-tree format
Benjamin Johnson, Littleton, CO (US); and Todd Gruben, Austin, TX (US)
Assigned to Molecula Corp., Austin, TX (US)
Filed by Molecula Corp., Austin, TX (US)
Filed on Aug. 31, 2021, as Appl. No. 17/462,517.
Claims priority of provisional application 63/192,426, filed on May 24, 2021.
Prior Publication US 2022/0374404 A1, Nov. 24, 2022
Int. Cl. G06F 16/20 (2019.01); G06F 16/22 (2019.01); H03M 7/30 (2006.01)
CPC G06F 16/2246 (2019.01) [G06F 16/2237 (2019.01); H03M 7/30 (2013.01)] 19 Claims
OG exemplary drawing
 
1. A method, comprising:
receiving, by a computer system, a request to generate a bitmap index based on a dataset stored at an origin data source; and
generating, by the computer system, the bitmap index, wherein the generating includes:
selecting an ingestion routine based on the origin data source;
ingesting, using the ingestion routine, at least a portion of the dataset into a data format of the bitmap index;
performing a compression procedure on the ingested dataset to generate a plurality of data containers, wherein a given data container includes a respective compressed portion of the ingested dataset; and
storing the plurality of data containers of the bitmap index in pages that are nodes that form a set of binary trees (b-trees); and
processing a data request for data of the dataset against the set of b-trees without accessing the origin data source.