Abstract
It is frequently the case that spatial queries require a result set of objects whose scale — however this may be more precisely defined — is the same as that of the query window. In this paper we present an approach which considerably improves query performance in such cases. By adding a scale dimension to the schema we make the index structure explicitly “aware” of the scale of a spatial object. The additional dimension causes the index structure to cluster objects not only by geographic location but also by scale. By matching scales of the query window and the objects, the query then automatically considers only “relevant” objects. Thus, for example, a query window encompassing an entire world map of political boundaries might return only national borders. Note that “scale” is not necessarily synonymous with “size”. This approach improves performance by both narrowing the initial selection criteria and by eliminating the need for subsequent filtering of the query result. In our performance measurements on databases with up to 40 million spatial objects, the introduction of a scale dimension decreased I/O by up to 4 orders of magnitude. The performance gain largely depends on the object scale distribution.
We investigate a broad set of parameters that affect performance and show that many typical applications could benefit considerably from this technique. Its scalability is demonstrated by showing that the benefit increases with the size of the query and/or of the database. The technique is simple to apply and can be used with any multidimensional index structure that can index spatial extents and can be efficiently generalized to three or more dimensions. In our tests we have used the BANG index structure.
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
Stefan Berchtold, Christian Böhm and Hans-Peter Kriegel: “The Pyramid Technique: Towards Breaking the Curse of Dimensionality”, SIGMOD 98, pages 142–153.
David J. DeWitt, Navin Kabra, Jun Luo, Jignesh M. Patel, Jie-Bing Yu: “Client Server Paradise”,Proceedings of the 20th VLDB Conference, 1994, pages 558–569.
M. Freeston: “The BANG file: a new kind of grid file”, Proceedings ACM SIGMOD Conference, San Francisco, California, May 1987.
M. Freeston: “Advances in the Design of the BANG File”, 3rd International Conference on Foundations of Data Organization and Algorithms (FODO), Paris, June 1989. [Lecture Notes in Computer Science No. 367, Springer-Verlag, 1989].
M. Freeston: “A well-behaved file structure for the storage of spatial objects”, Symposium on the Design and Implementation of Large Spatial Databases, Santa Barbara, California, July 1989. [Lecture Notes in Computer Science No. 409, Springer-Verlag, 1989].
M. Freeston: ″A General Solution of the n-dimensional B-tree Problem″, ACM SIGMOD Conference, San Jose, California, May 1995.
J.M. Hellerstein, E. Koutsoupias and C. H. Papadimitriou: “On the Analysis of Indexing Schemes”, Proceedings of the 16th ACM SIGACTSIGMOD-SIGART Symposium on Principles of Database Systems, 1997.
Ravi Kanth V. Kothuri: “Indexing Multidimensional Data”, Ph.D. Thesis, UCSB, 1998.
Elias Koutsoupias and David Scot Taylor: “Tight Bounds for 2-Dimensional Indexing Schemes”, PODS 98, pages 52–58.
Kenneth C. Sevcik and Nikos Koudas: “Filter Trees for Managing Spatial Data Over a Range of Size Granularities”, Technical Report, University of Toronto, November 1995.
Vasilis Samoladas and Daniel P. Miranker: “A Lower Bound Theorem for Indexing Schemes and its Application to Multidimensional Range Queries”, PODS 98, pages 44–51.
Jeffrey Scott Vitter: “External Memory Algorithms”, PODS 98.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
HÖrhammer, M., Freeston, M. (1999). Spatial Indexing with a Scale Dimension. In: Güting, R.H., Papadias, D., Lochovsky, F. (eds) Advances in Spatial Databases. SSD 1999. Lecture Notes in Computer Science, vol 1651. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48482-5_6
Download citation
DOI: https://doi.org/10.1007/3-540-48482-5_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66247-1
Online ISBN: 978-3-540-48482-0
eBook Packages: Springer Book Archive