The Impact of Global Clustering on Spatial Database Systems

Global clustering has rarely been investigated in the area of spatial database systems although dramatic performance improvements can be achieved by using suitable techniques. In this paper, we propose a simple approach to global clustering called cluster organization. We will demonstrate that this cluster organization leads to considerable performance improvements without any algorithmic overhead. Based on real geographic data, we perform a detailed empirical performance evaluation and compare the cluster organization to other organization models not using global clustering. We will show that global clustering speeds up the processing of window queries as well as spatial joins without decreasing the performance of the insertion of new objects and of selective queries such as point queries. The spatial join is sped up by a factor of about 4, whereas non-selective window queries are accelerated by even higher speed up factors.

[1]  P. Burrough Principles of Geographical Information Systems for Land Resources Assessment , 1986 .

[2]  Hans-Peter Kriegel,et al.  The TR*-Tree: A New Representation of Polygonal Objects Supporting Spatial Queries and Operations , 1991, Workshop on Computational Geometry.

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

[4]  Hans-Werner Six,et al.  The LSD tree: Spatial Access to Multidimensional Point and Nonpoint Objects , 1989, VLDB.

[5]  Andrew U. Frank Properties of Geographic Data: Requirements for Spatial Access Methods , 1991, SSD.

[6]  Hans-Werner Six,et al.  Globally order preserving multidimensional linear hashing , 1988, Proceedings. Fourth International Conference on Data Engineering.

[7]  Hans-Peter Kriegel,et al.  Multi-step processing of spatial joins , 1994, SIGMOD '94.

[8]  Michael Stonebraker,et al.  The SEQUOIA 2000 storage benchmark , 1993, SIGMOD '93.

[9]  Hanan Samet,et al.  A qualitative comparison study of data structures for large line segment databases , 1992, SIGMOD '92.

[10]  Bernhard Seeger,et al.  Reading a Set of Disk Pages , 1993, VLDB.

[11]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[12]  Christian Zimmermann,et al.  Global Order Makes Spatial Access Faster , 1992 .

[13]  Hans-Peter Kriegel,et al.  A Storage and Access Architecture for Efficient Query Processing in Spatial Database Systems , 1993, SSD.

[14]  Hans-Peter Kriegel,et al.  The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems , 1990, VLDB.

[15]  Jürg Nievergelt,et al.  The Grid File: An Adaptable, Symmetric Multikey File Structure , 1984, TODS.

[16]  Gerhard Weikum Set-oriented disk access to large complex objects , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

[17]  Hans-Jörg Schek,et al.  Query-Adaptive Data Space Partitioning using Variable-Size Storage Clusters , 1993, SSD.

[18]  Michael Freeston,et al.  The BANG file: A new kind of grid file , 1987, SIGMOD '87.

[19]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[20]  Andreas Reuter,et al.  Transaction Processing: Concepts and Techniques , 1992 .

[21]  Peter Widmayer,et al.  The LSD tree: spatial access to multidimensional and non-point objects , 1989, VLDB 1989.

[22]  P. Pizor Principles of Geographical Information Systems for Land Resources Assessment. , 1987 .

[23]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[24]  Jack A. Orenstein Redundancy in spatial databases , 1989, SIGMOD '89.

[25]  Christos Faloutsos,et al.  The R+-Tree: A Dynamic Index for Multi-Dimensional Objects , 1987, VLDB.

[26]  Michael Stonebraker,et al.  The Sequoia 2000 Benchmark , 1993, SIGMOD Conference.