APPARATUS AND METHODS FOR TRANSFORMING RELATIONAL QUERIES INTO MULTI-DIMENSIONAL QUERIES

• US 20100017395A1
• Filed: 05/27/2009
• Published: 01/21/2010
• Est. Priority Date: 07/16/2008
• Status: Abandoned Application

• Current Assignee: Sapphire Information Systems Limited
• Original Assignee: Sapphire Information Systems Limited
• Inventors: WAYN, Tal, ORE, Leonid
• Application Number:
  US12/472,949
• Publication Number:
  US 20100017395A1
• Time in Patent Office: Days
• US Class Current: N/A
• CPC Class Codes: G06F 16/24 Querying
• CPC Class Codes: G06F 16/283 Multi-dimensional databases or data warehouses, e.g. MOLAP or ROLAP

Abstract

A query processor operative to accept queries with respect to data and to formulate responses to the queries and a data system comprising a query analyzer operative to perform breakdown analysis of queries thereby to generate a hierarchical representation of queries and a hierarchical query storage unit operative to store the hierarchical representations. A hierarchical representation processor operative to receive hierarchically represented queries and to formulate all possible multi dimensional roles of its query elements; and a multi dimensional role storage unit operative to store the hierarchical representations with their respective multi dimensional roles. A stochastic query processor operative to accept the hierarchical representations with their respective multi dimensional roles and to eliminate all improbable combinations of query elements (clause components) and multi dimensional roles. Hierarchical representations with their respective multi dimensional roles query processor operative to accept hierarchical representations with their respective multi dimensional roles from a data storage unit and to formulate most probable multidimensional representation of initial relational query.

Claims

1. A data system operative in conjunction with a data storage unit operative to store data and a query processor operative to accept queries with respect to the data in the data storage unit and to formulate responses to the queries by accessing the data storage unit, the data system comprising:

a query analyzer operative to perform breakdown analysis of queries thereby to generate a hierarchical representation of each of at least some queries received by the query processor; and

a hierarchical query storage unit operative to store said hierarchical representations.

2. A system according to claim 1 wherein said query analyzer comprises:

apparatus for breaking down an input query on the data storage unit into a set of at least one clauses; and

apparatus for recursively breaking down at least one of said plurality of clauses into a set of at least one clause components,

thereby to define a hierarchical representation of said input query.

4. A system according to claim 1 and also comprising a hierarchy analyzer operative to analyze at least one leaf clause component of an individual hierarchy and comprising:

a leaf clause component characterization unit operative to generate an initial characterization of at least one leaf clause component as at least one of a dimension, a measure within a multi-dimensional query definition language; and

a cross-analyzer operative to generate an advanced characterization of at least one leaf clause component as exactly one of a dimension and a measure within a multi-dimensional query definition language.

5. A system according to claim 4 and also comprising a meta-data analyzer having access rights to said data storage unit and operative to narrow the initial characterization of at least one leaf clause component which is a field in said data storage unit.

6. A system according to claim 1 wherein said hierarchical query storage unit comprises a parent-child structure.

10. A system according to claim 1 wherein said data storage unit comprises at least one table.

11. A system according to claim 2 and also comprising apparatus for generating an MDX query from said clause components.

12. A system according to claim 1 wherein data stored in said data storage unit is stored in a relational format and wherein said query processor comprises an SQL processor.

13. A system according to claim 4 and also comprising apparatus for generating an MDX query from said clause components by selecting at least one leaf clause component whose advanced characterization is “

dimension”

to define at least one dimension axis of the MDX query.

14. A system according to claim 5 and also comprising apparatus for generating an MDX query from said clause components by partitioning a set of leaf clause components whose advanced characterization is “

measure”

into a first “

measure”

subset and a second “

filter”

subset, defining a measure axis for the MDX query based on the leaf clause components in the first “

measure”

subset and defining the leaf clause components in the second “

filter”

subsets as filters on said at least one dimension axis.

15. A system according to claim 2 and also comprising a hierarchy analyzer operative to analyze at least one leaf clause component of an individual hierarchy and comprising:

a leaf clause component characterization unit operative to generate an initial characterization of at least one leaf clause component as at least one of a dimension and a measure within a multi-dimensional query definition language; and

a cross-analyzer operative to generate an advanced characterization of at least one leaf clause component as exactly one of a dimension and a measure within a multi-dimensional query definition language.

16. A system according to claim 15 wherein said apparatus for recursively breaking down is operative to break down each “

from”

clause into a set of at least one clause components including at least one leaf clause component each defining a table within said data storage unit which is associated with the “

from”

clause,

and wherein said cross-analyzer is also operative to characterize each leaf clause component defining a table as either a dimension table or a fact table.

20. A system according to claim 1 and also comprising a data storage unit operative to store data.

23. A system according to claim 1 and also comprising a query processor operative to accept queries with respect to the data in the data storage unit and to formulate responses to the queries by accessing the data storage unit.

24. A system according to claim 1 and also comprising a relational database management system including:

a data storage unit operative to store data; and

a query processor operative to accept queries with respect to the data in the data storage unit and to formulate responses to the queries by accessing the data storage unit.

3. A system for performing breakdown analysis of queries on at least one relational data storage unit, the system comprising:

apparatus for breaking down an input query on a data storage unit into a set of at least one clauses; and

apparatus for recursively breaking down at least one of said plurality of clauses into a set of at least one clause components,

thereby to define a hierarchy representing said input query and comprising clauses below the input query and clause components below the clauses, wherein some of said clause components are leaves which are not parents of any other clause component.

7. A system according to claim 3 wherein said input query comprises an SQL statement.

8. A system according to claim 3 wherein said input query comprises an XML statement.

9. A system according to claim 3 wherein said input query is represented as a string of characters.

17. A system according to claim 3, wherein said input query is represented as an XML expression.

18. A system according to claim 3, wherein said input query is represented as an XMLA expression.

19. A system according to claim 9 wherein said string of characters comprises an MDX string.

21. A query processing method operative in conjunction with a data storage unit operative to store data and a query processor operative to accept queries with respect to the data in the data storage unit and to formulate responses to the queries by accessing the data storage unit, the method comprising:

performing a breakdown analysis of queries thereby to generate a hierarchical representation of each of at least some queries received by the query processor.

22. A method for performing breakdown analysis of queries on at least one relational data storage unit, the method comprising:

breaking down an input query on a data storage unit into a set of at least one clauses; and

recursively breaking down at least one of said plurality of clauses into a set of at least one clause components including defining a hierarchy representing said input query and comprising clauses below the input query and clause components below the clauses, wherein some of said clause components are leaves which are not parents of any other clause component.