Orthogonal range reporting in three and higher dimensions

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2009, Pages 149-158

  Afshani, Peyman ^a   Arge, Lars ^a   Larsen, Kasper Dalgaard ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Computational geometry; Data structures; External memory; Orthogonal range searching

Indexed keywords

DIMENSIONAL SPACES; EXTERNAL MEMORY; FUNDAMENTAL PROBLEM; HIGHER DIMENSIONS; HIGHER-DIMENSIONAL; ORTHOGONAL RANGE SEARCHING; POINTER MACHINES; PREPROCESS; RANGE SEARCHING; SPATIAL DATABASE; THREE-DIMENSIONAL STRUCTURE;

COMPUTER SCIENCE; DATA STRUCTURES; FIBER OPTIC CHEMICAL SENSORS; THREE DIMENSIONAL;

COMPUTATIONAL GEOMETRY;

EID: 77952390547     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2009.58     Document Type: Conference Paper

References (29)

1. P. Afshani, "On dominance reporting in 3D," in ESA'08: Proc. of the 16th conference on Annual European Symposium, 2008, pp. 41-51.
2. P. K. Agarwal, "Range searching," in CRC Handbook of Discrete and Computational Geometry, J. E. Goodman and J. O'Rourke, Eds. CRC Press, Inc., 2004.
3. P. K. Agarwal and J. Erickson, "Geometric range searching and its relatives," in Advances in Discrete and Computational Geometry, B. Chazelle, J. E. Goodman, and R. Pollack, Eds. AMS Press, 1999.
4. A. Aggarwal and J. S. Vitter, "The input/output complexity of sorting and related problems," Commun. ACM, vol. 31, pp. 1116-1127, 1988.
5. S. Alstrup, G. S. Brodal, and T. Rauhe, "New data structures for orthogonal range searching," in FOCCS'00: Proc. of the 41st Annual Symposium on Foundations of Computer Science, 2000, pp. 198-207.
6. L. Arge, "External memory data structures," in Handbook of Massive Data Sets, J. Abello, P. M. Pardalos, and M. G. C. Resende, Eds. Kluwer Academic Publishers, 2002, pp. 313-358.
7. L. Arge, V. Samoladas, and J. S. Vitter, "On two-dimensional indexability and optimal range search indexing," in PODS '99: Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. New York, NY, USA: ACM, 1999, pp. 346-357.
8. L. Arge, V. Samoladas, and K. Yi, "Optimal external-memory planar point enclosure," in ESA '04: Proc. of the 12th conference on Annual European Symposium, 2004, pp. 40-52.
9. J. L. Bentley, "Multidimensional divide-and-conquer," Communications of the ACM, vol. 23, no. 4, pp. 214-229, 1980.
10. P. Bozanis, N. Kitsios, C. Makris, and A. Tsakalidis, "New results on intersection query problems," The Computer Journal, vol. 40, pp. 22-29, 1997.
11. B. Chazelle, "Filtering search: a new approach to query answering," SI AM Journal on Computing, vol. 15, no. 3, pp. 703-724, 1986.
12. -, "Functional approach to data structures and its use in multidimensional searching," SIAM Journal on Computing, vol. 17, no. 3, pp. 427-462, 1988.
13. -, "Lower bounds for orthogonal range searching: I. the reporting case," Journal of the ACM, vol. 37, no. 2, pp. 200-212, 1990. (Pubitemid 20696132)
14. -, "Lower bounds for orthogonal range searching: part II. the arithmetic model," Journal of the ACM, vol. 37, no. 3, pp. 439-463, 1990. (Pubitemid 20723064)
15. -, "Lower bounds for off-line range searching," in STOC '95: Proc. of the 27th annual ACM symposium on Theory of computing, 1995, pp. 733-740.
16. B. Chazelle and L. J. Guibas, "Fractional cascading: I. A data structuring technique," Algorithmica, vol. 1, pp. 133-162, 1986.
17. -, "Fractional cascading: II. Applications," Algorith-mica, vol. 1, pp. 163-191, 1986.
18. D. Comer, "The ubiquitous B-tree," ACM Computing Surveys, vol. 11, no. 2, pp. 121-137, 1979.
19. M. L. Fredman, "The inherent complexity of dynamic data structures which accommodate range queries," in FOCS '80: Proc. of the 21st Annual Symposium on Foundations of Computer Science, October 1980, pp. 191-199.
20. H. N. Gabow, J. L. Bentley, and R. E. Tarjan, "Scaling and related techniques for geometry problems," in STOC '84: Proc. of the 16th annual ACM symposium on Theory of computing, 1984, pp. 135-143.
21. V. Gaede and O. Günther, "Multidimensional access methods," ACM Computing Surveys, vol. 30, no. 2, pp. 170-231, 1998.
22. P. Gupta, R. Janardan, and M. Smid, "Computational geometry: generalized intersection searching," in Handbook of Data Structures and Applications. Chapman & Hall/CRC, 2005, ch. 64, pp. 1-17.
23. J. M. Hellerstein, E. Koutsoupias, D. P. Miranker, C. H. Papadimitriou, and V. Samoladas, "On a model of indexability and its bounds for range queries," Journal of the ACM, vol. 49, no. 1, pp. 35-55, 2002.
24. E. M. McCreight, "Priority search trees," SIAM Journal on Computing, vol. 14, no. 2, pp. 257-276, 1985.
25. Y. Nekrich, "A data structure for multi-dimensional range reporting," in SCG '07: Proc. of the 23rd Annual Symposium on Computational Geometry. ACM, 2007, pp. 344-353.
26. M. Pǎtraşcu, "Unifying the landscape of cell-probe lower bounds," in FOCS '08: Proc. of the 49th Annual Symposium on Foundations of Computer Science, 2008, pp. 434-443.
27. S. Subramanian and S. Ramaswamy, "The P-range tree: a new data structure for range searching in secondary memory," in SODA '95: Proc. of the 6th Annual Symposium on Discrete Algorithms, 1995, pp. 378-387.
28. R. E. Tarjan, "A class of algorithms that require nonlinear time to maintain disjoint sets," Journal of Computer and System Sciences, vol. 18, pp. 110-127, 1979.
29. D. E. Vengroff and J. S. Vitter, "Efficient 3-D range searching in external memory," in STOC '96: Proc. of the 28th annual ACM symposium on Theory of computing, 1996, pp. 192-201.