Yep, what I'm implementing is similar to a B+ trie, but is actually a redundant and recursive DAWG giving absolute indexing of all data sources. Since I'm indexing XML the relations are File <-> Node <-> Value <-> File based. The problem isn't the structures or the schema (its fast, real fast), its the actual disk utilization LOL

Guess I could change all of the existing packed record structures to objects and tie them to a Stream, but that seems a bit of a mess. I'd rather just read headers and utilize offsets.

Then again, for another project I'd love to find a B+ implementation written in Pascal

- Jeremy