Compact O-Complete Trees: A New Method for Searching Large Files

Report
Authors:Orlandic, Ratko, Institute for Parallel ComputationUniversity of Virginia Pfaltz, John, Institute for Parallel ComputationUniversity of Virginia
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 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. Then implementation details and empirical performance results are presented. Reduction of index size by 50%-75% opens up the possibility of replicating system-wide indices for parallel access in distributed databases.

Rights:
All rights reserved (no additional license for public reuse)
Language:
English
Source Citation:

Orlandic, Ratko, and John Pfaltz. "Compact O-Complete Trees: A New Method for Searching Large Files." University of Virginia Institute for Parallel Computation Tech Report (1988).

Publisher:
University of Virginia, Institute for Parallel Computation
Published Date:
1988