Loading...
Please wait, while we are loading the content...
Abstract parallel multi-dimensional rolap indexing ∗.
| Content Provider | CiteSeerX |
|---|---|
| Author | Dehne, Frank |
| Abstract | This paper addresses the query performance issue for Relational OLAP (ROLAP) datacubes. We present a distributed multi-dimensional ROLAP indexingscheme which is practical to implement, requires only a small communication volume, and is fully adapted to distributed disks. Our solution is efficient for spatial searches in high dimensions and scalable in terms of data sizes, dimensions, and number of processors. Our method is also incrementally maintainable. Using “surrogate ” group-bys, it allows for the efficient processingof arbitrary OLAP queries on partial cubes, where not all of the group-bys have been materialized. Our experiments show that the ROLAP advantage of better scalability, in comparison to MOLAP, can be maintained while providing, at the same time, a fast and flexible index for OLAP queries. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Query Performance Issue Efficient Processingof Arbitrary Olap Query Surrogate Group-bys Rolap Advantage Abstract Parallel Multi-dimensional Rolap Indexing Olap Query Flexible Index High Dimension Data Size Small Communication Volume Relational Olap Distributed Multi-dimensional Rolap Indexingscheme Spatial Search Partial Cube |
| Content Type | Text |
| Resource Type | Article |
