System to generate a structured query language query by using a dimensional hierarchy
First Claim
1. A machine-implemented method of collapsing a data tree hierarchy, the data tree hierarchy including leaf nodes and at least one root node, and each node including a system identification (SID), the method comprising:
- for each leaf node,at a leaf-node row;
writing a leaf-node key value to a first column in a data table; and
writing a corresponding leaf-node SID value to a second column in the data table; and
at a root-node row;
writing the leaf-node key value to the first column; and
writing a corresponding root-node SID value to the second column, the entire data tree hierarchy collapsed into the first column and the second column, the second column having the leaf-node SID values representing a trail of traversal of the tree for each leaf node through intermediate nodes and to the at least one root node.
2 Assignments
0 Petitions
Accused Products
Abstract
A tree-structured database is collapsed into a two-column table. The two-column table includes a characteristic key value for a given leaf node in the first column and the system identification (SID) relating to the characteristic key value in the second column and also identifying the node that leads to the characteristic key value. Data is presented by coupling the characteristic key value with a transaction table. A query that is formulated in an infocube may be translated to a relational data base query, collapsed, and reformulated into an infocube result set, or vice versa.
-
Citations
14 Claims
-
1. A machine-implemented method of collapsing a data tree hierarchy, the data tree hierarchy including leaf nodes and at least one root node, and each node including a system identification (SID), the method comprising:
-
for each leaf node, at a leaf-node row; writing a leaf-node key value to a first column in a data table; and writing a corresponding leaf-node SID value to a second column in the data table; and at a root-node row; writing the leaf-node key value to the first column; and writing a corresponding root-node SID value to the second column, the entire data tree hierarchy collapsed into the first column and the second column, the second column having the leaf-node SID values representing a trail of traversal of the tree for each leaf node through intermediate nodes and to the at least one root node. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A machine-implemented method, comprising:
-
collapsing an entire data tree hierarchy into a two-column data table, the data tree hierarchy includes leaf nodes, at least one intermediate node, and at least one root node, and each node including a system identification (SID); collapsing includes; for each leaf node, writing a leaf-node key value to only the first column in the data table, and writing a corresponding leaf-node SID value to only the second column in the data table, the second column representing a trail of traversal through the data tree hierarchy for each leaf node though the at least one intermediate node and to the at least one root node; at a next row, writing the leaf-node key value to the first column, and writing a corresponding internal-node SID value to the second column; at yet a next row, writing the leaf-node key value to the first column, and writing a corresponding root-node SID value to the second column; at still yet a next row, writing a subsequent leaf-node key value to the first column, and writing a corresponding subsequent leaf-node SID value to the second column; and aggregating the SID values. - View Dependent Claims (10, 11, 12, 13, 14)
-
Specification