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
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.