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

FIFO indexes for decomposable problems

Authors Info & Claims
Published:13 June 2011Publication History

ABSTRACT

This paper studies first-in-first-out (FIFO) indexes, each of which manages a dataset where objects are deleted in the same order as their insertions. We give a technique that converts a static data structure to a FIFO index for all decomposable problems, provided that the static structure can be constructed efficiently. We present FIFO access methods to solve several problems including half-plane search, nearest neighbor search, and extreme-point search. All of our structures consume linear space, and have optimal or near-optimal query cost.

References

  1. P. Afshani and T. M. Chan. Optimal halfspace range reporting in three dimensions. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 180--186, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. P. K. Agarwal, L. Arge, G. S. Brodal, and J. S. Vitter. I/O-efficient dynamic point location in monotone planar subdivisions. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 11--20, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. P. K. Agarwal, L. Arge, and J. Erickson. Indexing moving points. Journal of Computer and System Sciences (JCSS), 66(1):207--243, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. P. K. Agarwal, L. Arge, J. Erickson, P. G. Franciosa, and J. S. Vitter. Efficient searching with linear constraints. Journal of Computer and System Sciences (JCSS), 61(2):194--216, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 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
  6. P. K. Agarwal and J. Matousek. Dynamic half-space range reporting and its applications. Algorithmica, 13(4):325--345, 1995.Google ScholarGoogle ScholarCross RefCross Ref
  7. 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
  8. A. Arasu and G. S. Manku. Approximate counts and quantiles over sliding windows. In Proceedings of ACM Symposium on Principles of Database Systems (PODS), pages 286--296, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. L. Arge, A. Danner, and S.-M. Teh. I/O-efficient point location using persistent B-trees. ACM Journal of Experimental Algorithmics, 8, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. L. Arge and J. Vahrenhold. I/O-efficient dynamic planar point location. Computational Geometry, 29(2):147--162, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and issues in data stream systems. In Proceedings of ACM Symposium on Principles of Database Systems (PODS), pages 1--16, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. J. L. Bentley and J. B. Saxe. Decomposable searching problems I: Static-to-dynamic transformation. Journal of Algorithms, 1(4):301--358, 1980.Google ScholarGoogle ScholarCross RefCross Ref
  13. G. S. Brodal and R. Jacob. Dynamic planar convex hull. In Proceedings of Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 617--626, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. T. M. Chan. A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries. Journal of the ACM (JACM), 57(3), 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Y.-C. Chang, L. D. Bergman, V. Castelli, C.-S. Li, M.-L. Lo, and J. R. Smith. The Onion technique: Indexing for linear optimization queries. In Proceedings of ACM Management of Data (SIGMOD), pages 391--402, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. B. Chazelle. An optimal algorithm for intersecting three-dimensional convex polyhedra. SIAM Journal of Computing, 21(4):671--696, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. B. Chazelle, O. Devillers, F. Hurtado, M. Mora, V. Sacristan, and M. Teillaud. Splitting a delaunay triangulation in linear time. Algorithmica, 34(1):39--46, 2002.Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. B. Chazelle and L. J. Guibas. Fractional cascading: I. a data structuring technique. Algorithmica, 1(2):133--162, 1986.Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. B. Chazelle, L. J. Guibas, and D. T. Lee. The power of geometric duality. BIT Numerical Mathematics, 25(1):76--90, 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. D. P. Dobkin and S. Suri. Maintenance of geometric extrema. Journal of the ACM (JACM), 38(2):275--298, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter. External-memory computational geometry. In Proceedings of Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 714--723, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. R. L. Graham. An efficient algorithm for determining the convex hull of a finite planar set. Information Processing Letters (IPL), 1(4):132--133, 1972.Google ScholarGoogle Scholar
  23. V. Hristidis and Y. Papakonstantinou. Algorithms and applications for answering ranked queries using ranked views. The VLDB Journal, 13(1):49--70, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. D. G. Kirkpatrick. Optimal search in planar subdivisions. SIAM Journal of Computing, 12(1):28--35, 1983.Google ScholarGoogle ScholarCross RefCross Ref
  25. K. Mouratidis, M. Hadjieleftheriou, and D. Papadias. Conceptual partitioning: An efficient method for continuous nearest neighbor monitoring. In Proceedings of ACM Management of Data (SIGMOD), pages 634--645, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. S. Saltenis, C. S. Jensen, S. T. Leutenegger, and M. A. Lopez. Indexing the positions of continuously moving objects. In Proceedings of ACM Management of Data (SIGMOD), pages 331--342, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. 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
  28. N. Shivakumar and H. Garcia-Molina. Wave-indices: Indexing evolving databases. In Proceedings of ACM Management of Data (SIGMOD), pages 381--392, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. S. Sioutas, D. Sofotassios, K. Tsichlas, D. Sotiropoulos, and P. Vlamos. Canonical polygon queries on the plane: A new approach. Journal of Computers, 4(9):913--919, 2009.Google ScholarGoogle ScholarCross RefCross Ref
  30. 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
  31. O. Wolfson, L. Jiang, A. P. Sistla, S. Chamberlain, N. Rishe, and M. Deng. Databases for tracking mobile units in real time. In Proceedings of International Conference on Database Theory (ICDT), pages 169--186, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. FIFO indexes for decomposable problems

        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!