Variable Length Index Keys

Traditional database systems allocate their indexes in fixed blocks, and so do we; but we were faced with a problem. Typical English language contains words of extremely variant length, and we wanted to minimize the overhead of storing these words in an index. Traditional Btrees have fixed length keys, so we invented a variable length key Btree in order to minimize our overhead while not limiting the maximum length of a key.