Database access using a space-filling curve
AssigneeeBay Inc.
InventorsJennica Pounds, Jiaxin Shan, Xiangdong Peng
Life of this patent
Estimating the term…
Loading patent…
AssigneeeBay Inc.
InventorsJennica Pounds, Jiaxin Shan, Xiangdong Peng
Estimating the term…
Disclosed is an approach for improved access of databases using a space-filling curve, such as a z-order curve, and a sparse tree. The space-filling curve traverses every point in n-dimensional space of a multidimensional data structure. The sparse tree can be implemented as a cache to store which rows of the multidimensional data structure have actual data. The sparse tree may have one or more nodes merged into a single node, The sparse tree may have one or more node limits at each node that limit node spawning. Node counters track how many rows containing data not mapped correspond to each node. As the multidimensional data structure is searched, the search path is adjusted by reseeking back to rows that are located in the sparse tree. Further, the search path is adjusted by reseeking back to rows that are located within a query box.
A method comprising:
A system comprising:
A non-transitory machine-readable storage medium embodying instructions that, when executed by a machine, cause the machine to perform operations comprising:
Dependencies are inferred from the claim text.