The input/output complexity of sorting and related problems
Communications of the ACM
A balanced search tree with O(1) worst case update time
Acta Informatica
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
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Practical minimal perfect hash functions for large databases
Communications of the ACM
Eliminating amortization: on data structures with guaranteed response time
Eliminating amortization: on data structures with guaranteed response time
Journal of the ACM (JACM)
A constant update time finger search tree
Information Processing Letters
The string B-tree: a new data structure for string search in external memory and its applications
Journal of the ACM (JACM)
Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
Advanced database indexing
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Performance of B+ tree concurrency control algorithms
The VLDB Journal — The International Journal on Very Large Data Bases
Dynamic Interpolation Search in o(log log n) Time
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
The Priority R-tree: a practically efficient and worst-case optimal R-tree
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
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
A New Method for Fast Data Searches with Keys
IEEE Software
Deletions That Preserve Randomness
IEEE Transactions on Software Engineering
MapReduce: simplified data processing on large clusters
Communications of the ACM - 50th anniversary issue: 1958 - 2008
ISB-tree: a new indexing scheme with efficient expected behaviour
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Hi-index | 0.00 |
We present NEFOS (NEsted FOrest of balanced treeS), a new cache-aware indexing scheme that supports insertions and deletions in O(1) worst-case block transfers for rebalancing operations (given and update position) and searching in O(logB log n) expected block transfers, (B= disk block size and n= number of stored elements). The expected search bound holds with high probability for any (unknown) realistic input distribution. Our expected search bound constitutes an improvement over the O(logB log n) expected bound for search achieved by the ISB-tree (Interpolation Search B-tree), since the latter holds with high probability for the class of smooth only input distributions. We define any unknown distribution as realistic if the smoothness doesn't appear in the whole data set, still it may appear locally in small spatial neighborhoods. This holds for a variety of real-life non-smooth distributions like skew, zipfian, powlaw, beta e.t.c.. The latter is also verified by an accompanying experimental study. Moreover, NEFOS is a B-parametrized concrete structure, which works for both I/O and RAM model, without any kind of transformation or adaptation. Also, it is the first time an expected sub-logarithmic bound for search operation was achieved for a broad family of non-smooth input distributions.