Generating union queries using tensor representations
AssigneeInternational Business Machines Corporation
InventorLance Christopher Amundsen
Life of this patent
Estimating the term…
Loading patent…
AssigneeInternational Business Machines Corporation
InventorLance Christopher Amundsen
Estimating the term…
Query results and statistics regarding them are generated using a novel representation of an n-attribute relation as an order n relational tensor. Orders of the relational tensor respectively correspond to each of the attributes, and each coordinate along an order relates to a key value of the corresponding attribute. Numeric values are stored in the relational tensor, each numeric value representing a count of tuples having the attribute key values that correspond to the coordinate of the numeric value along the orders of the relational tensor. This storage representation is useful in a variety of contexts for enhancing the performance of a RDBMS system. Specifically, a data-representing relational tensor can be used to produce results for tuple grouping operations such as the SQL operations COUNT . . . GROUP BY, SUM . . . GROUP BY, AVG . . . GROUP BY, MIN . . . GROUP BY and MAX . . . GROUP BY.
A method of performing a query in a relational database system by operating upon a relation comprising a plurality of tuples formed over a plurality of attributes, comprising:
Apparatus for performing a query in a relational database system by operating upon a relation comprising a plurality of tuples formed over a plurality of attributes, comprising:
A program product comprising:
Dependencies are inferred from the claim text.