Searching for data using superset tree data structures
Some embodiments provide a program that receives a query for records in a table having a value in a column of the table that is included in a set of values. The program further iterates though a hierarchical tree structure in order to identify a set of leaf nodes of the hierarchical tree structure b...
Saved in:
Main Authors | , |
---|---|
Format | Patent |
Language | English |
Published |
06.04.2021
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Some embodiments provide a program that receives a query for records in a table having a value in a column of the table that is included in a set of values. The program further iterates though a hierarchical tree structure in order to identify a set of leaf nodes of the hierarchical tree structure based on the set of values. Each leaf node in the hierarchical tree structure includes data describing a superset of values in the column of the block of records associated with the leaf node. Each non-leaf node includes data describing a superset of the values described by the data in child nodes of the non-leaf node. The program also processes the query on a set of block of records in the table associated with the set of leaf nodes. The program further generates results for the query based on the processing. |
---|---|
Bibliography: | Application Number: US201816124163 |