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

Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes

Published:29 June 2009Publication History

ABSTRACT

The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answered in O(logB NoverM + KoverB) I/Os, where B is the disk block size, K the output size, and M the size of the main memory buffer. When keys are inserted or deleted, the B-tree is updated in O(logB N) I/Os, if we require the resulting changes to be committed to disk right away. Otherwise, the memory buffer can be used to buffer the recent updates, and changes can be written to disk in batches, which significantly lowers the amortized update cost. A systematic way of batching up updates is to use the logarithmic method, combined with fractional cascading, resulting in a dynamic B-tree that supports insertions in O(1overB log NoverM) I/Os and queries in O(log NoverM + KoverB) I/Os. Such bounds have also been matched by several known dynamic B-tree variants in the database literature. Note that, however, the query cost of these dynamic B-trees is substantially worse than the O(logB NoverM + KoverB) bound of the static B-tree by a factor of ?(log B).

In this paper, we prove that for any dynamic one dimensional range query index structure with query cost O(q + KoverB) and amortized insertion cost O(u/B), the tradeoff q · log(u/q) = ©(log B) must hold if q = O(log B). For most reasonable values of the parameters, we have NoverM = BO(1), in which case our query-insertion tradeoff implies that the bounds mentioned above are already optimal. We also prove a lower bound of u · log q = ©(log B), which is relevant for larger values of q. Our lower bounds hold in a dynamic version of the indexability model, which is of independent interests. Dynamic indexability is a clean yet powerful model for studying dynamic indexing problems, and can potentially lead to more interesting complexity results.

References

  1. S. Alstrup, G. Brodal, and T. Rauhe. Optimal static range reporting in one dimension. In Proc. ACM Symposium on Theory of Computation, pages 476--482, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. L. Arge. The buffer tree: A technique for designing batched external data structures. Algorithmica, 37(1):1--24, 2003. See also WADS'95.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. L. Arge, V. Samoladas, and J. S. Vitter. On two-dimensional indexability and optimal range search indexing. In Proc. ACM Symposium on Principles of Database Systems, pages 346--357, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. L. Arge, V. Samoladas, and K. Yi. Optimal external memory planar point enclosure. Algorithmica, to appear. See also ESA'04. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. R. Bayer and E. McCreight. Organization and maintenance of large ordered indexes. Acta Informatica, 1:173--189, 1972.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. P. Beame and F. E. Fich. Optimal bounds for the predecessor problem and related problems. Journal of Computer and System Sciences, 65(1):38--72, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. J. L. Bentley and J. B. Saxe. Decomposable searching problems I: Static-to-dynamic transformation. Journal of Algorithms, 1:301--358, 1980.Google ScholarGoogle Scholar
  8. G. S. Brodal and R. Fagerberg. Lower bounds for external memory dictionaries. In Proc. ACM-SIAM Symposium on Discrete Algorithms, pages 546--554, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. A. L. Buchsbaum, M. Goldwasser, S. Venkatasubramanian, and J. R. Westbrook. On external memory graph traversal. In Proc. ACM-SIAM Symposium on Discrete Algorithms, pages 859--860, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. B. Chazelle and L. J. Guibas. Fractional cascading: I. A data structuring technique. Algorithmica, 1:133--162, 1986.Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. J. M. Hellerstein, E. Koutsoupias, D. Miranker, C. H. Papadimitriou, and V. Samoladas. On a model of indexability and its bounds for range queries. Journal of the ACM, 49(1):35--55, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. J. M. Hellerstein, E. Koutsoupias, and C. H. Papadimitriou. On the analysis of indexing schemes. In Proc. ACM Symposium on Principles of Database Systems, pages 249--256, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. H. V. Jagadish, P. P. S. Narayan, S. Seshadri, S. Sudarshan, and R. Kanneganti. Incremental organization for data recording and warehousing. In Proc. International Conference on Very Large Databases, pages 16--25, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. C. Jermaine, A. Datta, and E. Omiecinski. A novel index supporting high volume data waresshouse insertion. In Proc. International Conference on Very Large Databases, pages 235--246, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. D. E. Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming. Addison-Wesley, Reading, MA, 1973.Google ScholarGoogle Scholar
  16. E. Koutsoupias and D. S. Taylor. Tight bounds for 2-dimensional indexing schemes. In Proc. ACM Symposium on Principles of Database Systems, pages 52--58, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. C. W. Mortensen, R. Pagh, and M. Patra_cu. On dynamic range reporting in one dimension. In Proc. ACM Symposium on Theory of Computation, pages 104--111, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. P. O'Neil, E. Cheng, D. Gawlick, and E. O'Neil. The log-structured merge-tree (LSM-tree). Acta Informatica, 33(4):351--385, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. V. Samoladas and D. Miranker. A lower bound theorem for indexing schemes and its application to multidimensional range queries. In Proc. ACM Symposium on Principles of Database Systems, pages 44--51, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Z. Wei, K. Yi, and Q. Zhang. Dynamic external hashing: The limit of buffering. Manuscript.Google ScholarGoogle Scholar
  21. A. Yao. Should tables be sorted? Journal of the ACM, 28(3):615--628, 1981. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes

        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 '09: Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
          June 2009
          298 pages
          ISBN:9781605585536
          DOI:10.1145/1559795
          • General Chair:
          • Jan Paredaens,
          • Program Chair:
          • Jianwen Su

          Copyright © 2009 ACM

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 29 June 2009

          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!