The Community for Technology Leaders
Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337) (1999)
Sydney, Australia
Mar. 23, 1999 to Mar. 26, 1999
ISSN: 1063-6382
ISBN: 0-7695-0071-4
pp: 600
Chung-Min Chen , Bellcore
Raksih K. Sinha , Bell Laboratories
ABSTRACT
Various declustering techniques have been proposed in the literature for raster-geospatial data. Their primary focus is on reducing response time for static range queries. In this paper we focus on interactive navigation queries, which exhibit a new class of data access patterns. We analyze and compare the performance of three well-known declustering schemes: Disk Modulo, Exclusive-OR, and Hilbert Curve Access Method. The results show that Disk Modulo is close to optimal and, contrary to the case of range queries, is significantly better than Hilbert Curve Access Method. In addition, we propose a new scheme that further improves Disk Modulo for a realistic situation when the navigation window is bounded by a maximum size, a common constraint due to either monitor resolution or limited memory size. Performance properties of the scheme are also analyzed.
INDEX TERMS
CITATION

R. K. Sinha and C. Chen, "Raster-Spatial Data Declustering Revisited: an Interactive Navigation Perspective," Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)(ICDE), Sydney, Australia, 1999, pp. 600.
doi:10.1109/ICDE.1999.754976
84 ms
(Ver 3.3 (11022016))