Skip to main content

XZ-Ordering: A Space-Filling Curve for Objects with Spatial Extension

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1651))

Abstract

There is an increasing need to integrate spatial index structures into commercial database management systems. In geographic information systems (GIS), huge amounts of information involving both, spatial and thematic attributes, have to be managed. Whereas relational databases are adequate for handling thematic attributes, they fail to manage spatial information efficiently. In this paper, we point out that neither a hybrid solution using relational databases and a separate spatial index nor the approach of existing object-relational database systems provide a satisfying solution to this problem. Therefore, it is necessary to map the spatial information into the relational model. Promising approaches to this mapping are based on space-filling curves such as Z-ordering or the Hilbert curve. These approaches perform an embedding of the multidimensional space into the one-dimensional space. Unfortunately, the techniques are very sensitive to the suitable choice of an underlying resolution parameter if objects with a spatial extension such as rectangles or polygons are stored. The performance usually deteriorates drastically if the resolution is chosen too high or too low. Therefore, we present a new kind of ordering which allows an arbitrary high resolution without performance degeneration. This robustness is achieved by avoiding object duplication, allowing overlapping Z-elements, by a novel coding scheme for the Zelements and an optimized algorithm for query processing. The superiority of our technique is shown both, theoretically as well as practically with a comprehensive experimental evaluation.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abel D.J., Smith J.L.: ‘A Data Structure and Algorithm Based on a Linear Key for a Rectangle Retrieval Problem’, Computer Vision 24, pp. 1–13.

    Google Scholar 

  2. Berchtold S., Keim D., Kriegel H.-P.: ‘Using Extended Feature Objects for Partial Similarity Retrieval’, VLDB Journal Vol. 6, No. 4, pp. 333–348, 1997.

    Article  Google Scholar 

  3. Brinkhoff T., Kriegel H.-P., Schneider R.: ‘Comparison of Approximations of Complex Objects Used for Approximation-based Query Processing in Spatial Database Systems’, ICDE 1993, pp. 40–49.

    Google Scholar 

  4. Beckmann N., Kriegel H.-P., Schneider R., Seeger B.: ‘The R*-tree: An Efficient and Robust Access Method for Points and Rectangles’, Proc. ACM SIGMOD Int. Conf. on Management of Data, Atlantic City, NJ, 1990, pp. 322–331.

    Google Scholar 

  5. Gaede V.: ‘Optimal Redundancy in Spatial Database Systems’, Proc. 4th Int. Symposium on Advances in Spatial Databases, SSD′95, Portland, Maine, USA, 1995, Lecture Notes in Computer Science Vol. 951, pp. 96–116.

    Google Scholar 

  6. Gaede V., Günther O.:‘Multidimensional Access Methods’, ACM Computing Surveys, Vol. 30, No. 2, 1998, pp. 170–231.

    Article  Google Scholar 

  7. Güting R. H.: ‘An Introduction to Spatial Database Systems’. VLDB Journal, Vol. 3, No. 4, 1994.

    Google Scholar 

  8. Guttman A.: ‘R-trees: A Dynamic Index Structure for Spatial Searching’, Proc. ACM SIGMOD Int. Conf. on Management of Data, Boston, MA, 1984, pp. 47–57.

    Google Scholar 

  9. Hilbert D.: ‘Über die stetige Abbildung einer Linie auf ein Flächenstück’, Math. Annln., Vol. 38, 1891, pp. 459–460.

    Article  MathSciNet  Google Scholar 

  10. Klump G.: ‘Development, Implementation and Evaluation of Strategies for Geometric Query Processing Under Oracle 8’ (in German), master thesis, University of Munich.

    Google Scholar 

  11. Kumar A.: ‘A Study of Spatial Clustering techniques’, DEXA 1994, pp. 57–71.

    Google Scholar 

  12. Faloutsos C.: ‘Multiattribute Hashing Using Gray Codes’, Proc. ACM SIGMOD Int. Conf. on Management of Data, Washington D.C., 1986, pp. 227–238.

    Google Scholar 

  13. Faloutsos C.: ‘Gray Codes for Partial Match and Range Queries’, IEEE Transactions on Software Engineering (TSE), Vol. 14, No. 10, 1988, pp. 1381–1393.

    Article  MATH  MathSciNet  Google Scholar 

  14. Finkel R, Bentley J.L. ‘Quad Trees: A Data Structure for Retrieval of Composite Keys’, Acta Informatica, Vol. 4, No. 1, 1974, pp. 1–9.

    Article  MATH  Google Scholar 

  15. Faloutsos C., Rong Y.: ‘DOT: A Spatial Access Method Using Fractals’, Proc. 7th Int. Conf. on Data Engineering, Kobe, Japan, 1991, pp. 152–159.

    Google Scholar 

  16. Faloutsos C., Roseman S.: ‘Fractals for Secondary Key Retrieval’, Proc. 8th ACM PODS, Philadelphia, PA, 1989, pp. 247–252.

    Google Scholar 

  17. Jagadish H. V.: ‘Linear Clustering of Objects with Multiple Atributes’, Proc. ACM SIGMOD Int. Conf. on Managment of Data, Atlantic City, NJ, 1990, pp. 332–342.

    Google Scholar 

  18. Morton G.: ‘A Computer Oriented Geodetic Data BAse and a New Technique in File Sequencing’, IBM Ltd., 1966.

    Google Scholar 

  19. Oosterom P.: ‘Reactive Data Structures for Geographic Iinformation Systems’. Ph.D. thesis, University of Leiden, The Netherlands.

    Google Scholar 

  20. Orenstein J. A.: ‘Redundancy in Spatial Databases’, Proc. ACM SIGMOD Int. Conf. on Management of Data, Portland, OR, 1989, pp. 294–305.

    Google Scholar 

  21. Orenstein J. A.:‘Strategies for Optimizing the Use of Redundancy in Spatial Databases’, Proc. 1st Symposium on Large Spatial Databases, Santa Barbara, CA, pp. 115–134.

    Google Scholar 

  22. Orenstein J. A., Merrett T. H.: ‘A Class of Data Structures for Associative Searching’, Proc. 3rd ACM PODS, Waterloo, Ontario, Canada, 1984, pp. 181–190.

    Google Scholar 

  23. Sagan H.: ‘Space-Filling Curves’, Berlin/Heidelberg/New York: Springer-Verlag, 1994.

    MATH  Google Scholar 

  24. Samet H.: ‘The design and analysis of spatial data structures’. Reading, MA: Addison-Wesley.

    Google Scholar 

  25. Sellis T. K., Roussopoulos N., Faloutsos C.: ‘The R+-Tree: A Dynamic Index for Multi-Dimensional Objects’, Proc. 13th Int. Conf. on Very Large Data Bases, Brighton, England, 1987, pp. 507–518.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

BÖxhm, C., Klump, G., Kriegel, HP. (1999). XZ-Ordering: A Space-Filling Curve for Objects with Spatial Extension. 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_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-48482-5_7

  • 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

Publish with us

Policies and ethics