US 11,809,427 B2
Storing nested complex data structures in a data store
Nicholas White, London (GB)
Assigned to Palantir Technologies Inc., Denver, CO (US)
Filed by Palantir Technologies Inc., Palo Alto, CA (US)
Filed on May 2, 2022, as Appl. No. 17/734,334.
Application 17/734,334 is a continuation of application No. 16/538,726, filed on Aug. 12, 2019, granted, now 11,321,316.
Application 16/538,726 is a continuation of application No. 15/632,105, filed on Jun. 23, 2017, granted, now 10,394,814, issued on Aug. 27, 2019.
Claims priority of provisional application 62/468,859, filed on Mar. 8, 2017.
Prior Publication US 2022/0261402 A1, Aug. 18, 2022
This patent is subject to a terminal disclaimer.
Int. Cl. G06F 16/2453 (2019.01); G06F 16/248 (2019.01); G06F 16/22 (2019.01); G06F 16/13 (2019.01)
CPC G06F 16/24542 (2019.01) [G06F 16/13 (2019.01); G06F 16/221 (2019.01); G06F 16/2282 (2019.01); G06F 16/248 (2019.01)] 20 Claims
OG exemplary drawing
 
1. A data processing method, comprising:
creating a digital file of data comprising a first set of uncompressed metadata chunks and a set of compressed data chunks in a database;
receiving a search query specifying a particular data value;
reading a particular metadata chunk of the first set of uncompressed metadata chunks,
wherein
the particular metadata chuck is next to a particular compressed data chunk of the set of compressed data chunks that comprises a first set of values,
the particular metadata chunk comprises a first set of bits, a particular subset of bits of the first set of bits indicates a maximum value of the first set of values;
without decompressing the particular compressed data chunk, performing:
detecting that the particular data value is greater than the maximum value of the first set of values, and
generating a response to the search query that is based on an additional compressed data chunk of the set of compressed data chunks that is not the particular compressed data chunk.