External memory range reporting on a grid

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4835 LNCS, Issue , 2007, Pages 525-535

  Nekrich, Yakov ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DATA STORAGE EQUIPMENT; DATA STRUCTURES; QUERY PROCESSING;

EXTERNAL MEMORY DATA; QUERY TIME; RANGE REPORTING QUERIES;

GRID COMPUTING;

EID: 38149051284     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77120-3_46     Document Type: Conference Paper

References (23)

1. Aggarwal, A., Vitter, J.S.: The Input/Output Complexity of Sorting and Related Problems. Communications of the ACM 31(9), 1116-1127 (1988)
2. Alstrup, S., Brodal, G.S., Rauhe, T.: New Data Structures for Orthogonal Range Searching. In: Proc. FOCS, pp. 198-207 (2000)
3. Amir, A., Efrat, A., Indyk, P., Samet, H.: Efficient Regular Data Structures and Algorithms for Dilation, Location, and Proximity Problems. Algorithmica 30(2), 164-187 (2001)
4. Andersson, A.: Faster Deterministic Sorting and Searching in Linear Space. In: Proc. FOCS, pp. 135-141 (1996)
5. Arge, L.: External Memory Data Structures. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 1-29. Springer, Heidelberg (2001)
6. Arge, L., Samoladas, V., Vitter, J.S.: On Two-Dimensional Indexability and Optimal Range Search Indexing. In: Proc. PODS, pp. 346-357 (1999)
7. Beame, P., Fich, F.E.: Optimal Bounds for the Predecessor Problem and Related Problems. J. Comput. Syst. Sci. 65, 38-72 (2002)
8. de Berg, M., van Kreveld, M.J., Snoeyink, J.: Two- and Three-Dimensional Point Location in Rectangular Subdivisions. J. Algorithms 18(2), 256-277 (1995)
9. Chan, T.M.: Point Location in o(log n) Time, Voronoi Diagrams in o(n log n) Time, and Other Transdichotomous Results in Computational Geometry. In: Proc. FOCS, pp. 333-344 (2006)
10. Chazelle, B.: A Functional Approach to Data Structures and its Use in Multidimensional Searching. SIAM J. on Computing 17, 427-462 (1988)
11. van Emde Boas, P., Kaas, R., Zijlstra, E.: Design and Implementation of an Efficient Priority Queue. Mathematical Systems Theory 10, 99-127 (1977)
12. Fries, O., Mehlhorn, K., Näher, S., Tsakalidis, A.K.: A log log n Data Structure for Three-Sided Range Queries. Information Processing Letters 25(4), 269-273 (1987)
13. Grossi, R., Italiano, G.F.: Efficient Splitting and Merging Algorithms for Order Decomposable Problems. Information and Computation 154, 1-33 (1999)
14. Icking, C., Klein, R., Ottmann, T.: Priority Search Trees in Secondary Memory (Extended Abstract). In: Göttler, H., Schneider, H.-J. (eds.) WG 1987. LNCS, vol. 314, pp. 84-93. Springer, Heidelberg (1988)
15. Miltersen, P.B., Nisan, N., Safra, S., Wigderson, A.: On Data Structures and Asymmetric Communication Complexity. J. Comput. Syst. Sci. 57, 37-49 (1998)
16. Nekrich, Y.: A Data Structure for Multi-Dimensional Range Reporting. In: Proc. SoCG 2007, pp. 344-353 (2007)
17. Overmars, M.H.: Efficient Data Structures for Range Searching on a Grid. J. Algorithms 9(2), 254-275 (1988)
18. Pǎtraşcu, M.: Planar Point Location in Sublogarithmic Time. In: Proc. FOCS, pp. 325-332 (2006)
19. Pǎtraşcu, M., Thorup, M.: Time-space Trade-offs for Predecessor Search. In: Proc. STOC, pp. 232-240 (2006)
20. Ramaswamy, S., Subramanian, S.: Path Caching: A Technique for Optimal External Searching. In: Proc. PODS, pp. 25-35 (1994)
21. Subramanian, S., Ramaswamy, S.: The P-range Tree: A New Data Structure for Range Searching in Secondary Memory. In: Proc. SODA, pp. 378-387 (1995)
22. Vitter, J.S.: External Memory Algorithms and Data Structures: Dealing with Massive Data. ACM Computing Surveys 33(2), 209-271 (2001)
23. Willard, D.E.: New Trie Data Structures Which Support Very Fast Search Operations. Journal of Computer and System Sciences 28(3), 379-394 (1984)