Efficient Radix Partitioned Tree with Integrated Text Index Mechanism
Original Publication Date: 1980-Jul-01
Included in the Prior Art Database: 2005-Feb-13
An index can be envisioned as an ordered set of entries, each entry consisting of a string of text bytes. Described here is a compact data structure which contains index information in a radix partitioned tree (RPT) form. This form can be efficiently searched in a paged storage computer system. High level index functions such as FIND, INSERT, REMBLE, or FIND ADJACENT can be supported.