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

New results on two-dimensional orthogonal range aggregation in external memory

Authors Info & Claims
Published:13 June 2011Publication History

ABSTRACT

We consider the orthogonal range aggregation problem. The dataset S consists of N axis-parallel rectangles in R2, each of which is associated with an integer weight. Given an axis-parallel rectangle Q and an aggregate function F, a query reports the aggregated result of the weights of the rectangles in S intersecting Q. The goal is to preprocess S into a structure such that all queries can be answered efficiently. We present indexing schemes to solve the problem in external memory when F = max (hence, min) and F = sum (hence, count and average), respectively. Our schemes have linear or near-linear space, and answer a query in O(logBN) or O(logB2/BN) I/Os, where B is the disk block size.

References

  1. P. Afshani, L. Arge, and K. D. Larsen. Orthogonal range reporting in three and higher dimensions. In Proceedings of Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 149--158, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. P. Afshani, L. Arge, and K. D. Larsen. Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements. In Symposium on Computational Geometry (SoCG), pages 240--246, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. P. K. Agarwal, L. Arge, J. Yang, and K. Yi. I/O-efficient structures for orthogonal range-max and stabbing-max queries. In Proceedings of European Symposium on Algorithms (ESA), pages 7--18, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  4. P. K. Agarwal, L. Arge, and K. Yi. An optimal dynamic interval stabbing-max data structure? In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 803--812, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 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
  6. S. Alstrup, G. S. Brodal, and T. Rauhe. New data structures for orthogonal range searching. In Proceedings of Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 198--207, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. L. Arge. The buffer tree: A technique for designing batched external data structures. Algorithmica, 37(1):1--24, 2003.Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. L. Arge and J. Vahrenhold. I/O-efficient dynamic planar point location. Computational Geometry, 29(2):147--162, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. L. Arge and J. S. Vitter. Optimal dynamic interval management in external memory. In Proceedings of Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 560--569, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. B. Chazelle. An algorithm for segment-dragging and its implementation. Algorithmica, 3:205--221, 1988.Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. B. Chazelle. A functional approach to data structures and its use in multidimensional searching. SIAM Journal of Computing, 17(3):427--462, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. H. Edelsbrunner and M. H. Overmars. On the equivalence of some rectangle problems. Information Processing Letters (IPL), 14(3):124--127, 1982.Google ScholarGoogle Scholar
  13. S. Govindarajan, P. K. Agarwal, and L. Arge. CRB-tree: An efficient indexing scheme for range-aggregate queries. In Proceedings of International Conference on Database Theory (ICDT), pages 143--157, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. H. Kaplan, E. Molad, and R. E. Tarjan. Dynamic rectangular intersection with priorities. In Proceedings of ACM Symposium on Theory of Computing (STOC), pages 639--648, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. I. Lazaridis and S. Mehrotra. Progressive approximate aggregate queries with a multi-resolution tree structure. In Proceedings of ACM Management of Data (SIGMOD), pages 401--412, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. D. Papadias, P. Kalnis, J. Zhang, and Y. Tao. Efficient OLAP operations in spatial data warehouses. In Proceedings of Symposium on Advances in Spatial and Temporal Databases (SSTD), pages 443--459, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. B. Salzberg and V. J. Tsotras. Comparison of access methods for time-evolving data. ACM Computing Surveys, 31(2):158--221, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Y. Tao and D. Papadias. Range aggregate processing in spatial databases. IEEE Transactions on Knowledge and Data Engineering (TKDE), 16(12):1555--1570, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. J. S. Vitter. Algorithms and data structures for external memory. Foundation and Trends in Theoretical Computer Science, 2(4):305--474, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. D. Zhang, A. Markowetz, V. J. Tsotras, D. Gunopulos, and B. Seeger. On computing temporal aggregates with range predicates. ACM Transactions on Database Systems (TODS), 33(2), 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. D. Zhang and V. J. Tsotras. Optimizing spatial min/max aggregations. The VLDB Journal, 14(2):170--181, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. New results on two-dimensional orthogonal range aggregation 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 '11: Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
          June 2011
          332 pages
          ISBN:9781450306607
          DOI:10.1145/1989284

          Copyright © 2011 ACM

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 13 June 2011

          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!