The input/output complexity of sorting and related problems
Communications of the ACM
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
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
On showing lower bounds for external-memory computational geometry problems
External memory algorithms
ACM Computing Surveys (CSUR)
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
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
A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
The randomized complexity of maintaining the minimum
Nordic Journal of Computing
On indexing large databases for advanced data models
On indexing large databases for advanced data models
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Cache-oblivious streaming B-trees
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Dynamic external hashing: the limit of buffering
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
The limits of buffering: a tight lower bound for dynamic membership in the external memory model
Proceedings of the forty-second ACM symposium on Theory of computing
On the cell probe complexity of dynamic membership
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Cache-oblivious dynamic dictionaries with update/query tradeoffs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Using hashing to solve the dictionary problem
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Dynamic Indexability and the Optimality of B-Trees
Journal of the ACM (JACM)
The TokuFS streaming file system
HotStorage'12 Proceedings of the 4th USENIX conference on Hot Topics in Storage and File Systems
| Hi-index | 0.00 |
We study trade-offs between the update time and the query time for comparison based external memory dictionaries. The main contributions of this paper are two lower bound trade offs between the I/O complexity of member queries and insertions: If N N/B I/Os, then (1) there exists a query requiring N/(M. ·~O(δ)) I/Os, and (2) there exists a query requiring Ω(logδlog2N ~ I/Os when δ is O(B/log3 N) and N is at least M2. For both lower bound we describe data structures which give matching upper bounds for a wide range of parameters, thereby showing the lower bounds to be tight within these ranges.