Unbalanced multiway trees improved by partial expansions
- 1 May 1992
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 29 (5) , 443-460
- https://doi.org/10.1007/bf01193577
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A dynamic storage allocation algorithm suitable for file structuresInformation Systems, 1990
- Performance of B/sup +/-trees with partial expansionsIEEE Transactions on Knowledge and Data Engineering, 1989
- Transforming Unbalanced Multiway trees into a practical external data structureActa Informatica, 1988
- Partial expansions for file organizations with an indexACM Transactions on Database Systems, 1987
- The analysis of a fringe heuristic for binary search treesJournal of Algorithms, 1985
- Performance analysis of linear hashing with partial expansionsACM Transactions on Database Systems, 1982
- The theory of fringe analysis and its application to 23 trees and b-treesInformation and Control, 1982
- On random 2?3 treesActa Informatica, 1978
- Organization and maintenance of large ordered indexesActa Informatica, 1972