Skip to main content

Using Space-Filling Curves for Multi-dimensional Indexing

  • Conference paper
  • First Online:
Advances in Databases (BNCOD 2000)

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

Included in the following conference series:

Abstract

This paper presents and discusses a radically different approach to multi-dimensional indexing based on the concept of the space-filling curve. It reports the novel algorithms which had to be developed to create the first actual implementation of a system based on this approach, on some comparative performance tests, and on its actual use within the TriStarp Group at Birkbeck to provide a Triple Store repository. An important result that goes beyond this requirement, however, is that the performance improvement over the Grid File is greater the higher the dimension.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Theodore Bially. Space-Filling Curves: Their Generation and Their Application to Bandwidth Reduction. IEEE Transactions on Information Theory, IT-15(6):658–664, Nov 1969.

    Article  Google Scholar 

  2. Arthur R. Butz. Alternative Algorithm for Hilbert’s Space-Filling Curve. IEEE Transactions on Computers, 20:424–426, April 1971.

    Article  MATH  Google Scholar 

  3. Mir Derakhshan. A Development of the Grid File for the Storage of Binary Relations. PhD thesis, Birkbeck College, University of London, 1989.

    Google Scholar 

  4. Christos Faloutsos and Shari Roseman. Fractals for Secondary Key Retrieval. Technical Report UMIACS-TR-89-47, University of Maryland, 1989. http://www.cs.cmu.edu/christos/cpub.html.

  5. Christos Faloutsos and Yi Rong. DOT: A Spatial Access Method Using Fractals. In: Proceedings of the Seventh International Conference on Data Engineering, April 8–12, 1991, Kobe, Japan, pages 152–159. IEEE Computer Society.

    Google Scholar 

  6. M. Freeston. The BANG File: A New Kind of Grid File. In: Umeshwar Dayal and Irving L. Traiger (eds): Proceedings of the Association for Computing Machinery Special Interest Group on Management of Data Annual Conference, May 27–29, 1987, San Francisco, California, pages 260–269. ACM Press.

    Google Scholar 

  7. Volker Gaede and Oliver Günther. Multidimensional Access Methods. ACM Computing Surveys, 30(2):170–231, June 1998.

    Article  Google Scholar 

  8. Antonin Guttman. R-Trees: A Dynamic Index Structure for Spatial Seaching. In: SIGMOD’ 84: Proceedings of the Annual Meeting, volume 14(2) of SIGMOD Record, pages 47–57. ACM, 1984.

    Google Scholar 

  9. David Hilbert. Ueber stetige Abbildung einer Linie auf ein Flachenstuck. Mathematische Annalen. 38:459–460, 1891.

    Article  MathSciNet  Google Scholar 

  10. H.V. Jagadish. Analysis of the Hilbert curve for representing two-dimensional space. Information Processing Letters, 62(1):17–22, April 1997.

    Article  MathSciNet  Google Scholar 

  11. Akhil Kumar. A Study of Spatial Clustering Techniques. In: Dimitris Karagiannis (ed): Proceedings of the 5th International Conference on Database and Expert Systems Applications (DEXA’ 94), volume 856 of Lecture Notes in Computer Science, pages 57–71. Springer-Verlag, Sept 1994.

    Google Scholar 

  12. Jonathan Lawder. The Application of Space-Filling Curves to the Storage and Retrieval of Multi-dimensional Data (Submitted for PhD). Technical Report JL/1/99, Birkbeck College, University of London, 1999.

    Google Scholar 

  13. Bongki Moon and H.V. Jagadish and Christos Faloutsos and Joel H. Saltz. Analysis of the Clustering Properties of the Hilbert Space-Filling Curve. Tchnical Report CS-TR-3611 / UMIACS-TR-96-20, University of Maryland, 1996.

    Google Scholar 

  14. Jürg Nievergelt and Hans Hinterberger and Kenneth C. Sevcik. The Grid File: An Adaptable, Symmetric Multikey File Structure. ACM Transactions on Database Systems (TODS), 9(1):38–71, 1984.

    Article  Google Scholar 

  15. Jack A. Orenstein and F.A. Manola. PROBE: Spatial Data Modeling and Query Processing in an Image Database Application. IEEE Transactions on Software Engineering, 14(5):611–629, 1988.

    Article  Google Scholar 

  16. Giuseppe Peano. Sur une courbe, qui remplit toute une aire plane (On a curve which completely fills a planar region). Mathematische Annalen, 36:157–160, 1890.

    Article  MathSciNet  Google Scholar 

  17. Hans Sagan. Space-Filling Curves. Springer-Verlag, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lawder, J.K., King, P.J.H. (2000). Using Space-Filling Curves for Multi-dimensional Indexing. In: Lings, B., Jeffery, K. (eds) Advances in Databases. BNCOD 2000. Lecture Notes in Computer Science, vol 1832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45033-5_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-45033-5_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67743-7

  • Online ISBN: 978-3-540-45033-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics