The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
Journal of the ACM (JACM)
Upper Bounds for the Total Path Length of Binary Trees
Journal of the ACM (JACM)
Communications of the ACM
Use of tree structures for processing files
Communications of the ACM
Communications of the ACM
A balanced tree storage and retrieval algorithm
SIGIR '71 Proceedings of the 1971 international ACM SIGIR conference on Information storage and retrieval
Binary search trees of bounded balance
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Information retrieval: information storage and retrieval using AVL trees
ACM '65 Proceedings of the 1965 20th national conference
A graduate course in database management
ACM SIGMOD Record
Binary search tree complex: towards the implementation of relations
VLDB '75 Proceedings of the 1st International Conference on Very Large Data Bases
Bibliography on data base structures
ACM SIGMIS Database
| Hi-index | 0.00 |
Binary search trees are an important technique for organizing large files, because they are efficient for both random and sequential access of records, and for modification of a file. Because of this, they have received a great deal of attention in recent years, and their properties are now better understood than those of most other file organization methods. This paper surveys the main results which have been obtained.