Back to results
US 12,619,608 B1Granted
Query system
AssigneeProgress Software Corporation
InventorRaja Sekhar Chunduru
Life of this patent
Estimating the term…
Abstract
A system and method for efficient query processing using a real index of a queried table are described. In one embodiment, the real index is used in an offset query type in order to reduce the number of rows that are sorted and thereby increases efficiency for processing offset query types. In another embodiment, the real index is used in a set operation query type where existing systems utilize a table scan and thereby increases efficiency of set operation query types.
Claims20
A computer-implemented method comprising:
- receiving, using one or more processors, a set operation query including:
- a join type operator,
- a union type operator,
- an identification of a first queried table, a second queried table, and a third queried table, and
- wherein the first query table and the second queried table are unioned tables;
- adding, using the one or more processors, a plurality of set operator nodes to a query tree, the plurality of set operator nodes including a first set operator node associated with the join type operator and a second set operator node associated with the union type operator;
- inserting, using the one or more processors, a first retrieval node into the query tree associated with the first queried table, a second retrieval node associated with the second queried table, and a third retrieval node associated with the third queried table,
- wherein the first retrieval node corresponds to an index scan of the first queried table using one or more real indices associated with the first queried table,
- wherein the second retrieval node is associated with the second queried table and one of:
- a same order of index scan as the first retrieval node, a different order of index scan than that of the first retrieval node, and a table scan, and
- wherein the second set operator node, the first retrieval node, and the second retrieval node comprise a union subtree;
- and
- selecting, using the one or more processors, the query tree based on a cost, wherein a portion of the cost associated with the union subtree of the query tree is based on a sum of one or more real indices associated with the union subtree.
10 more elements
A system comprising:
- one or more processors;
- and
- a memory storing instructions that, when executed by the one or more processors, cause the system to:
- receive a set operation query including:
- a join type operator,
- a union type operator,
- an identification of a first queried table, a second queried table, and a third queried table, and
- wherein the first query table and the second queried table are unioned tables;
- add a plurality of set operator nodes to a query tree, the plurality of set operator nodes including a first set operator node associated with the join type operator and a second set operator node associated with the union type operator;
- insert a first retrieval node into the query tree associated with the first queried table, a second retrieval node associated with the second queried table, and a third retrieval node associated with the third queried table,
- wherein first retrieval node corresponds to an index scan of the first queried table using one or more real indices associated with the first queried table,
- wherein the second retrieval node is associated with the second queried table and one of:
- a same order of index scan as the first retrieval node, a different order of index scan than that of the first retrieval node, and a table scan, and
- wherein the second set operator node, the first retrieval node, and the second retrieval node comprise a union subtree;
- and
- select the query tree based on a cost, wherein a portion of the cost associated with the union subtree of the query tree is based on a sum of one or more real indices associated with the union subtree.
13 more elements
Dependencies are inferred from the claim text.