Multiresolution Amalgamation: Dynamic Spatial Data Cube Generation

Aggregating spatial objects is a necessary step in generating spatial data cubes to support roll-up/drill-down operations. Current approaches face performance bottleneck issues when attempting to dynamically aggregate geometries for a large set of spatial data. We observe that changing the resolution of a region is reflective of the fact that the precision of spatial data can be changed to certain extent without compromising its usefulness. Moreover most spatial datasets are stored at much higher resolutions than are necessary for some applications. The existing approaches, which aggregate objects at a base resolution, often results in a processing bottleneck due to extraneous I/O. In this paper, we develop a new aggregation methodology that can significantly reduce retrieval (I/O) costs and improve overall performance by utilising multiresolution data storage and retrieval techniques. Topological inconsistencies that may arise during resolution change, which are not handled by current amalgamation techniques, are identified. By factoring these issues into the amalgamation query processing, the retrieval loads can be further reduced with guaranteed topological correctness. Experimental results illustrate significant savings in data retrieval and overall processing time of dynamic aggregation.

[1]  Robert Weibel,et al.  Using Vector and Raster-Based Techniques in Categorical Map Generalization , 1999 .

[2]  Hans-Peter Kriegel,et al.  Spatial Data Mining: A Database Approach , 1997, SSD.

[3]  Hans-Peter Kriegel,et al.  Efficient processing of spatial joins using R-trees , 1993, SIGMOD Conference.

[4]  Leila De Floriani,et al.  VARIANT—processing and visualizing terrains at variable resolution , 1997, GIS '97.

[5]  J. Edward Swan,et al.  Proceedings of the conference on Visualization '02 , 2001 .

[6]  Michael Freeston,et al.  Spatial Indexing with a Scale Dimension , 1999, SSD.

[7]  Jan Van den Bussche,et al.  Lossless Representation of Topological Spatial Data , 1995, SSD.

[8]  Chandrajit L. Bajaj,et al.  Topology preserving data simplification with error bounds , 1998, Comput. Graph..

[9]  Nectaria Tryfona,et al.  Consistency among parts and aggregates: A computational model , 1996, Trans. GIS.

[10]  Leila De Floriani,et al.  Applications of Computational Geometry to Geographic Information Systems , 2000, Handbook of Computational Geometry.

[11]  Kai Xu Database Support For Multiresolution Terrain Visualization , 2003, ADC.

[12]  Jiawei Han,et al.  Efficient Polygon Amalgamation Methods for Spatial OLAP and Spatial Data Mining , 1999, SSD.

[13]  Wei Li,et al.  Skew handling techniques in sort-merge join , 2002, SIGMOD '02.

[14]  Surajit Chaudhuri,et al.  An overview of data warehousing and OLAP technology , 1997, SGMD.

[15]  Jiawei Han,et al.  Object-Based Selective Materialization for Efficient Implementation of Spatial Data Cubes , 2000, IEEE Trans. Knowl. Data Eng..

[16]  Xiaofang Zhou,et al.  Database support for spatial generalisation for WWW and mobile applications , 2002, Proceedings of the Third International Conference on Web Information Systems Engineering, 2002. WISE 2002..

[17]  T. H. Merrett,et al.  A class of data structures for associative searching , 1984, PODS.

[18]  Renato Pajarola,et al.  Topology preserving and controlled topology simplifying multiresolution isosurface extraction , 2000, Proceedings Visualization 2000. VIS 2000 (Cat. No.00CH37145).

[19]  Xiaofang Zhou,et al.  Dynamic Multi-Resolution Spatial Object Derivation for Mobile and WWW Applications , 2003, World Wide Web.

[20]  Max J. Egenhofer,et al.  Topological Error Correcting in GIS , 1997, SSD.

[21]  Sheng Zhou,et al.  Design and Implementation of Multi-scale Databases , 2001, SSTD.

[22]  Leila De Floriani,et al.  Data Structures for Simplicial Multi-complexes , 1999, SSD.