skip to main content
10.1145/2213556.2213587acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

On the optimality of clustering properties of space filling curves

Published:21 May 2012Publication History

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.

References

  1. J. Alber and R. Niedermeier. On Multidimensional Curves with Hilbert Property. Theory Comput. Syst., 33(4):295--312, 2000.Google ScholarGoogle Scholar
  2. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  3. C. Faloutsos. Multiattribute hashing using gray codes. SIGMOD Record, 15:227--238, June 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. C. Faloutsos. Gray codes for partial match and range queries. IEEE Trans. Software Engg., 14:1381--1393, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. D. Hilbert. Uber die stetige Abbildung einer Linie auf ein Flachenstuck. Math. Ann., 38:459--460, 1891.Google ScholarGoogle ScholarCross RefCross Ref
  6. H. V. Jagadish. Analysis of the Hilbert curve for representing two-dimensional space. Information Processing Letters, 62:17--22, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  8. G.M. Morton. A computer oriented geodetic data base; and a new technique in file sequencing. Technical report, IBM, 1966.Google ScholarGoogle Scholar
  9. Oracle. Oracle spatial and oracle locator. http://www.oracle.com/technetwork/database/options/spatial/overview/introduction/index.html.Google ScholarGoogle Scholar
  10. 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 ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. On the optimality of clustering properties of space filling curves

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          PODS '12: Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems
          May 2012
          332 pages
          ISBN:9781450312486
          DOI:10.1145/2213556

          Copyright © 2012 ACM

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 21 May 2012

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          Overall Acceptance Rate476of1,835submissions,26%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader
        About Cookies On This Site

        We use cookies to ensure that we give you the best experience on our website.

        Learn more

        Got it!