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 C.sub.0-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 C.sub.0-trie. Insertion and deletion processes maintain the representation of the C.sub.0-trie remains in a well-formed and taut state at the end of each operation, thus providing subsequent efficient manipulations of the C.sub.0-trie in computer memory.

 
Web www.patentalert.com

< System and method for supporting editorial opinion in the ranking of search results

< Virus checking and reporting for computer database search results

> Search refinement graphical user interface

> Method and apparatus for optimizing a data access customer service system

~ 00284