And method of dynamic storage structure of the 0-complete tree compact computer available for processing the stored data

摘要

A method and apparatus for storage, insertion, deletion, and searching of a database index using a compact representation of a 0-complete binary tree. The compact representation, termed a CSUB0/SUB-trie, is represented in a computer memory as a set of layered vectors with the layering of the vectors corresponding to the depths of the CSUB0/SUB-trie. Insertion and deletion processes maintain the representation of the CSUB0/SUB-trie remains in a well-formed and taut state at the end of each operation, thus providing subsequent efficient manipulations of the CSUB0/SUB-trie in computer memory.