|
|
|
@inproceedings{DBLP:conf/vldb/OrlandicP88,
author = {Ratko Orlandic and
John L. Pfaltz},
editor = {Fran\c{c}ois Bancilhon and
David J. DeWitt},
title = {Compact 0-Complete Trees},
booktitle = {Fourteenth International Conference on Very Large Data Bases,
August 29 - September 1, 1988, Los Angeles, California, USA,
Proceedings},
publisher = {Morgan Kaufmann},
year = {1988},
isbn = {0-934613-75-3},
pages = {372-381},
ee = {db/conf/vldb/OrlandicP88.html},
crossref = {DBLP:conf/vldb/88},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
In this paper, 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 log2M bit surrogate, where M is the maximal key length. For example, keys of length less than 32 bytes can be represented by a single byte in the index. This ensures a maximal possible fan out and greatly reduces the storage overhead of maintaining access indices.
Initially, retrieval in a binary trie structure is developed. With the aid of a fairly complex recurrence relation, the rather scraggly binary trie is transformed into a compact multi-way search tree. Then the recurrence relation itself is replaced by an unusually simple search algorithm. Finally, a specific access scheme, appropriate for secondary indexing, is presented.
Copyright © 1988 by the VLDB Endowment. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by the permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and/or special permission from the Endowment.
