Database Design
Sorting and Searching Using Controlled Density Arrays
Sorting and Searching Using Controlled Density Arrays
Two algorithms for maintaining order in a list
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Compact deterministic distributed dictionaries (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Journal of the ACM (JACM)
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A locality-preserving cache-oblivious dynamic dictionary
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Two Simplified Algorithms for Maintaining Order in a List
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
A locality-preserving cache-oblivious dynamic dictionary
Journal of Algorithms
An in-place sorting with O(nlog n) comparisons and O(n) moves
Journal of the ACM (JACM)
An adaptive packed-memory array
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
An adaptive packed-memory array
ACM Transactions on Database Systems (TODS)
Brief announcement: new bounds for the controller problem
Proceedings of the 28th ACM symposium on Principles of distributed computing
New bounds for the controller problem
DISC'09 Proceedings of the 23rd international conference on Distributed computing
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Optimal in-place sorting of vectors and records
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Reallocation problems in scheduling
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |
In this article, we study an alternate approach that shifts the records among adjacent pages rather than using overflow pointers when space is needed for inserting a record in a sequential file. We show how to use this method to achieve a worst-case record insertion-deletion complexity of O[(log2N)/(D-d)] page-accesses, in (d-D)-dense files.