ABSTRACT
Space filling curves have for long been used in the design of data structures for multidimensional data. A fundamental quality metric of a space filling curve is its "clustering number" with respect to a class of queries, which is the average number of contiguous segments on the space filling curve that a query region can be partitioned into. We present a characterization of the clustering number of a general class of space filling curves, as well as the first non-trivial lower bounds on the clustering number for any space filling curve. Our results also answer an open problem that was posed by Jagadish in 1997.
- J. Alber and R. Niedermeier. On Multidimensional Curves with Hilbert Property. Theory Comput. Syst., 33(4):295--312, 2000.Google Scholar
- T. Asano, D. Ranjan, T. Roos, E. Welzl, and P. Wid-mayer. Space-filling curves and their use in the design of geometric data structures. Theor. Comput. Sci., 181(1):3--15, 1997. Google Scholar
Digital Library
- C. Faloutsos. Multiattribute hashing using gray codes. SIGMOD Record, 15:227--238, June 1986. Google Scholar
Digital Library
- C. Faloutsos. Gray codes for partial match and range queries. IEEE Trans. Software Engg., 14:1381--1393, 1988. Google Scholar
Digital Library
- D. Hilbert. Uber die stetige Abbildung einer Linie auf ein Flachenstuck. Math. Ann., 38:459--460, 1891.Google Scholar
Cross Ref
- H. V. Jagadish. Analysis of the Hilbert curve for representing two-dimensional space. Information Processing Letters, 62:17--22, 1997. Google Scholar
Digital Library
- B. Moon, H. V. Jagadish, C. Faloutsos, and J. H. Saltz. Analysis of the clustering properties of the Hilbert space-filling curve. IEEE Trans. Knowledge and Data Engineering, 13(1):124--141, 2001. Google Scholar
Digital Library
- G.M. Morton. A computer oriented geodetic data base; and a new technique in file sequencing. Technical report, IBM, 1966.Google Scholar
- Oracle. Oracle spatial and oracle locator. http://www.oracle.com/technetwork/database/options/spatial/overview/introduction/index.html.Google Scholar
- J. A. Orenstein and T. H. Merrett. A class of data structures for associative searching. In Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems, PODS '84, pages 181--190, 1984. Google Scholar
Digital Library
Index Terms
On the optimality of clustering properties of space filling curves
Recommendations
Optimality of Clustering Properties of Space-Filling Curves
Space-filling curves have been used in the design of data structures for multidimensional data for many decades. A fundamental quality metric of a space-filling curve is its “clustering number” with respect to a class of queries, which is the average ...
Clustering Analyses of Two-Dimensional Space-Filling Curves
Future Data and Security EngineeringAbstractA discrete space-filling curve provides a linear traversal or indexing of a multi-dimensional grid space. This paper presents two analytical studies on clustering analyses of the 2-dimensional Hilbert and z-order curve families. The underlying ...
A Lower Bound on Proximity Preservation by Space Filling Curves
IPDPS '12: Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing SymposiumA space filling curve (SFC) is a proximity preserving mapping from a high dimensional space to a single dimensional space. SFCs have been used extensively in dealing with multi-dimensional data in parallel computing, scientific computing, and databases. ...






Comments