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 via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsRecommended Reading
Faloutsos C. Gray codes for partial match and range queries. IEEE Trans Softw Eng. 1988;14(10):1381–93.
Faloutsos C, Rong Y. Dot: a spatial access method using fractals. In: Proceeding of 7th International Conference on Data Engineering; 1991. p. 152–59.
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.
Goldschlager LM. Short algorithms for space-filling curves. Softw Prac Exp. 1981;11(1):99–100.
Gray F. Pulse code communications. US Patent 2632058; 1953.
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.
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.
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.
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.
Mokbel MF, Aref WG, Kamel I. Analysis of multi-dimensional space-filling curves. GeoInformatica. 2003;7(3):179–209.
Mokbel MF, Aref WG. Irregularity in high-dimensional space-filling curves. Distrib Parallel Databases. 2011;29(3):217–38.
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.
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.
Peano G. Sur une courbe qui remplit toute une air plaine. Math Ann. 1890;36:157–60.
Witten IH, Wyvill B. On the generation and use of space-filling curves. Softw Prac Exp. 1983;3:519–25.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Mokbel, M.F., Aref, W.G. (2018). Space-Filling Curves for Query Processing. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_350
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_350
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering