Efficient OLAP operations for spatial data using peano trees
Open Access
- 13 June 2003
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 28-34
Abstract
Online Analytical Processing (OLAP) is an important application of data warehouses. With more and more spatial data being collected, such as remotely sensed images, geographical information, digital sky survey data, efficient OLAP for spatial data is in great demand. In this paper, we build up a new data warehouse structure -- PD-cube, With PD-cube, OLAP operations and queries can be efficiently implemented. All these are accomplished based on the fast logical operations of Peano Trees (P-Trees*). One of the P-tree variations, Predicate P-tree, is used to efficiently reduce data accesses by filtering out "bit holes" consisting of consecutive 0's. Experiments show that OLAP operations can be executed much faster than with traditional OLAP methods.Keywords
This publication has 4 references indexed in Scilit:
- Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-TotalsData Mining and Knowledge Discovery, 1997
- An array-based algorithm for simultaneous multidimensional aggregates1997
- Multi-table joins through bitmapped join indicesACM SIGMOD Record, 1995
- Join indicesACM Transactions on Database Systems, 1987