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

Dynamic top-k range reporting in external memory

Authors Info & Claims
Published:21 May 2012Publication History

ABSTRACT

In the top-K range reporting problem, the dataset contains N points in the real domain ℜ, each of which is associated with a real-valued score. Given an interval x1,x2 in ℜ and an integer KN, a query returns the K points in x1,x2 having the smallest scores. We want to store the dataset in a structure so that queries can be answered efficiently. In the external memory model, the state of the art is a static structure that consumes O(N/B) space, answers a query in O(logB N + K/B) time, and can be constructed in O(N + (N log N / B) log M/B (N/B)) time, where B is the size of a disk block, and M the size of memory. We present a fully-dynamic structure that retains the same space and query bounds, and can be updated in O(log2B N) amortized time per insertion and deletion. Our structure can be constructed in O((N/B) log M/B (N/B)) time.

References

  1. P. Afshani, G. S. Brodal, and N. Zeh. Ordered and unordered top-k range reporting in large data sets. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 390--400, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM (CACM), 31(9):1116--1127, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. L. Arge, V. Samoladas, and J. S. Vitter. On two-dimensional indexability and optimal range search indexing. In Proceedings of ACM Symposium on Principles of Database Systems (PODS), pages 346--357, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. L. Arge and J. S. Vitter. Optimal dynamic interval management in external memory (extended abstract). In Proceedings of Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 560--569, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. G. S. Brodal, R. Fagerberg, M. Greve, and A. Lopez-Ortiz. Online sorted range reporting. In International Symposium on Algorithms and Computation (ISAAC), pages 173--182, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. G. N. Frederickson. An optimal algorithm for selection in a min-heap. Information and Computation, 104(2):197--214, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. G. N. Frederickson and D. B. Johnson. The complexity of selection and ranking in x y and matrices with sorted columns. Journal of Computer and System Sciences (JCSS), 24(2):197--208, 1982.Google ScholarGoogle Scholar
  8. H.-P. Hung, K.-T. Chuang, and M.-S. Chen. Efficient process of top-k range-sum queries over multiple streams with minimized global error. IEEE Transactions on Knowledge and Data Engineering (TKDE), 19(10):1404--1419, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Z. W. Luo, T. W. Ling, C.-H. Ang, S. Y. Lee, and B. Cui. Range top/bottom k queries in olap sparse data cubes. In Proceedings of International Conference on Database and Expert Systems Applications (DEXA), pages 678--687, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. E. M. McCreight. Priority search trees. SIAM Journal of Computing, 14(2):257--276, 1985.Google ScholarGoogle ScholarCross RefCross Ref
  11. J. Yang and J. Widom. Incremental computation and maintenance of temporal aggregates. The VLDB Journal, 12(3):262--283, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Dynamic top-k range reporting in external memory

        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!