Adding range restriction capability to dynamic data structures
Journal of the ACM (JACM)
Filtering search: a new approach to query answering
SIAM Journal on Computing
Expected behaviour of B+-trees under random insertions
Acta Informatica
Lower bounds for orthogonal range searching: I. The reporting case
Journal of the ACM (JACM)
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
The hB-tree: a multiattribute indexing method with good guaranteed performance
ACM Transactions on Database Systems (TODS)
Efficient memory access in large-scale computation (invited paper)
STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
Information retrieval: data structures and algorithms
Information retrieval: data structures and algorithms
CIKM '93 Proceedings of the second international conference on Information and knowledge management
RAID: high-performance, reliable secondary storage
ACM Computing Surveys (CSUR)
Path caching (extended abstract): a technique for optimal external searching
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Indexing for data models with constraints and classes
Journal of Computer and System Sciences
Efficient 3-D range searching in external memory
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Strategic directions in storage I/O issues in large-scale computing
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
On the analysis of indexing schemes
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A lower bound theorem for indexing schemes and its application to multidimensional range queries
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Tight bounds for 2-dimensional indexing schemes
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient searching with linear constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
An analytic behavior model for disk drives with readahead caches and request reordering
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Multidimensional access methods
ACM Computing Surveys (CSUR)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
On two-dimensional indexability and optimal range search indexing
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The P-range tree: a new data structure for range searching in secondary memory
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
I/O-efficient dynamic point location in monotone planar subdivisions
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
I/O-efficient algorithms for contour-line extraction and planar graph blocking
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
External memory algorithms and data structures
External memory algorithms
Efficient cross-trees for external memory
External memory algorithms
External memory techniques for isosurface extraction in scientific visualization
External memory algorithms
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Multidimensional divide-and-conquer
Communications of the ACM
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
An Efficient Multiversion Access Structure
IEEE Transactions on Knowledge and Data Engineering
Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations
EDBT '98 Proceedings of the 6th International Conference on Extending Database Technology: Advances in Database Technology
An Implementation and Performance Analysis of Spatial Data Access Methods
Proceedings of the Fifth International Conference on Data Engineering
Optimal Dynamic Range Searching in Non-replicating Index Structures
ICDT '99 Proceedings of the 7th International Conference on Database Theory
A Generic Approach to Bulk Loading Multidimensional Index Structures
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Worst-Case External-Memory Priority Queues
SWAT '98 Proceedings of the 6th Scandinavian Workshop on Algorithm Theory
The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract)
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Topology B-Trees and Their Applications
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Hilbert R-tree: An Improved R-tree using Fractals
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Efficient Splitting and Merging Algorithms for Order Decomposable Problems (Extended Abstract)
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Spatial Data Structures: Concepts and Design Choices
Algorithmic Foundations of Geographic Information Systems, this book originated from the CISM Advanced School on the Algorithmic Foundations of Geographic Information Systems
The hB $^\Pi$-tree: a multi-attribute index supporting concurrency, recovery and node consolidation
The VLDB Journal — The International Journal on Very Large Data Bases
Concurrency and recovery for index trees
The VLDB Journal — The International Journal on Very Large Data Bases
An asymptotically optimal multiversion B-tree
The VLDB Journal — The International Journal on Very Large Data Bases
Optimal dynamic interval management in external memory
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Linear hashing: a new tool for file and table addressing
VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6
Analysis of Extendible Hashing
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
The data sets for many of today's computer applications are too large to fit within the computer's internal memory and must instead be stored on external storage devices such as disks. A major performance bottleneck can be the input/output communication (or I/O) between the external and internal memories. In this paper we discuss a variety of on-line data structures for external memory--some very old and some very new--such as hashing (for dictionaries), B-trees (for dictionaries and 1-D range search), buffer trees (for batched dynamic problems), interval trees with weight-balanced B-trees (for stabbing queries), priority search trees (for 3-sided 2-D range search), and R-trees and other spatial structures. We also discuss several open problems along the way.