Compact 0-Complete Trees

In this paper, a novel am 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 lof is presented.

[1]  John L. Pfaltz,et al.  Compact O-Complete Trees: A New Method for Searching Large Files , 1988 .

[2]  Reind P. van de Riet,et al.  Two Access Methods Using Compact Binary Trees , 1987, IEEE Transactions on Software Engineering.

[3]  Witold Litwin,et al.  Linear Hashing: A new Algorithm for Files and Tables Addressing , 1980, ICOD.

[4]  Per-Åke Larson,et al.  Linear Hashing with Partial Expansions , 1980, VLDB.

[5]  Rudolf Bayer,et al.  Prefix B-trees , 1977, TODS.

[6]  Witold Litwin,et al.  A New Method for Fast Data Searches with Keys , 1987, IEEE Software.

[7]  Douglas Comer,et al.  Ubiquitous B-Tree , 1979, CSUR.

[8]  David B. Lomet,et al.  Digital B-Trees , 1981, VLDB.

[9]  Ronald Fagin,et al.  Extendible hashing—a fast access method for dynamic files , 1979, ACM Trans. Database Syst..

[10]  Witold Litwin,et al.  Trie hashing , 1981, SIGMOD '81.