Encyclopedia of Database Systems

2018 Edition
| Editors: Ling Liu, M. Tamer Özsu

Space-Filling Curves for Query Processing

  • Mohamed F. Mokbel
  • Walid G. Aref
Reference work entry
DOI: https://doi.org/10.1007/978-1-4614-8265-9_350

Synonyms

Distance-preserving mapping; Linearization; Locality-preserving mapping; Multidimensional mapping

Definition

Given a query Q, a one-dimensional index structure I (e.g., B-tree), and a set of D-dimensional points, a space-filling curve S is used to map the D-dimensional points into a set of one-dimensional points that can be indexed through I for an efficient execution of query Q. The main idea is that space-filling curves are used as a way of mapping the multidimensional space into the one-dimensional space such that existing one-dimensional query processing and indexing techniques can be applied.

Historical Background

Although space-filling curves were discovered in 1890 [14], their use in query processors has emerged only in the last two decades as it is mainly motivated by the emergence of multidimensional applications. In particular, space-filling curves have been used as a mapping scheme that supports spatial join algorithms [13], spatial access methods [2, 7], efficient...

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

Recommended Reading

  1. 1.
    Faloutsos C. Gray codes for partial match and range queries. IEEE Trans Softw Eng. 1988;14(10):1381–93.MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Faloutsos C, Rong Y. Dot: a spatial access method using fractals. In: Proceeding of 7th International Conference on Data Engineering; 1991. p. 152–59.Google Scholar
  3. 3.
    Gibson G, Nagle D, Amiri K, Butler J, Chang FW, Gobioff H, Hardin C, Riedel E, Rochberg D, Zelenka J. File server scaling with network-attached secure disks. In: Proceeding of 1997 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer System; 1997. p. 272–84.Google Scholar
  4. 4.
    Goldschlager LM. Short algorithms for space-filling curves. Softw Prac Exp. 1981;11(1):99–100.CrossRefGoogle Scholar
  5. 5.
    Gray F. Pulse code communications. US Patent 2632058; 1953.Google Scholar
  6. 6.
    Jagadish HV. Linear clustering of objects with multiple attributes. In: Proceeding of the ACM SIGMOD International Conference on Management of Data; 1990. p. 332–42.Google Scholar
  7. 7.
    Kamel I, Faloutsos C. Hilbert r-tree: an improved r-tree using fractals. In: Proceeding of the 20th International Conference on Very Large Data Bases; 1994. p. 500–09.Google Scholar
  8. 8.
    Liao S, Lopez MA, Leutenegger ST. High dimensional similarity search with space-filling curves. In: Proceeding of the 17th International Conference on Data Engineering; 2001. p. 615–22.Google Scholar
  9. 9.
    Mokbel MF, Aref WG, El-Bassyouni K, Kamel I. Scalable multimedia disk scheduling. In: Proceeding of the 20th International Conference on Data Engineering; 2004. p. 498–509.Google Scholar
  10. 10.
    Mokbel MF, Aref WG, Kamel I. Analysis of multi-dimensional space-filling curves. GeoInformatica. 2003;7(3):179–209.CrossRefGoogle Scholar
  11. 11.
    Mokbel MF, Aref WG. Irregularity in high-dimensional space-filling curves. Distrib Parallel Databases. 2011;29(3):217–38.CrossRefGoogle Scholar
  12. 12.
    Moon B, Jagadish HV, Faloutsos C, Salz J. Analysis of the clustering properties of Hilbert space-filling curve. IEEE Trans Knowl Data Eng. 2001;13(1):124–41.CrossRefGoogle Scholar
  13. 13.
    Orenstein JA Spatial query processing in an object-oriented database system. In: Proceeding of the ACM SIGMOD International Conference on Management of Data; 1986. p. 326–36.MathSciNetCrossRefGoogle Scholar
  14. 14.
    Peano G. Sur une courbe qui remplit toute une air plaine. Math Ann. 1890;36:157–60.MathSciNetzbMATHCrossRefGoogle Scholar
  15. 15.
    Witten IH, Wyvill B. On the generation and use of space-filling curves. Softw Prac Exp. 1983;3:519–25.zbMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringUniversity of Minnesota-Twin CitiesMinneapolisUSA
  2. 2.Purdue UniversityWest LafayetteUSA

Section editors and affiliations

  • Dimitris Papadias
    • 1
  1. 1.Dept. of Computer Science and Eng.Hong Kong Univ. of Science and TechnologyKowloonHong Kong SAR