Compact 0-complete Trees
Auteur : Ratko Orlandic
Date de publication : 1988
Éditeur : Institute for Parallel Computation, School of Engineering and Applied Science, University of Virginia
Nombre de pages : 47
Résumé du livre
Abstract: "In this report, a novel approach to ordered retrieval in very large files is developed. The method employs a B-tree like search algorithm that is independent of key type or key length because all keys in index blocks are encoded by a 1 byte surrogate. The replacement of actual key sequences by the 1 byte surrogate ensures a maximal possible fan out and greately [i.e. greatly] reduces the storage overhead of maintaining access indices. Initially, retrieval in binary trie structure is developed. With the aid of a fairly complex recurrence relation, the rather scraggly binary trie is transformed into compact multi-way search tree