US20070271227A1 - Apparatus and method for recursively rationalizing data source queries - Google Patents
Apparatus and method for recursively rationalizing data source queries Download PDFInfo
- Publication number
- US20070271227A1 US20070271227A1 US11/435,554 US43555406A US2007271227A1 US 20070271227 A1 US20070271227 A1 US 20070271227A1 US 43555406 A US43555406 A US 43555406A US 2007271227 A1 US2007271227 A1 US 2007271227A1
- Authority
- US
- United States
- Prior art keywords
- query
- data source
- readable medium
- computer readable
- generator
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/283—Multi-dimensional databases or data warehouses, e.g. MOLAP or ROLAP
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2453—Query optimisation
- G06F16/24534—Query rewriting; Transformation
- G06F16/24547—Optimisations to support specific applications; Extensibility of optimisers
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99931—Database or file accessing
- Y10S707/99933—Query processing, i.e. searching
Definitions
- This invention relates generally to querying data within data sources. More particularly, this invention relates an improved method and apparatus to retrieve data from a multi-dimensional data source.
- BI Business Intelligence
- these tools are commonly applied to financial, human resource, marketing, sales, customer and supplier analyses. More specifically, these tools can include: reporting and analysis tools to present information, content delivery infrastructure systems for delivery and management of reports and analytics, data warehousing systems for cleansing and consolidating information from disparate sources, and data management systems to collect, store, and manage raw data.
- OLAP tools are a subset of business intelligence tools. There are a number of commercially available OLAP tools including Business Objects OLAP IntelligenceTM which is available from Business Objects Americas of San Jose, Calif. OLAP tools are a report generation tool, and a tool suited to ad hoc analyses. OLAP generally refers to a technique of providing fast analysis of shared multi-dimensional information stored in a database. OLAP systems provide a multi-dimensional conceptual view of data, including full support for hierarchies and multiple hierarchies. This framework is used because it is a logical way to analyze businesses and organizations. In some OLAP tools the data is arranged in a schema which simulates a multidimensional schema. The multi-dimensional schema means redundant information is stored, but it allows for users to initiate queries without the need to know how the data is organized.
- the querying process for OLAP can involve, depending on the specific implementation, writing and executing a query.
- Multidimensional Expressions is a query language for OLAP databases, like SQL is a query language for relational databases.
- an MDX statement can be used to query for a result from an OLAP data source, i.e., a cube.
- the MDX statement can resemble SQL statements where one can ask for data on a row and columns from a cube.
- each MDX query requires a data request (the “SELECT” clause), a starting point (the “FROM” clause), and a filter (the “WHERE” clause).
- An MDX query specifies the appropriate columns and rows within the SELECT clause (the “ON COLUMNS” and “ON ROWS” clauses).
- the MDX query can have the following format:
- OLAP data sources Due to the nature of OLAP data sources, there is a lot of redundant data and a lot of columns and rows are selected in queries of even moderate complexity. In addition, users typically include many members in their queries. These factors lead to some MDX queries that are too long to be successfully executed by an OLAP server.
- Part of a multidimensional application, or an interface to a multidimensional data source, that communicates with the multidimensional data source maintains a sets of members that will be queried. This set is enumerable.
- a multidimensional query such as an MDX statement, is constructed. Previously this query included an enumeration over a list. For example, a fragment of the MDX query could be:
- the multidimensional query could be a very large statement.
- some multidimensional data sources there can be a hard limit on the size of queries.
- the invention includes a computer readable medium storing computer executable instructions to receive a multidimensional data source query.
- a recursive process is invoked to replace an element of the multidimensional data source query with a generator to create a rationalized query.
- the invention also includes a computer implemented method that converts a plurality of objects, each object including metadata associated with a piece of data in a multidimensional data source, into a query to the multidimensional data source.
- the query is rationalized to create a rationalized query.
- the invention also includes a computer readable medium that stores executable instructions to receive a Multidimensional Expressions (MDX) query.
- MDX Multidimensional Expressions
- the MDX query is recursively rationalized to form a rationalized query.
- the rationalized query is applied to a multidimensional data source to produce query results.
- the query results are returned.
- FIG. 1 illustrates a computer constructed in accordance with an embodiment of the invention.
- FIG. 2 illustrates processing operations associated with an embodiment of the invention.
- FIG. 3 illustrates processing operations associated with an embodiment of the invention.
- FIG. 4 illustrates processing operations implementing an operation from FIG. 3 .
- FIGS. 5A , 5 B, 5 C, and 5 D illustrate a series of schema for a plurality of hierarchies.
- FIG. 6 illustrates an example of a collection of objects.
- a descendent tree is a tree of members with a root member and two or more descendent members over two or more levels.
- Family is a tree of members with a parent member and one or more children members. A two level case of a descendent tree.
- Generator is an expression in a multidimensional query language that can generate a query for one or more members of a data source without explicit specification of the one or more members.
- a generator is a generalized expression of specific data source elements.
- the generators can be for a hierarchy, a level, a family, a descendent tree, or for except logic.
- the generator include the following: “Hierarchy.Members” as a generator to a hierarchy, “Level.Members” as a generator to a level, “Member.Children” as a generator to a family, and “Descendants(Member, Level, Self)” as a generator to a decent tree.
- MDX the Except logic generator is “Except(x, y)”, where x, y are lists of members, or generators to families, or descendent trees. Here x is the generator to members to be included, and y is the generator to members to be excluded.
- Hierarchy is a set of hierarchically related data in a multidimensional data source, e.g., a cube.
- Level is a level in a hierarchy. Usually a level is a set of members in the hierarchy at an equal depth from a root member of the hierarchy.
- Member is an element of data in a dimension hierarchy.
- MDX Multidimensional Expressions
- SQL structured query language
- Rationalization is the process of simplifying a query, for example, by replacing one or more members in a query with one or more generators. Rationalization reduces the size of the query.
- FIG. 1 illustrates a computer 100 configured in accordance with an embodiment of the invention.
- the computer 100 includes standard components, including a central processing unit 102 and input/output devices 104 , which are linked by a bus 106 .
- the input/output devices 104 may include a keyboard, mouse, touch screen, monitor, printer, and the like.
- a network interface circuit 108 is also connected to the bus 106 .
- the network interface circuit 108 provides connectivity to a network (not shown), thereby allowing the computer 100 to operate in a networked environment.
- a memory 110 is also connected to the bus 106 .
- the memory 110 stores one or more of the following modules: an operating system module 112 , an OLAP module 116 , an MDX module 118 , and a Rationalization module 120 .
- the operating system module 112 may include instructions for handling various system services, such as file services or for performing hardware dependant tasks.
- the OLAP module 116 includes executable instructions for interfacing with an OLAP data source, such as, an OLAP cube (not shown).
- the OLAP module 116 can include executable instructions to allow computer 100 to access any OLAP data source, such as, an application program interface, to a specific types, version, or format of a data source.
- the MDX module 118 includes executable instructions to create an MDX query to an OLAP data source.
- the rationalization module 120 includes executable instructions to rationalize an MDX query.
- the executable instructions try to find patterns in the query and replace the pattern with an appropriate pattern generator.
- the rationalization module 120 compresses the expression for the axis dimensions members for the ON COLUMNS/ROWS clauses.
- the executable modules stored in memory 110 are exemplary. Additional modules, such as a graphical user interface module, can be added. It should be appreciated that the functions of the modules maybe combined. In addition, the functions of the modules need not be performed on a single machine. Instead, the functions may be distributed across a network, if desired. Indeed, the invention is commonly implemented in a client-server environment with various components being implemented at the client-side and/or the server-side. It is the functions of the invention that are significant, not where they are performed or the specific manner in which they are performed.
- FIG. 2 illustrates processing operations 200 that a user may execute on computer 100 .
- the user obtains some metadata data about a collection of objects, 202 .
- the metadata includes sufficient information to query the multidimensional data source for the data.
- processing operation 204 the user queries a data source for the data corresponding to the collection of objects.
- the query uses the metadata for the collection of objects.
- processing operation 206 the user obtains the data.
- FIG. 3 illustrates a series of processing operations 300 which may be used to service the requests made of computer 100 in the processing operations of FIG. 2 .
- metadata data for a collection of objects is received 302 (e.g., at computer 100 ).
- computer 100 creates a simple MDX query.
- the simple MDX query includes a list of objects from the collection of objects.
- the size of the query is proportional to the number of objects in the collection.
- the simple MDX query is preprocessed for rationalization.
- a preprocessing operation includes merging or splitting MDX queries.
- processing operation 308 the simple MDX query is rationalized.
- rationalization includes one or more invocations of a recursive rationalization process.
- processing operation 310 the computer 100 uses the rationalized query to query the data source.
- the query is serviced in accordance with standard methods used with multidimensional data sources.
- the results of the query can be ordered.
- the ordering is performed by a multidimensional server, i.e., not computer 100 .
- the ordering of the results of the query involves placing the results in order of a depth-first search of the hierarchy from with the result came.
- a depth-first search is a method for traversing a tree by starting at the root and exploring as far as possible along each branch before backtracking. Other orderings to make the results logical to the user are also possible. These include breadth-first, alphabetical, and the like.
- the MDX command hierarchy can be sent to the multidimensional server along with the rationalized query. The results of the query are then received 312 .
- FIG. 4 illustrates a series of processing operations 400 used to rationalize a multi-dimension query.
- a null query is created as the rationalized query, 402 . This null query will be augmented in subsequent processing operations.
- the collection of objects can be represented by a generator that specifies the hierarchy. For example, if the collection is all customers in North America, and the hierarchy is the customers by city, state/province, and country, the generator for the query could be “NorthAmericaCustomers.Members”. That is specifying a hierarchy for the North American customers and all members. This generator is combined with the rationalized query 406 .
- a first call is made to a recursive process that rationalizes the query, 412 .
- the parameters passed to the rationalization process are the simple query, the rationalized query as it its, an iteration index, and other parameters.
- the process is recursive and if after one call the rationalization is not complete the recursive process invokes another instance of itself with updated parameters. This shown in FIG. 4 as block 414 .
- a recursive call is 414 —No, and the end of the recursive calls is 414 —Yes.
- the recursive call is predicated on whether further rationalization can be expected to yield results.
- the invocation is subject to other constraints, e.g., elapsed time of processing operations 400 .
- the pseudo code at lines AB-AE is an implementation guide to processing operations 404 and 406 . If the “Simple Query”, i.e., a collection of objects, has the same number of objects as the hierarchy, then the rationalized query is the generator for all objects in the hierarchy.
- the pseudo code at lines AG-AK is an implementation of processing operations 408 and 410 .
- the foreach loop is over the levels in the hierarchy. If the intersection of the level and the collection has the same number of objects as the level, the level is removed from collection and a generator for the level is added to the rationalized query. If the processes described in lines AB-AE and AG-AK removes all the objects in the simple query the rationalization process ends, see lines AF and AL-AN. Otherwise at line AQ, a first call is made to the recursive rationalization process.
- the following code segment is pseudo code that invokes the recursive processing operations from FIG. 4 , and describes code similar to code included in the rationalization module 120 from FIG. 1 .
- the pseudo code at lines BA and BB set a threshold and two lists are created.
- lines BC-BI a map from parent objects to child objects in the “Members”, and the number of children it has in the hierarchy, is created and populated.
- the root member is automatically added, see lines BE-BG.
- each parent not in the map is mapped to its maximum number of children. See, “mapPart(1)” on line BI. Then the parents are mapped to children in the simple query. See, “mapPart(2)” on line BI.
- Members that are children of previously added members are added to the map at line BL
- each object in the map is visited by iterating over the key to the map, “Key”. If for the Key, which is a parent, the number of its children equals the maximum number of children for the parent, then this represents a complete family for which a generator can be created. See lines BP and BQ. The key is added to the members to be added later list since itself may be part of a greater pattern identified in a later instance of the recursive process.
- Line BR if less than all the children present in the family, but more than an amount determined by the “threshold” value are present except logic is employed.
- the list of members to exclude is created, line BS.
- Line BU is executed if the iteration index is 0, meaning the process is examining leaf members and a member one level up in a tree.
- the members to be excluded are appended to the rationalized query with the appropriate generator for except logic.
- Lines BW-BAA are executed if the iteration index is 1.
- a list of descendents to exclude is created and appended to the rationalized query.
- Lines BAC-BAH are executed if the iteration index is 2 or more.
- a list of descendents to exclude on a particular level is created. The level name is supplied by function “level”.
- the list, with the appropriate except generator, is appended to the rationalized query.
- Embodiments of the present invention can rationalize queries that have multiple defects.
- a defect causes the query to be unsymmetrical.
- FIG. 5A illustrates a schema for a balanced query 500 to a hierarchy.
- a balanced query exhibits one form of symmetry: right-left symmetry.
- FIG. 5B illustrates a schema for an unbalanced query 520 , with missing portion 522 .
- FIG. 5C illustrates a schema for a query 540 that is ragged and short. With respect to its ragged aspect, query 540 has portions of intermediate levels removed, 544 A and 544 B. Query 540 is short because the desired data does not include the terminal nodes at the bottom of the hierarchy, 546 .
- a ragged or short query lacks translational symmetry.
- FIG. 5D illustrates a schema for query 560 that has multiple defects with missing portions 564 and 566 .
- FIG. 6 illustrates a collection of members in a geographic hierarchy 600 .
- the objects in the collection correspond to:
- the rationalized query replaces clusters of parents and children with a generator to the same.
- the parents and children in clusters 602 A, 602 B, and 602 C are replaced with generators “HUNTSVILE.CHILDREN”, “IRVINE.CHILDREN”, and “SANTA_ANA.CHILDREN”.
- Except logic is applied to replace the customers in clusters 604 A with “EXCEPT(AL.CHILDREN, ⁇ HUNTSVILE ⁇ )”.
- Only “CUSTOMER 35663” remains in the simple query. The remaining elements of the simple query can be with the rationalized query for the purposes of making a query to a data source. Otherwise, another call to the recursive process is made.
- the relative size of the rationalized query decreases. In other words, the savings in query length increases.
- a query that was 139 characters in length is now 92.
- simple queries of about 2 megabytes and 4.6 kilobytes were reduced to rationalized queries of about 5 kilobytes and 0.6 kilobytes, respectively.
- Some multidimensional programs limit the size of queries, e.g., a 64 kilobyte limit.
- Some multidimensional programs have large identifiers for objects, which automatically leads to large queries. In some cases, the shorter multidimensional query increases the performance of queries to the multidimensional data source.
- Examples of computer code include machine code, such as produced by a compiler, and files containing higher-level code that are executed by a computer using an interpreter.
- machine code such as produced by a compiler
- files containing higher-level code that are executed by a computer using an interpreter.
- an embodiment of the invention may be implemented using Java, C++, or other object-oriented programming language and development tools.
- Another embodiment of the invention may be implemented in hardwired circuitry in place of, or in combination with, machine-executable software instructions.
Abstract
Description
- This invention relates generally to querying data within data sources. More particularly, this invention relates an improved method and apparatus to retrieve data from a multi-dimensional data source.
- Business Intelligence (BI) generally refers to software tools used to improve business enterprise decision-making. These tools are commonly applied to financial, human resource, marketing, sales, customer and supplier analyses. More specifically, these tools can include: reporting and analysis tools to present information, content delivery infrastructure systems for delivery and management of reports and analytics, data warehousing systems for cleansing and consolidating information from disparate sources, and data management systems to collect, store, and manage raw data.
- OLAP tools are a subset of business intelligence tools. There are a number of commercially available OLAP tools including Business Objects OLAP Intelligence™ which is available from Business Objects Americas of San Jose, Calif. OLAP tools are a report generation tool, and a tool suited to ad hoc analyses. OLAP generally refers to a technique of providing fast analysis of shared multi-dimensional information stored in a database. OLAP systems provide a multi-dimensional conceptual view of data, including full support for hierarchies and multiple hierarchies. This framework is used because it is a logical way to analyze businesses and organizations. In some OLAP tools the data is arranged in a schema which simulates a multidimensional schema. The multi-dimensional schema means redundant information is stored, but it allows for users to initiate queries without the need to know how the data is organized.
- The querying process for OLAP can involve, depending on the specific implementation, writing and executing a query. Multidimensional Expressions (MDX) is a query language for OLAP databases, like SQL is a query language for relational databases. Thus, an MDX statement can be used to query for a result from an OLAP data source, i.e., a cube. The MDX statement can resemble SQL statements where one can ask for data on a row and columns from a cube. As with an SQL query, each MDX query requires a data request (the “SELECT” clause), a starting point (the “FROM” clause), and a filter (the “WHERE” clause). These and other keywords provide the tools used to extract specific portions of data from a cube for analysis, e.g., to extract a slice.
- An MDX query specifies the appropriate columns and rows within the SELECT clause (the “ON COLUMNS” and “ON ROWS” clauses). For example, the MDX query can have the following format:
-
SELECT Axis Dimensions Members ON COLUMNS, Axis Dimensions Members ON ROWS FROM Cube WHERE Sliced Dimensions Members
The “Axis Dimensions Members” specify which columns and rows to select. The “Sliced Dimensions Members” specify which slice of the cube to select. - Due to the nature of OLAP data sources, there is a lot of redundant data and a lot of columns and rows are selected in queries of even moderate complexity. In addition, users typically include many members in their queries. These factors lead to some MDX queries that are too long to be successfully executed by an OLAP server. Part of a multidimensional application, or an interface to a multidimensional data source, that communicates with the multidimensional data source maintains a sets of members that will be queried. This set is enumerable. When data associated with the list of members is needed a multidimensional query, such as an MDX statement, is constructed. Previously this query included an enumeration over a list. For example, a fragment of the MDX query could be:
- SELECT {member1, member2, . . . member45312, . . . } ON COLUMNS
- For a large list of members, the multidimensional query could be a very large statement. With some multidimensional data sources there can be a hard limit on the size of queries.
- Therefore, it would be desirable to provide a new technique for reducing the size of queries to multidimensional data sources.
- The invention includes a computer readable medium storing computer executable instructions to receive a multidimensional data source query. A recursive process is invoked to replace an element of the multidimensional data source query with a generator to create a rationalized query.
- The invention also includes a computer implemented method that converts a plurality of objects, each object including metadata associated with a piece of data in a multidimensional data source, into a query to the multidimensional data source. The query is rationalized to create a rationalized query.
- The invention also includes a computer readable medium that stores executable instructions to receive a Multidimensional Expressions (MDX) query. The MDX query is recursively rationalized to form a rationalized query. The rationalized query is applied to a multidimensional data source to produce query results. The query results are returned.
- The invention is more fully appreciated in connection with the following detailed description taken in conjunction with the accompanying drawings, in which:
-
FIG. 1 illustrates a computer constructed in accordance with an embodiment of the invention. -
FIG. 2 illustrates processing operations associated with an embodiment of the invention. -
FIG. 3 illustrates processing operations associated with an embodiment of the invention. -
FIG. 4 illustrates processing operations implementing an operation fromFIG. 3 . -
FIGS. 5A , 5B, 5C, and 5D illustrate a series of schema for a plurality of hierarchies. -
FIG. 6 illustrates an example of a collection of objects. - Like reference numerals refer to corresponding parts throughout the several views of the drawings.
- Various features associated with the operation of the present invention will now be set forth. Prior to such description, a glossary of terms used throughout this description is provided.
- A descendent tree is a tree of members with a root member and two or more descendent members over two or more levels.
- Except logic assumes it is more succinct to define a generator for what is to be excluded from a query rather than define what is to be included. Expect logic leads to the use of a generator for expect logic.
- Family is a tree of members with a parent member and one or more children members. A two level case of a descendent tree.
- Generator is an expression in a multidimensional query language that can generate a query for one or more members of a data source without explicit specification of the one or more members. Thus, a generator is a generalized expression of specific data source elements. The generators can be for a hierarchy, a level, a family, a descendent tree, or for except logic. For MDX the generator include the following: “Hierarchy.Members” as a generator to a hierarchy, “Level.Members” as a generator to a level, “Member.Children” as a generator to a family, and “Descendants(Member, Level, Self)” as a generator to a decent tree. For MDX the Except logic generator is “Except(x, y)”, where x, y are lists of members, or generators to families, or descendent trees. Here x is the generator to members to be included, and y is the generator to members to be excluded.
- Hierarchy is a set of hierarchically related data in a multidimensional data source, e.g., a cube.
- Level is a level in a hierarchy. Usually a level is a set of members in the hierarchy at an equal depth from a root member of the hierarchy.
- Member is an element of data in a dimension hierarchy.
- Multidimensional Expressions (MDX) is a query language for multidimensional data sources, such as an OLAP database. The query language is an analogue to the structured query language (SQL) query language for relational databases.
- Rationalization is the process of simplifying a query, for example, by replacing one or more members in a query with one or more generators. Rationalization reduces the size of the query.
-
FIG. 1 illustrates acomputer 100 configured in accordance with an embodiment of the invention. Thecomputer 100 includes standard components, including acentral processing unit 102 and input/output devices 104, which are linked by abus 106. The input/output devices 104 may include a keyboard, mouse, touch screen, monitor, printer, and the like. Anetwork interface circuit 108 is also connected to thebus 106. Thenetwork interface circuit 108 provides connectivity to a network (not shown), thereby allowing thecomputer 100 to operate in a networked environment. - A
memory 110 is also connected to thebus 106. In an embodiment thememory 110 stores one or more of the following modules: anoperating system module 112, anOLAP module 116, anMDX module 118, and aRationalization module 120. - The
operating system module 112 may include instructions for handling various system services, such as file services or for performing hardware dependant tasks. TheOLAP module 116 includes executable instructions for interfacing with an OLAP data source, such as, an OLAP cube (not shown). TheOLAP module 116 can include executable instructions to allowcomputer 100 to access any OLAP data source, such as, an application program interface, to a specific types, version, or format of a data source. TheMDX module 118 includes executable instructions to create an MDX query to an OLAP data source. - The
rationalization module 120 includes executable instructions to rationalize an MDX query. The executable instructions try to find patterns in the query and replace the pattern with an appropriate pattern generator. In an embodiment, therationalization module 120 compresses the expression for the axis dimensions members for the ON COLUMNS/ROWS clauses. - The executable modules stored in
memory 110 are exemplary. Additional modules, such as a graphical user interface module, can be added. It should be appreciated that the functions of the modules maybe combined. In addition, the functions of the modules need not be performed on a single machine. Instead, the functions may be distributed across a network, if desired. Indeed, the invention is commonly implemented in a client-server environment with various components being implemented at the client-side and/or the server-side. It is the functions of the invention that are significant, not where they are performed or the specific manner in which they are performed. -
FIG. 2 illustrates processingoperations 200 that a user may execute oncomputer 100. In the first processing operation ofFIG. 2 , the user obtains some metadata data about a collection of objects, 202. The metadata includes sufficient information to query the multidimensional data source for the data. - In
processing operation 204 the user queries a data source for the data corresponding to the collection of objects. In this processing operation the query uses the metadata for the collection of objects. Inprocessing operation 206 the user obtains the data. -
FIG. 3 illustrates a series ofprocessing operations 300 which may be used to service the requests made ofcomputer 100 in the processing operations ofFIG. 2 . In the first processing operation ofFIG. 3 , metadata data for a collection of objects is received 302 (e.g., at computer 100). - In
processing operation 304,computer 100 creates a simple MDX query. In an embodiment, the simple MDX query includes a list of objects from the collection of objects. The size of the query is proportional to the number of objects in the collection. - In
processing operation 306, the simple MDX query is preprocessed for rationalization. A preprocessing operation includes merging or splitting MDX queries. Inprocessing operation 308 the simple MDX query is rationalized. In an embodiment of the invention rationalization includes one or more invocations of a recursive rationalization process. - In
processing operation 310 thecomputer 100 uses the rationalized query to query the data source. The query is serviced in accordance with standard methods used with multidimensional data sources. - The results of the query can be ordered. In an embodiment, the ordering is performed by a multidimensional server, i.e., not
computer 100. In an embodiment, the ordering of the results of the query involves placing the results in order of a depth-first search of the hierarchy from with the result came. A depth-first search is a method for traversing a tree by starting at the root and exploring as far as possible along each branch before backtracking. Other orderings to make the results logical to the user are also possible. These include breadth-first, alphabetical, and the like. In an embodiment, the MDX command hierarchy can be sent to the multidimensional server along with the rationalized query. The results of the query are then received 312. -
FIG. 4 illustrates a series ofprocessing operations 400 used to rationalize a multi-dimension query. In the first processing operation ofFIG. 4 , a null query is created as the rationalized query, 402. This null query will be augmented in subsequent processing operations. - Next a comparison is made between the collection of objects and the hierarchy of the
data source 404. If the collection of objects overlaps with the hierarchy, 404—Yes, the collection of objects can be represented by a generator that specifies the hierarchy. For example, if the collection is all customers in North America, and the hierarchy is the customers by city, state/province, and country, the generator for the query could be “NorthAmericaCustomers.Members”. That is specifying a hierarchy for the North American customers and all members. This generator is combined with the rationalizedquery 406. - Typically, the collection of objects and the hierarchy do not overlap, 404—No. In which case, a comparison is made between the collection of objects and the various levels of the hierarchy, 408. If part of the collection of objects is an entire level in a hierarchy, then that part of the collection can be concisely expressed. In an embodiment, the
computer 100 compares the objects in the collection to the data at each level in the hierarchy. Once a generator is formed for the objects that span an entire level, the objects are removed from the simple query and the generator is combined with the rationalized query. - If no more objects are to be processed (410—Yes), the rationalization is complete and processing proceeds to
operation 416. If processing is not completed (410—No), a first call is made to a recursive process that rationalizes the query, 412. The parameters passed to the rationalization process are the simple query, the rationalized query as it its, an iteration index, and other parameters. The process is recursive and if after one call the rationalization is not complete the recursive process invokes another instance of itself with updated parameters. This shown inFIG. 4 asblock 414. A recursive call is 414—No, and the end of the recursive calls is 414—Yes. In an embodiment, the recursive call is predicated on whether further rationalization can be expected to yield results. In another embodiment, the invocation is subject to other constraints, e.g., elapsed time of processingoperations 400. - The following code segment is pseudo code that invokes the non-recursive processing operations from
FIG. 4 , and describes code similar to code included in therationalization module 120 fromFIG. 1 . -
Rationalize Query AA . . . AB Rationalized Query = “ ” AC if( Number of Member(Simple Query) = = Number of Member(Hierarchy) ) AD Rationalized Query = “Heirachy.members( )” AE Simple Query = Simple Query − members(Heirachy) AF Exit Rationalization AG else foreach Level in Hierarchy; incrementing by level from first to last level AH Intersecting Set = intersection(Hierarchy, Simple Query) AI if(Number of Member(Intersecting Set) = = Number of Members(Level)) AJ Rationalized Query = Rationalized Query + “Heirachy.level(Level)” AK Simple Query = Simple Query − members at level(Level) AL if( Number of Member(Simple Query) = = 0 ) AM Exit Rationalization AN end-if AO end-if AP end-foreach AQ else call Recursive Rationalization Process (Simple Query, Rationalized Query, Iteration Index = 0, . . . ) AR Exit Rationalization - In this segment, the pseudo code at lines AB-AE is an implementation guide to processing
operations processing operations - The following code segment is pseudo code that invokes the recursive processing operations from
FIG. 4 , and describes code similar to code included in therationalization module 120 fromFIG. 1 . -
Recursive Rationalization Process (Members, RationalizedQuery, IterationIndex, . . . ) BA threshold = 0.5 BB MembersToAddNow = MembersToAddLater = Null; BC create map Map(object:(integer, one or more objects) BD foreach Object in the Members BE if(parent(Object) = Null) BF MembersToAddNow += Object BG end-if BH if( ! parent(object) in map) BI Map[parent(Object)].mapPart(1) = numberOfChildren(parent(Object)) BJ Map[parent(Object)].mapPart(2) = Children(parent(Object)) BK else BL Map[parent(Object)].mapPart(2) += Object BM end-if BN end-foreach BO foreach Key in the Map BP if( number(Map[Key].mapPart(2)) = = Map[Key].mapPart(1) ) BQ MembersToAddLater += Key BR elseif (Map[Key].mapPart(1) − number(Map[Key].mapPart(2)) < Map[Key].mapPart(1) * threshold) BS ExceptList = children(Key) − Map[Key].mapPart(2) BT if( IterationIndex = = 0) BU RationalizedQuery += “Except(Key, ExceptList)” BV elseif( IterationIndex = = 1) BW Decendents = Null BX foreach Object in ExceptList BY Decendents += (nameOfObject(Object + “.children()”) BZ end foreach BAA RationalizedQuery += “Except(Key, Decendents)” BAB else BAC Decendents = Null BAD foreach object in ExceptList BAE Decendents += “descendents(nameOfObject(Object), BAF level(depth(key) + IterationIndex + 1), self)” BAG end foreach BAH RationalizedQuery += “Except(Key, Decendents)” BAI end-if BAJ else BAK MembersToAddNow += Map[Key].mapPart(2); BAL end-foreach BAM updateRationalizedQueryNow(MembersToAddNow, RationalizedQuery, IterationIndex) BAN if(MembersToAddLater != Null) BAO Recursive Rationalization Process (MembersToAddLater, RationalizedQuery, IterationIndex + 1, . . . ) BAP end-if - In this segment, the pseudo code at lines BA and BB set a threshold and two lists are created. The first list, “MembersToAddNow”, includes members to be added at the end of this instance of the recursive process. The second list, “MembersToAddLater”, includes members to be added in a later instance of the recursive process. In lines BC-BI a map from parent objects to child objects in the “Members”, and the number of children it has in the hierarchy, is created and populated. In populating the map, the root member is automatically added, see lines BE-BG. Also in populating the map, each parent not in the map is mapped to its maximum number of children. See, “mapPart(1)” on line BI. Then the parents are mapped to children in the simple query. See, “mapPart(2)” on line BI. Members that are children of previously added members are added to the map at line BL
- In lines BO-BAL each object in the map is visited by iterating over the key to the map, “Key”. If for the Key, which is a parent, the number of its children equals the maximum number of children for the parent, then this represents a complete family for which a generator can be created. See lines BP and BQ. The key is added to the members to be added later list since itself may be part of a greater pattern identified in a later instance of the recursive process.
- Otherwise, at line BR, if less than all the children present in the family, but more than an amount determined by the “threshold” value are present except logic is employed. First, the list of members to exclude is created, line BS. Line BU is executed if the iteration index is 0, meaning the process is examining leaf members and a member one level up in a tree. The members to be excluded are appended to the rationalized query with the appropriate generator for except logic. Lines BW-BAA are executed if the iteration index is 1. A list of descendents to exclude is created and appended to the rationalized query. Lines BAC-BAH are executed if the iteration index is 2 or more. A list of descendents to exclude on a particular level is created. The level name is supplied by function “level”. The list, with the appropriate except generator, is appended to the rationalized query.
- Otherwise, at line BAK, the members that are children of the parent Key are sparse and they are added to the “to be added now” list. The for-loop over the map ends at line BAL. At line BAM, the rationalized query is updated from the “MembersToAddNow” list. This is described below. Finally if the “MembersToAddLater” is not null, another instance of the recursive rationalization process is invoked. Unlike the first invocation the “MembersToAddLater” replace “SimpleQuery” as the members variable. The iteration index is incremented.
- The following code segment is pseudo code that defines the updateRationalizedQueryNow function invoked above.
-
updateRationalizedQueryNow( MembersToAddNow, RationalizedQuery, IterationIndex) CA if( IterationIndex = = 0) CB foreach Object in MembersToAddNow CC RationalizedQuery += “nameOfObject(Object”) CD end-foreach CE elseif( IterationIndex = = 1) CF foreach Object in MembersToAddNow CG RationalizedQuery += “nameOfObject(Object) + .children”) CH end-foreach CI else CJ foreach member in MembersToAddNow CK RationalizedQuery += “decendents(nameOfObject(Object), level(IterationIndex + depth(Object)), self)” CL end-foreach CM end-if - In this segment, the pseudo code at lines CA-CD updates the rationalized query from the “MembersToAddNow” list for
iteration 0. The same is done foriterations - Embodiments of the present invention can rationalize queries that have multiple defects. A defect causes the query to be unsymmetrical.
FIG. 5A illustrates a schema for abalanced query 500 to a hierarchy. A balanced query exhibits one form of symmetry: right-left symmetry.FIG. 5B illustrates a schema for anunbalanced query 520, with missingportion 522.FIG. 5C illustrates a schema for aquery 540 that is ragged and short. With respect to its ragged aspect,query 540 has portions of intermediate levels removed, 544A and 544B.Query 540 is short because the desired data does not include the terminal nodes at the bottom of the hierarchy, 546. A ragged or short query lacks translational symmetry.FIG. 5D illustrates a schema forquery 560 that has multiple defects with missingportions -
FIG. 6 illustrates a collection of members in ageographic hierarchy 600. The objects in the collection correspond to: -
CUSTOMER 36578, CUSTOMER 15487, CUS- 58697, TOMER CUSTOMER 65454, CUSTOMER 45656, CUS- 98662, TOMER CUSTOMER 65656, CUSTOMER 54565, CUS- 21545, TOMER CUSTOMER 35663 - After a first invocation of the recursive rationalization process, the rationalized query replaces clusters of parents and children with a generator to the same. The parents and children in
clusters clusters 604A with “EXCEPT(AL.CHILDREN, {HUNTSVILE})”. Only “CUSTOMER 35663” remains in the simple query. The remaining elements of the simple query can be with the rationalized query for the purposes of making a query to a data source. Otherwise, another call to the recursive process is made. - After a second invocation the rationalized query is reduced to:
- HUNTSVILE.CHILDREN, EXCEPT(AL.CHILDREN, {HUNTSVILE}), DESCENDANTS(CA,
LEVEL 5, SELF), CUSTOMER 35663 - In accordance with an aspect of the invention, as the size of the simply query grows the relative size of the rationalized query decreases. In other words, the savings in query length increases. In the above example, a query that was 139 characters in length is now 92. In other examples employing embodiments of the invention, simple queries of about 2 megabytes and 4.6 kilobytes were reduced to rationalized queries of about 5 kilobytes and 0.6 kilobytes, respectively. Some multidimensional programs limit the size of queries, e.g., a 64 kilobyte limit. Some multidimensional programs have large identifiers for objects, which automatically leads to large queries. In some cases, the shorter multidimensional query increases the performance of queries to the multidimensional data source.
- An embodiment of the present invention relates to a computer storage product with a computer-readable medium having computer code thereon for performing various computer-implemented operations. The media and computer code may be those specially designed and constructed for the purposes of the present invention, or they may be of the kind well known and available to those having skill in the computer software arts. Examples of computer-readable media include, but are not limited to: magnetic media such as hard disks, floppy disks, and magnetic tape; optical media such as CD-ROMs, DVDs and holographic devices; magneto-optical media; and hardware devices that are specially configured to store and execute program code, such as application-specific integrated circuits (“ASICs”), programmable logic devices (“PLDs”) and ROM and RAM devices. Examples of computer code include machine code, such as produced by a compiler, and files containing higher-level code that are executed by a computer using an interpreter. For example, an embodiment of the invention may be implemented using Java, C++, or other object-oriented programming language and development tools. Another embodiment of the invention may be implemented in hardwired circuitry in place of, or in combination with, machine-executable software instructions.
- The foregoing description, for purposes of explanation, used specific nomenclature to provide a thorough understanding of the invention. However, it will be apparent to one skilled in the art that specific details are not required in order to practice the invention. Thus, the foregoing descriptions of specific embodiments of the invention are presented for purposes of illustration and description. They are not intended to be exhaustive or to limit the invention to the precise forms disclosed; obviously, many modifications and variations are possible in view of the above teachings. The embodiments were chosen and described in order to best explain the principles of the invention and its practical applications, they thereby enable others skilled in the art to best utilize the invention and various embodiments with various modifications as are suited to the particular use contemplated. It is intended that the following claims and their equivalents define the scope of the invention.
Claims (20)
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US11/435,554 US7698257B2 (en) | 2006-05-16 | 2006-05-16 | Apparatus and method for recursively rationalizing data source queries |
PCT/US2007/067332 WO2007136959A2 (en) | 2006-05-16 | 2007-04-24 | Apparatus and method for recursively rationalizing data source queries |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US11/435,554 US7698257B2 (en) | 2006-05-16 | 2006-05-16 | Apparatus and method for recursively rationalizing data source queries |
Publications (2)
Publication Number | Publication Date |
---|---|
US20070271227A1 true US20070271227A1 (en) | 2007-11-22 |
US7698257B2 US7698257B2 (en) | 2010-04-13 |
Family
ID=38713144
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/435,554 Active 2026-10-23 US7698257B2 (en) | 2006-05-16 | 2006-05-16 | Apparatus and method for recursively rationalizing data source queries |
Country Status (2)
Country | Link |
---|---|
US (1) | US7698257B2 (en) |
WO (1) | WO2007136959A2 (en) |
Cited By (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20080140623A1 (en) * | 2006-12-11 | 2008-06-12 | Microsoft Corporation | Recursive reporting via a spreadsheet |
US20090300048A1 (en) * | 2008-06-03 | 2009-12-03 | Microsoft Corporation | Selecting member sets for generating asymmetric queries |
US20110131173A1 (en) * | 2009-12-01 | 2011-06-02 | Internation Business Machines Corporation | Compensating for unbalanced hierarchies when generating olap queries from report specifications |
US8204901B2 (en) | 2009-09-02 | 2012-06-19 | International Business Machines Corporation | Generating query predicates for processing multidimensional data |
US20150006470A1 (en) * | 2013-06-28 | 2015-01-01 | Mayur Belur Mohan | Metric catalog system |
WO2015027831A1 (en) * | 2013-08-26 | 2015-03-05 | Tencent Technology (Shenzhen) Company Limited | Multidimensional data processing method and device |
US20210149920A1 (en) * | 2019-11-19 | 2021-05-20 | International Business Machines Corporation | Generating an olap model from a spreadsheet |
US11593408B2 (en) | 2019-11-19 | 2023-02-28 | International Business Machines Corporation | Identifying data relationships from a spreadsheet |
US11645285B2 (en) * | 2018-04-27 | 2023-05-09 | Aras Corporation | Query engine for recursive searches in a self-describing data system |
US11720596B2 (en) | 2019-11-19 | 2023-08-08 | International Business Machines Corporation | Identifying content and structure of OLAP dimensions from a spreadsheet |
Families Citing this family (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7337167B2 (en) * | 2005-04-14 | 2008-02-26 | International Business Machines Corporation | Estimating a number of rows returned by a recursive query |
US8473496B2 (en) * | 2008-01-31 | 2013-06-25 | SAP France S.A. | Utilizing density metadata to process multi-dimensional data |
CN102640173A (en) * | 2008-10-31 | 2012-08-15 | 迪蒙特公司 | Method and apparatus for configurable model-independent decomposition of a business metric |
US20100114658A1 (en) * | 2008-10-31 | 2010-05-06 | M-Factor, Inc. | Method and apparatus for creating a consistent hierarchy of decomposition of a business metric |
Citations (25)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6134541A (en) * | 1997-10-31 | 2000-10-17 | International Business Machines Corporation | Searching multidimensional indexes using associated clustering and dimension reduction information |
US6161105A (en) * | 1994-11-21 | 2000-12-12 | Oracle Corporation | Method and apparatus for multidimensional database using binary hyperspatial code |
US6405208B1 (en) * | 1999-12-13 | 2002-06-11 | Hyperion Solutions Corporation | Dynamic recursive build for multidimensional databases and methods and apparatus thereof |
US20020178394A1 (en) * | 2000-11-06 | 2002-11-28 | Naama Bamberger | System for processing at least partially structured data |
US20030030672A1 (en) * | 2001-05-16 | 2003-02-13 | William Hughes | Objects and methods for accessing a data source and enhancing an application |
US20030101170A1 (en) * | 2001-05-25 | 2003-05-29 | Joseph Edelstein | Data query and location through a central ontology model |
US20030115194A1 (en) * | 2001-08-01 | 2003-06-19 | Pitts Theodore H. | Method and apparatus for processing a query to a multi-dimensional data structure |
US20030225752A1 (en) * | 1999-08-04 | 2003-12-04 | Reuven Bakalash | Central data warehouse with integrated data aggregation engine for performing centralized data aggregation operations |
US20040030685A1 (en) * | 2000-12-14 | 2004-02-12 | Morten Helles | Query processor, query processor elements and a method of establishing such a query processor and query processor elements and a domain processor |
US20040039736A1 (en) * | 2001-03-01 | 2004-02-26 | Lawson Software, Inc. | OLAP query generation engine |
US20040049505A1 (en) * | 2002-09-11 | 2004-03-11 | Kelly Pennock | Textual on-line analytical processing method and system |
US20040068488A1 (en) * | 2002-10-03 | 2004-04-08 | International Business Machines Corporation | Data query differential analysis |
US20040111421A1 (en) * | 2002-12-10 | 2004-06-10 | Cohen Norman H. | Data source synthesis |
US20050010565A1 (en) * | 2003-05-27 | 2005-01-13 | David Cushing | System and method of transforming queries based upon E/R schema into multi-dimensional expression queries |
US20050154714A1 (en) * | 2004-01-13 | 2005-07-14 | Oracle International Corporation | Query duration types |
US20060010114A1 (en) * | 2004-07-09 | 2006-01-12 | Marius Dumitru | Multidimensional database subcubes |
US7133865B1 (en) * | 1999-07-21 | 2006-11-07 | Torben Bach Pedersen | Method and systems for making OLAP hierarchies summarisable |
US20060259509A1 (en) * | 2003-06-02 | 2006-11-16 | Chris Stolte | Computer systems and methods for the query and visualization of multidimensional database |
US20060294087A1 (en) * | 2005-06-23 | 2006-12-28 | Vladimir Mordvinov | System and method for processing and decomposition of a multidimensional query against a relational data source |
US20070038596A1 (en) * | 2005-08-15 | 2007-02-15 | Microsoft Corporation | Restricting access to data based on data source rewriting |
US20070061305A1 (en) * | 2005-09-13 | 2007-03-15 | Soufiane Azizi | System and method of providing date, arithmetic and other relational functions for OLAP sources |
US20070118516A1 (en) * | 2005-11-18 | 2007-05-24 | Microsoft Corporation | Using multi-dimensional expression (MDX) and relational methods for allocation |
US20070208721A1 (en) * | 2003-12-01 | 2007-09-06 | Zaman Kazi A | Modeling multidimensional data sources |
US20070226203A1 (en) * | 2006-03-23 | 2007-09-27 | Microsoft Corporation | Generation of query and update views for object relational mapping |
US7333982B2 (en) * | 2000-02-28 | 2008-02-19 | Hyperroll Israel, Ltd. | Information system having a mode of operation in which queries form one or more clients are serviced using aggregated data retrieved from a plurality of different types of data storage structures for improved query performance |
-
2006
- 2006-05-16 US US11/435,554 patent/US7698257B2/en active Active
-
2007
- 2007-04-24 WO PCT/US2007/067332 patent/WO2007136959A2/en active Application Filing
Patent Citations (29)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6161105A (en) * | 1994-11-21 | 2000-12-12 | Oracle Corporation | Method and apparatus for multidimensional database using binary hyperspatial code |
US6134541A (en) * | 1997-10-31 | 2000-10-17 | International Business Machines Corporation | Searching multidimensional indexes using associated clustering and dimension reduction information |
US7133865B1 (en) * | 1999-07-21 | 2006-11-07 | Torben Bach Pedersen | Method and systems for making OLAP hierarchies summarisable |
US7392248B2 (en) * | 1999-08-04 | 2008-06-24 | Hyperroll Israel, Ltd. | Data aggregation server supporting rapid query response with sparse multi-dimensional data |
US20030225752A1 (en) * | 1999-08-04 | 2003-12-04 | Reuven Bakalash | Central data warehouse with integrated data aggregation engine for performing centralized data aggregation operations |
US6405208B1 (en) * | 1999-12-13 | 2002-06-11 | Hyperion Solutions Corporation | Dynamic recursive build for multidimensional databases and methods and apparatus thereof |
US7333982B2 (en) * | 2000-02-28 | 2008-02-19 | Hyperroll Israel, Ltd. | Information system having a mode of operation in which queries form one or more clients are serviced using aggregated data retrieved from a plurality of different types of data storage structures for improved query performance |
US20020178394A1 (en) * | 2000-11-06 | 2002-11-28 | Naama Bamberger | System for processing at least partially structured data |
US7233940B2 (en) * | 2000-11-06 | 2007-06-19 | Answers Corporation | System for processing at least partially structured data |
US20040030685A1 (en) * | 2000-12-14 | 2004-02-12 | Morten Helles | Query processor, query processor elements and a method of establishing such a query processor and query processor elements and a domain processor |
US20040039736A1 (en) * | 2001-03-01 | 2004-02-26 | Lawson Software, Inc. | OLAP query generation engine |
US7363287B2 (en) * | 2001-03-01 | 2008-04-22 | Lawson Software, Inc. | OLAP query generation engine |
US20030030672A1 (en) * | 2001-05-16 | 2003-02-13 | William Hughes | Objects and methods for accessing a data source and enhancing an application |
US20030101170A1 (en) * | 2001-05-25 | 2003-05-29 | Joseph Edelstein | Data query and location through a central ontology model |
US20030115194A1 (en) * | 2001-08-01 | 2003-06-19 | Pitts Theodore H. | Method and apparatus for processing a query to a multi-dimensional data structure |
US20040049505A1 (en) * | 2002-09-11 | 2004-03-11 | Kelly Pennock | Textual on-line analytical processing method and system |
US20040068488A1 (en) * | 2002-10-03 | 2004-04-08 | International Business Machines Corporation | Data query differential analysis |
US20040111421A1 (en) * | 2002-12-10 | 2004-06-10 | Cohen Norman H. | Data source synthesis |
US20050010566A1 (en) * | 2003-05-27 | 2005-01-13 | David Cushing | System and method of multidimensional query results processing |
US20050010565A1 (en) * | 2003-05-27 | 2005-01-13 | David Cushing | System and method of transforming queries based upon E/R schema into multi-dimensional expression queries |
US20060259509A1 (en) * | 2003-06-02 | 2006-11-16 | Chris Stolte | Computer systems and methods for the query and visualization of multidimensional database |
US20070208721A1 (en) * | 2003-12-01 | 2007-09-06 | Zaman Kazi A | Modeling multidimensional data sources |
US20050154714A1 (en) * | 2004-01-13 | 2005-07-14 | Oracle International Corporation | Query duration types |
US20060010114A1 (en) * | 2004-07-09 | 2006-01-12 | Marius Dumitru | Multidimensional database subcubes |
US20060294087A1 (en) * | 2005-06-23 | 2006-12-28 | Vladimir Mordvinov | System and method for processing and decomposition of a multidimensional query against a relational data source |
US20070038596A1 (en) * | 2005-08-15 | 2007-02-15 | Microsoft Corporation | Restricting access to data based on data source rewriting |
US20070061305A1 (en) * | 2005-09-13 | 2007-03-15 | Soufiane Azizi | System and method of providing date, arithmetic and other relational functions for OLAP sources |
US20070118516A1 (en) * | 2005-11-18 | 2007-05-24 | Microsoft Corporation | Using multi-dimensional expression (MDX) and relational methods for allocation |
US20070226203A1 (en) * | 2006-03-23 | 2007-09-27 | Microsoft Corporation | Generation of query and update views for object relational mapping |
Cited By (15)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20080140623A1 (en) * | 2006-12-11 | 2008-06-12 | Microsoft Corporation | Recursive reporting via a spreadsheet |
US20090300048A1 (en) * | 2008-06-03 | 2009-12-03 | Microsoft Corporation | Selecting member sets for generating asymmetric queries |
US8103687B2 (en) | 2008-06-03 | 2012-01-24 | Microsoft Corporation | Selecting member sets for generating asymmetric queries |
US8204901B2 (en) | 2009-09-02 | 2012-06-19 | International Business Machines Corporation | Generating query predicates for processing multidimensional data |
US9189535B2 (en) | 2009-12-01 | 2015-11-17 | International Business Machines Corporation | Compensating for unbalanced hierarchies when generating OLAP queries from report specifications |
US20110131173A1 (en) * | 2009-12-01 | 2011-06-02 | Internation Business Machines Corporation | Compensating for unbalanced hierarchies when generating olap queries from report specifications |
US8484157B2 (en) | 2009-12-01 | 2013-07-09 | International Business Machines Corporation | Compensating for unbalanced hierarchies when generating OLAP queries from report specifications |
US20150006470A1 (en) * | 2013-06-28 | 2015-01-01 | Mayur Belur Mohan | Metric catalog system |
US9535970B2 (en) * | 2013-06-28 | 2017-01-03 | Sap Se | Metric catalog system |
WO2015027831A1 (en) * | 2013-08-26 | 2015-03-05 | Tencent Technology (Shenzhen) Company Limited | Multidimensional data processing method and device |
US11645285B2 (en) * | 2018-04-27 | 2023-05-09 | Aras Corporation | Query engine for recursive searches in a self-describing data system |
US20210149920A1 (en) * | 2019-11-19 | 2021-05-20 | International Business Machines Corporation | Generating an olap model from a spreadsheet |
US11593408B2 (en) | 2019-11-19 | 2023-02-28 | International Business Machines Corporation | Identifying data relationships from a spreadsheet |
US11720597B2 (en) * | 2019-11-19 | 2023-08-08 | International Business Machines Corporation | Generating an OLAP model from a spreadsheet |
US11720596B2 (en) | 2019-11-19 | 2023-08-08 | International Business Machines Corporation | Identifying content and structure of OLAP dimensions from a spreadsheet |
Also Published As
Publication number | Publication date |
---|---|
WO2007136959A2 (en) | 2007-11-29 |
WO2007136959A3 (en) | 2008-08-28 |
US7698257B2 (en) | 2010-04-13 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7698257B2 (en) | Apparatus and method for recursively rationalizing data source queries | |
CN108038222B (en) | System of entity-attribute framework for information system modeling and data access | |
US10210236B2 (en) | Storing and retrieving data of a data cube | |
US7219102B2 (en) | Method, computer program product, and system converting relational data into hierarchical data structure based upon tagging trees | |
US7171427B2 (en) | Methods of navigating a cube that is implemented as a relational object | |
US8005818B2 (en) | Apparatus and method for maintaining metadata version awareness during set evaluation for OLAP hierarchies | |
US9171100B2 (en) | MTree an XPath multi-axis structure threaded index | |
CA2388515C (en) | System for managing rdbm fragmentations | |
US20050010550A1 (en) | System and method of modelling of a multi-dimensional data source in an entity-relationship model | |
US20140201244A1 (en) | Method for representing and storing hierarchical data in a columnar format | |
US20040015486A1 (en) | System and method for storing and retrieving data | |
US20090024571A1 (en) | Supporting aggregate expressions in query rewrite | |
US20130304769A1 (en) | Document Merge Based on Knowledge of Document Schema | |
US20100235344A1 (en) | Mechanism for utilizing partitioning pruning techniques for xml indexes | |
US20070250517A1 (en) | Method and Apparatus for Autonomically Maintaining Latent Auxiliary Database Structures for Use in Executing Database Queries | |
US20060161525A1 (en) | Method and system for supporting structured aggregation operations on semi-structured data | |
US7213011B1 (en) | Efficient processing of multi-column and function-based in-list predicates | |
US20080294673A1 (en) | Data transfer and storage based on meta-data | |
US6456998B1 (en) | Efficient processing of parent-child relationships in a relational database management system | |
US20080313153A1 (en) | Apparatus and method for abstracting data processing logic in a report | |
US6862590B2 (en) | Converting expressions to execution plans | |
US10235100B2 (en) | Optimizing column based database table compression | |
US11327995B2 (en) | Complex data type encoding within columnar database | |
Pananjung et al. | Development of SQL Interface for Spatial Data Processing in XML Databases | |
CN116257578A (en) | Database conversion method, device, computer equipment and storage medium |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: BUSINESS OBJECTS, S.A., FRANCE Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:MOMEN-POUR, SOROUSH;COX, REUBEN MICHAEL ARTHUR;ARESKOUG, HENRIK;AND OTHERS;REEL/FRAME:018245/0411;SIGNING DATES FROM 20060515 TO 20060904 Owner name: BUSINESS OBJECTS, S.A.,FRANCE Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:MOMEN-POUR, SOROUSH;COX, REUBEN MICHAEL ARTHUR;ARESKOUG, HENRIK;AND OTHERS;SIGNING DATES FROM 20060515 TO 20060904;REEL/FRAME:018245/0411 |
|
AS | Assignment |
Owner name: BUSINESS OBJECTS SOFTWARE LTD., IRELAND Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:BUSINESS OBJECTS, S.A.;REEL/FRAME:020156/0411 Effective date: 20071031 Owner name: BUSINESS OBJECTS SOFTWARE LTD.,IRELAND Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:BUSINESS OBJECTS, S.A.;REEL/FRAME:020156/0411 Effective date: 20071031 |
|
FEPP | Fee payment procedure |
Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
FPAY | Fee payment |
Year of fee payment: 4 |
|
MAFP | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 8TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1552) Year of fee payment: 8 |
|
MAFP | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 12TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1553); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY Year of fee payment: 12 |