Abstract
Recently there is an important interest on On-Line Analytical Processing (OLAP) technology. In this context, in order to facilitate complex analysis, data are usually modeled multidimensionally, where multiple hierarchies are associated with the dimensions. These Multidimensional (MD) data structures are called data cubes. In the existing OLAP products, the user interaction is limited to one operation at a time. Further, computing OLAP operations is very expensive since sequential scans are required. In this paper, we provide a simple data model for MD databases, and a simple algebraic MD query language that permit the modeling of the principal OLAP operations. The MD query language allows the user to directly specify the result. Therefore, optimization techniques can be applied globally to the MD query evaluation. We state declarative conditions for answering queries on cubes using exclusively one or more precomputed queries (derived cubes). Then, we provide instance independent expressions that compute an MD query on a cube front derived cubes. These results can be used to increase availability of data and to improve MD query performance.
Original language | English (US) |
---|---|
Pages | 109-122 |
Number of pages | 14 |
State | Published - 2000 |
Externally published | Yes |
Event | SSDBM 2000: 12th International Conference on Scientific and Statistical Database Management - Berlin, Ger Duration: Jul 26 2000 → Jul 28 2000 |
Other
Other | SSDBM 2000: 12th International Conference on Scientific and Statistical Database Management |
---|---|
City | Berlin, Ger |
Period | 7/26/00 → 7/28/00 |
All Science Journal Classification (ASJC) codes
- Software
- Applied Mathematics