Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep

[1]  Douglas Comer,et al.  Ubiquitous B-Tree , 1979, CSUR.

[2]  Abraham Silberschatz,et al.  Operating System Concepts , 1983 .

[3]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[4]  Alok Aggarwal,et al.  The input/output complexity of sorting and related problems , 1988, CACM.

[5]  Jon Louis Bentley,et al.  Experiments on traveling salesman heuristics , 1990, SODA '90.

[6]  Jon Louis Bentley,et al.  K-d trees for semidynamic point sets , 1990, SCG '90.

[7]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[8]  Claire Mathieu,et al.  The Maximum Size of Dynamic Data Structures , 1991, SIAM J. Comput..

[9]  Jon Jouis Bentley,et al.  Fast Algorithms for Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..

[10]  Jeffrey Scott Vitter,et al.  Deterministic distribution sort in shared and distributed memory multiprocessors , 1993, SPAA '93.

[11]  Thomas H. Cormen,et al.  Asymptotically tight bounds for performing BMMC permutations on parallel disk systems , 1993, SPAA '93.

[12]  Thomas H. Cormen,et al.  Virtual memory for data-parallel computing , 1993 .

[13]  Thomas H. Cormen.  Fast Permuting on Disk Arrays , 1993, J. Parallel Distributed Comput..

[14]  Jyh-Jong Tsay,et al.  External-memory computational geometry , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[15]  Jeffrey Scott Vitter,et al.  Paradigms for optimal sorting with multiple disks , 1993, [1993] Proceedings of the Twenty-sixth Hawaii International Conference on System Sciences.

[16]  Jeffrey Scott Vitter,et al.  Blocking for external graph searching , 1992, Algorithmica.

[17]  Alberto Marchetti-Spaccamela,et al.  Memory Paging for Connectivity and Path Problems in Graphs , 1993, J. Graph Algorithms Appl..

[18]  Lars Arge,et al.  A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms , 1992, WADS.

[19]  Greg N. Frederickson,et al.  A data structure for dynamically maintaining rooted trees , 1997, SODA '93.

[20]  Sridhar Ramaswamy,et al.  Path Caching: A Technique for Optimal External Searching , 1994, PODS 1994.

[21]  John Wilkes,et al.  An introduction to disk drive modeling , 1994, Computer.

[22]  Lalit M. Patnaik,et al.  Genetic algorithms: a survey , 1994, Computer.

[23]  Binhai Zhu,et al.  Further Computational Geometry in Secondary Memory , 1994, ISAAC.

[24]  Erik D Vengroff,et al.  I/O Efficient Scientific Computation Using TPIE , 1995 .

[25]  Edward F. Grove,et al.  External-memory graph algorithms , 1995, SODA '95.

[26]  Lars Arge,et al.  The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract) , 1995, WADS.

[27]  Michael T. Goodrich,et al.  Topology B-Trees and Their Applications , 1995, WADS.

[28]  Sridhar Ramaswamy,et al.  OODB indexing by class-division , 1995, SIGMOD '95.

[29]  Sridhar Ramaswamy,et al.  The P-range tree: a new data structure for range searching in secondary memory , 1995, SODA '95.

[30]  Lars Arge,et al.  The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation , 1995, ISAAC.

[31]  Sridhar Ramaswamy,et al.  Indexing for Data Models with Constraints and Classes , 1996, J. Comput. Syst. Sci..

[32]  Jeffrey Scott Vitter,et al.  External-Memory Algorithms for Processing Line Segments in Geographic Information Systems , 1996 .

[33]  Peter Buneman,et al.  Semistructured data , 1997, PODS.