Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brinkhoff, T., Kriegel, H.P., Seeger Efficient Processing of Spatial Joins Using R-trees. ACM SIGMOD, 1993.
Beckmann, N., Kriegel, H.P. Schneider, R., Seeger, B. The R*-tree: an Efficient and Robust Access Method for Points and Rectangles. ACM SIGMOD, 1990.
Baralis E., Paraboschi S., Teniente E. Materialized View Selection in a Multidimensional Database. VLDB, 1997.
Codd E., Codd S., Salley Providing OLAP (On-Line Analytical Processing) to User-Analysts: An IT Mandate. Technical Report, 1993, available at http://www.arborsoft.com/essbase/whLppr/coddps.zip
Gupta H. Selection of Views to Materialize in a Data Warehouse. ICDT, 1997.
Gray J., Bosworth A., Layman A., Pirahesh H. Data Cube: a Relational Aggregation Operator Generalizing Group-by, Cross-tabs and Subtotals. ICDE, 1996.
Gupta A., Mumick I. Maintenance of Materialized Views: Problems, Techniques,and Applications. Data Engineering Bulletin, June 1995.
Gupta H., Mumick I. Selection of Views to Materialize Under a Maintenance-Time Constraint. ICDT, 1999.
Gupta A., Mumick I., Subrahmanian V. Maintaining Views Incrementally. ACM SIGMOD, 1993.
Harinarayan V., Rajaraman A., Ullman J. Implementing Data Cubes Efficiently. ACM SIGMOD, 1996.
Han J., Stefanovic N., Koperski K. Selective Materialization: An Efficient Method for Spatial Data Cube Construction. PAKDD, 1998.
Jurgens M., Lenz HJ. The Ra *-tree: An improved R-tree with Materialized Data for Supporting Range Queries on OLAP-Data. DEXA Workshop, 1998.
Kimball R. The Data Warehouse Toolkit. John Wiley, 1996.
Lazaridis I., Mehrotra S. Progressive Approximate Aggregate Queries with a MultiResolution Tree Structure. ACM SIGMOD, 2001.
Lo, M-L., Ravishankar, C.V. Spatial Joins Using Seeded Trees. ACM SIGMOD, 1994.
Mamoulis, N, Papadias, D., Integration of Spatial Join Algorithms for Processing Multiple Inputs. ACM SIGMOD, 1999.
Mumick L, Quass D., Mumick B. Maintenance of Data Cubes and Summary Tables in a Warehouse. ACM SIGMOD, 1997.
Papadopoulos, A.N., Rigaux P., Scholl, M. A Performance Evaluation of Spatial Join Processing Strategies. SSD, 1999.
Rotem, D. Spatial Join Indices. IEEE ICDE, 1991.
Shukla A., Deshpande P., Naughton J. Materialized View Selection for Multidimensional Datasets, VLDB, 1998.
Stefanovic N., Han J., Koperski K. Object-Based Selective Materialization for Efficient Implementation of Spatial Data Cubes. TKDE, 12(6), 2000.
Tremblay J.P., Manohar R. Discrete Mathematical Structures with Applications to Computer Science. McGraw Hill Book Company, New York, 1975.
Theodoridis Y., Silva J.R.O., Nasciment M.A. On the Generation of Spatiotemporal Datasets. SSD, 1999.
Yang J., Widom J. Incremental Computation of Temporal Aggregates, ICDE, 2001.
Zhou X., Truffet D., Han J. Efficient Polygon Amalgamation Methods for Spatial OLAP and Spatial Data Mining. SSD, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Papadias, D., Kalnis, P., Zhang, J., Tao, Y. (2001). Efficient OLAP Operations in Spatial Data Warehouses. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds) Advances in Spatial and Temporal Databases. SSTD 2001. Lecture Notes in Computer Science, vol 2121. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47724-1_23
Download citation
DOI: https://doi.org/10.1007/3-540-47724-1_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42301-0
Online ISBN: 978-3-540-47724-2
eBook Packages: Springer Book Archive