Please use this identifier to cite or link to this item:

Efficient OLAP operations in spatial data warehouses

Authors Papadias, D. View this author's profile
Kalnis, P.
Zhang, J.
Tao, YF
Issue Date 2001
Source Lecture Notes in Computer Science , v. 2121, 2001, p. 443-459
Summary Spatial databases store information about the position of individual objects in space. In many applications however, such as traffic supervision or mobile communications, only summarized data, like the number of cars in an area or phones serviced by a cell, is required. Although this information can be obtained from transactional spatial databases, its computation is expensive, rendering online processing inapplicable. Driven by the non-spatial paradigm, spatial data warehouses can be constructed to accelerate spatial OLAP operations. In this paper we consider the star-schema and we focus on the spatial dimensions. Unlike the non-spatial case, the groupings and the hierarchies can be numerous and unknown at design time, therefore the well-known materialization techniques are not directly applicable. In order to address this problem, we construct an ad-hoc grouping hierarchy based on the spatial index at the finest spatial granularity. We incorporate this hierarchy in the lattice model and present efficient methods to process arbitrary aggregations. We finally extend our technique to moving objects by employing incremental update methods.
ISSN 0302-9743
ISBN 3-540-42301-X
Rights The original publication is available at Please use the appropriate URL and/or DOI for the article.
Language English
Format Article
Access View full-text via Web of Science
Files in this item:
File Description Size Format
effi.pdf 147105 B Adobe PDF