Optimal external memory interval management

SIAM Journal on Computing

Volumn 32, Issue 6, 2003, Pages 1488-1508

  Arge, Lars ^a   Vitter, Jeffrey Scott ^b  

^a Duke University   (United States)

^b Purdue University   (United States)

Author keywords

Data structures; I O efficient; Interval management; Stabbing queries

Indexed keywords

I/O EFFICIENT; INTERVAL MANAGEMENT; STABBING QUERIES;

ALGORITHMS; DATA STRUCTURES; DATABASE SYSTEMS; GEOGRAPHIC INFORMATION SYSTEMS; LOGIC PROGRAMMING; OBJECT ORIENTED PROGRAMMING; STORAGE ALLOCATION (COMPUTER); TREES (MATHEMATICS);

OPTIMAL SYSTEMS;

EID: 0942288264     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753970240481X     Document Type: Article

References (43)

1. 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 Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, 1999, pp. 11-20.
2. P. K. AGARWAL, L. ARGE, AND J. ERICKSON, Indexing moving points, J. of Comput. System Sci., 66 (2003), pp. 207-243.
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., Contemp. Math. 223, AMS, Providence, RI, 1999, pp. 1-56.
4. A. AGGARWAL AND J. S. VITTER, The input/output complexity of sorting and related problems, Comm. ACM, 31 (1988), pp. 1116-1127.
5. L. ARGE, External memory data structures (invited paper), in Proceedings of the 9th Annual European Symposium on Algorithms, Aarhus, Denmark, 2001, Lecture Notes in Comput. Sci. 2161, Springer-Verlag, Berlin. 2001, pp. 1-29.
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, Dordrecht, The Netherlands, 2002, pp. 313-358.
7. L. ARGE, The buffer tree: A technique for designing batched external data structures, Algorithmica, 37 (2003), pp. 1-24.
8. L. ARGE, V. SAMOLADAS, AND J. S. VITTER, On two-dimensional indexability and optimal range search indexing, in Proceedings of the 18th ACM Symposium on Principles of Database Systems, Philadelphia, PA, 1999, pp. 346-357.
9. L. ARGE AND J. VAHRENHOLD, I/O-efficient dynamic planar point location, Internat. J. Comput. Geom. Appl., to appear.
10. L. ARGE, D. E. VENGROFF, AND J. S. VITTER, External-memory algorithms for processing line segments in geographic information systems, Algorithmica, to appear.
11. L. ARGE AND J. S. VITTER, Optimal dynamic interval management in external memory, in Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, Burlington, VT, 1996, pp. 560-569.
12. R. BAYER AND E. McCREIGHT, Organization and maintenance of large ordered indexes, Acta Informat., 1 (1972), pp. 173-189.
13. M. A. BENDER, E. D. DEMAINE, AND M. FARACH-COLTON, Cache-oblivious B-trees, in Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, Redondo Beach, CA, 2000, pp. 339-409.
14. G. BLANKENAGEL, Intervall-Indexstructuren in Datenbanksystemen, Informatik-Farberichte 312, Springer-Verlag, Berlin, 1992.
15. G. BLANKENAGEL AND R. GÜTING, External segment trees, Algorithmica, 12 (1994), pp. 498-532.
16. G. BLANKENAGEL AND R. H. GÜTING, XP-Trees - External Priority Search Trees, Technical report, Fern Universität Hagen, Informatik-Bericht 92, Hagen, Germany, 1990.
17. N. BLUM AND K. MEHLHORN, On the average number of rebalancing operations in weight-balanced trees, Theoret. Comput. Sci., 11 (1980), pp. 303-320.
18. Y.-J. CHIANG AND C. T. SILVA, I/O optimal isosurface extraction, in Proceedings of IEEE Visualization, Phoenix, AZ, 1997, pp. 293-300.
19. Y.-J. CHIANG AND C. T. SILVA, External memory techniques for isosurface extraction in scientific visualization, in External Memory Algorithms and Visualization, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 50, J. Abello and J. S. Vitter, eds., AMS, Providence, RI, 1999, pp. 247-277.
20. Y.-J. CHIANG, C. T. SILVA, AND W. J. SCHROEDER, Interactive out-of-core isosurface extraction, in Proceedings of IEEE Visualization, Research Triangle Park, NC, 1998, pp. 167-174.
21. D. COMER, The ubiquitous B-tree, ACM Computing Surveys, 11 (1979), pp. 121-137.
22. H. EDELSBRUNNER, A new approach to rectangle intersections, part I, Internat. J. Comput. Math., 13 (1983), pp. 209-219.
23. H. EDELSBRUNNER, A new approach to rectangle intersections, part II, Internat. J. Comput. Math., 13 (1983), pp. 221-229.
24. V. GAEDE AND O. GÜNTHER, Multidimensional access methods, ACM Computing Surveys, 30 (1998), pp. 170-231.
25. R. GROSSI AND G. F. ITALIANO, Efficient cross-tree for external memory, in External Memory Algorithms and Visualization, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 50, J. Abello and J. S. Vitter, eds., AMS, Providence, RI, 1999, pp. 87-106. Revised version available at ftp://ftp.di.unipi.it/pub/techreports/TR-00-16.ps.Z.
26. R. GROSSI AND G. F. ITALIANO. Efficient splitting and merging algorithms for order decomposable problems, Inform, and Comput., 154 (1999), pp. 1-33.
27. S. HUDDLESTON AND K. MEHLHORN, A new data structure for representing sorted lists, Acta Inform., 17 (1982), pp. 157-184.
28. C. ICKING, R. KLEIN, AND T. OTTMANN, Priority search trees in secondary memory, in Proceedings of Graph-Theoretic Concepts in Computer Science, Staffelstein, Germany, 1987, Lecture Notes in Comput. Sci. 314. Springer-Verlag, Berlin, 1988, pp. 84-93.
29. P. C. KANELLAKIS, G. KUPER, AND P. REVESZ, Constraint query languages, in Proceedings of the 9th ACM Symposium on Principles of Database Systems, Nashville, TN, 1990, pp. 299-313.
30. P. C. KANELLAKIS, S. RAMASWAMY, D. E. VENGROFF, AND J. S. VITTER, Indexing for data models with constraints and classes, J. Comput. System Sci., 52 (1996), pp. 589-612.
31. D. E. KNUTH, Sorting and Searching, Volume 3 of The Art of Computer Programming, 2nd ed., Addison-Wesley, Reading, MA, 1998.
32. E. M. McCREIGHT, Priority search trees, SIAM J. Comput., 14 (1985), pp. 257-276.
33. K. MEHLHORN, Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin, 1984.
34. J. NIEVERGELT AND E. M. REINGOLD, Binary search trees of bounded balance, SIAM J. Comput., 2 (1973), pp. 33-43.
35. J. NIEVERGELT AND P. WIDMAYER, Spatial data structures: Concepts and design choices, in Algorithmic Foundations of GIS, Lecture Notes in Comput. Sci. 1340, M. van Kreveld, J. Nievergelt, T. Roos, and P. Widmayer, eds., Springer-Verlag, Berlin, 1997, pp. 153-197.
36. M. H. OVERMARS, The Design of Dynamic Data Structures, Lecture Notes in Comput. Sci. 156, Springer-Verlag, Berlin, 1983.
37. S. RAMASWAMY, Efficient indexing for constraint and temporal databases, in Proceedings of the 6th International Conference on Database Theory, Delphi, Greece, 1997, Lecture Notes in Comput. Sci. 1186, Springer-Verlag, Berlin, 1997, pp. 419-431.
38. S. RAMASWAMY AND P. KANELLAKIS, OODB Indexing by Class Division, A.P.I.C. Series, Academic Press, New York, 1995.
39. S. RAMASWAMY AND S. SUBRAMANIAN, Path caching: A technique for optimal external searching, in Proceedings of the 13th ACM Symposium on Principles of Database Systems, Minneapolis, MN, 1994, pp. 25-35.
40. S. SUBRAMANIAN AND S. RAMASWAMY, The P-range tree: A new data structure for range searching in secondary memory, in Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 1995, pp. 378-387.
41. J. S. VITTER, External memory algorithms and data structures: Dealing with MASSIVE data, ACM Computing Surveys, 33 (2001), pp. 209-271.
42. D. WILLARD AND G. LUEKER, Adding range restriction capability to dynamic data structures, J. Assoc, Comput. Mach., 32 (1985), pp. 597-617.
43. D. E. WILLARD, Reduced memory space for multi-dimensional search trees, in Proceedings of the 2nd Symposium on Theoretical Aspects of Computer Science, Saarbrüken, Germany, Lecture Notes in Comput. Sci. 182, Springer-Verlag, Berlin, 1985, pp. 363-374.