STORAGE AND RETRIEVAL OF ORDERED SETS OF KEYS IN A COMPACT 0-COMPLETE TREE

摘要

A computer storage system and processing method for indexing and accessing data stored in the computer storage system, comprising a compact multi-way search tree structure. 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. A buffer consisting of a sorted list of key values can be directly transformed into a representation of a C0-tree.