Use of tree structures for processing files
Communications of the ACM
Information retrieval: information storage and retrieval using AVL trees
ACM '65 Proceedings of the 1965 20th national conference
DaWaK '09 Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery
Binary B-trees for virtual memory
SIGFIDET '71 Proceedings of the 1971 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control
PLP: page latch-free shared-everything OLTP
Proceedings of the VLDB Endowment
Scalable architecture for allocation of idle CPUs in a p2p network
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
CLUR-Tree for supporting frequent updates of data stream over sensor networks
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Cache craftiness for fast multicore key-value storage
Proceedings of the 7th ACM european conference on Computer Systems
Foundations and Trends in Databases
Implementing the universal virtual computer
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
Compression of RDF dictionaries
Proceedings of the 27th Annual ACM Symposium on Applied Computing
ACM Transactions on Database Systems (TODS)
A new double sorting-based node splitting algorithm for R-tree
Programming and Computing Software
Querying RDF dictionaries in compressed space
ACM SIGAPP Applied Computing Review
A positional access method for relational databases
Proceedings of the 21st ACM international conference on Information and knowledge management
Scalable and dynamically balanced shared-everything OLTP with physiological partitioning
The VLDB Journal — The International Journal on Very Large Data Bases
How to exploit the device diversity and database interaction to propose a generic cost model?
Proceedings of the 17th International Database Engineering & Applications Symposium
A contention-friendly binary search tree
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
Bibliography on data base structures
ACM SIGMIS Database
Eliminating unscalable communication in transaction processing
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
Organization and maintenance of an index for a dynamic random access file is considered. It is assumed that the index must be kept on some pseudo random access backup store like a disc or a drum. The index organization described allows retrieval, insertion, and deletion of keys in time proportional to logk I where I is the size of the index and k is a device dependent natural number such that the performance of the scheme becomes near optimal. Storage utilization is at least 50% but generally much higher. The pages of the index are organized in a special data-structure, so-called B-trees. The scheme is analyzed, performance bounds are obtained, and a near optimal k is computed. Experiments have been performed with indices up to 100,000 keys. An index of size 15,000 (100,000) can be maintained with an average of 9 (at least 4) transactions per second on an IBM 360/44 with a 2311 disc.