I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries-Reference-Cited by-同舟云学术

I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries

Published:2003 Issue: Volume: Page:7-18
ISSN:0302-9743
Container-title:Algorithms - ESA 2003
language:
Short-container-title:

Author:

Agarwal Pankaj K.,Arge Lars,Yang Jun,Yi Ke

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-39658-1_4

Reference20 articles.

1. Agarwal, P.K., Arge, L., Brodal, G.S., Vitter, J.S.: I/O-efficient dynamic point location in monotone planar subdivisions. In: Proc. ACM-SIAM Symp. on Discrete Algorithms, pp. 1116–1127 (1999)

2. Agarwal, P.K., Arge, L., Govindarajan, S.: CRB-tree: An optimal indexing scheme for 2D aggregate queries. In: Proc. Intl. Conf. on Database Theory (2003)

3. Agarwal, P.K., Erickson, J.: Geometric range searching and its relatives. In: Chazelle, B., Goodman, J., Pollack, R. (eds.) Advances in Discrete and Computational Geometry, pp. 1–56. American Mathematical Society, Providence (1999)

4. Aggarwal, A., Vitter, J.S.: The Input/Output complexity of sorting and related problems. Comm. ACM 31(9), 1116–1127 (1988)

5. Arge, L.: External memory data structures. In: Handbook of Massive Data Sets, pp. 313–358. Kluwer Academic Publishers, Dordrecht (2002)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ3;Mathematics of Operations Research;2020-02

2. On Top-k Range Reporting in 2D Space;Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2015-05-20

3. Efficient Top-k Queries for Orthogonal Ranges;WALCOM: Algorithms and Computation;2011

4. Range-Aggregate Queries Involving Geometric Aggregation Operations;WALCOM: Algorithms and Computation;2011

5. A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time;Algorithms and Computation;2011