A Join-Like Operator to Combine Data Cubes and Answer Queries from Multiple Data Cubes
| Autor: | Francesco M. Malvestuto |
|---|---|
| Rok vydání: | 2014 |
| Předmět: | |
| Zdroj: | ACM Transactions on Database Systems. 39:1-31 |
| ISSN: | 1557-4644 0362-5915 |
| DOI: | 10.1145/2638545 |
| Popis: | In order to answer a “joint” query from multiple data cubes, Pourabass and Shoshani [2007] distinguish the data cube on the measure of interest (called the “primary” data cube) from the other data cubes (called “proxy” data cubes) that are used to involve the dimensions (in the query) not in the primary data cube. They demonstrate in study cases that, if the measures of the primary and proxy data cubes are correlated, then the answer to a joint query is an accurate estimate of its true value. Needless to say, for two or more proxy data cubes, the result depends upon the way the primary and proxy data cubes are combined together; however, for certain combination schemes Pourabass and Shoshani provide a sufficient condition , that they call proxy noncommonality , for the invariance of the result. In this article, we introduce: (1) a merge operator combining the contents of a primary data cube with the contents of a proxy data cube, (2) merge expressions for general combination schemes, and (3) an equivalence relation between merge expressions having the same pattern. Then, we prove that proxy noncommonality characterizes patterns for which every two merge expressions are equivalent. Moreover, we provide an efficient procedure for answering joint queries in the special case of perfect merge expressions. Finally, we show that our results apply to data cubes in which measures are obtained from unaggregated data using the aggregate functions SUM, COUNT, MAX, and MIN, and a lot more. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|