Apparatus and method for processing multi-dimensional queries in a shared nothing system through tree reduction
AssigneeJoviandata, Inc.
InventorsSatya Ramachandran, Anupam Singh, Parveen Jain, Sushil Thomas
Life of this patent
Estimating the term…
Abstract
A computer readable storage medium includes executable instructions to receive a request for data from a multi-dimensional cube divided into partitions distributed across nodes supporting a shared nothing distributed multi-dimensional database. The request is transformed into physical access layer operators in a tree structure. The tree structure is reduced into an index scan operator.
Claims19
A computer readable storage medium, comprising executable instructions to:
- receive a request for data from a multi-dimensional cube divided into a plurality of partitions distributed across a plurality of nodes supporting a shared nothing distributed multi-dimensional database;
- transform the request into physical access layer operators in a tree structure;
- and
- reduce the tree structure into a first index scan operator at least in part by applying a set of transformation rules to the tree structure, wherein the set of transformation rules comprises a leaf transformation rule, wherein the leaf transformation rule provides for transformation of at least one leaf node into a second scan index operator, and a query transformation rule, wherein the query transformation rule provides for transformation of at least one axis node and at least the second scan index operator into the first scan index operator.
A computing system, having a memory, comprising:
- a component configured to store a plurality of transformation rules, wherein the stored plurality of transformation rules comprise at least one slicer transformation rule, at least one children transformation rule, and at least one crossjointransformation rule;
- a component configured to receive a request for data from a multi-dimensional cube divided into a plurality of partitions distributed across a plurality of nodes supporting a shared nothing distributed multi-dimensional database;
- a component configured to transform the request into physical access layer operators in a tree structure;
- and
- a component configured to reduce the tree structure into an index scan operator of a physical plan based on a set of transformation rules wherein the reducing is based at least in part on the at least one slicer transformation rule, the at least one children transformation rule, and the at least one crossjointransformation rule;
- and
- wherein at least one of the components comprises computer-executable instructions stored in the memory for execution by the computing system.
A method, performed by a computing system having a processor, the method comprising:
- storing a plurality of transformation rules, wherein the stored plurality of transformation rules comprise at least one leaf transformation rule, at least one query transformation rule, and at least one uniontransformation rule;
- receiving a request for data from a multi-dimensional cube divided into a plurality of partitions distributed across a plurality of nodes supporting a shared nothing distributed multi-dimensional database;
- transforming the request into physical access layer operators in a tree structure;
- and
- reducing the tree structure into an index scan operator based on a set of transformation rules wherein the reducing is based at least in part on the at least one leaf transformation rule, the at least one query transformation rule, and the at least one uniontransformation rule.
Dependencies are inferred from the claim text.