> Xindice has its own B-Tree files for data storage and search. Could we > consider leveraging existing RDBM systems? RDBM has been developed and
> fine > tuned for so many years, and they have solved many issues that we are > going > to tackle (performance, transaction, and security). It doesn't seem like the OR-DBM system is a very good solution to semi-structured data (something which I'm trying to benchmark with LORE, Xindice & a commercial DBMS.) With all of the OR-DBM systems providing fairly efficient solutions for data-centric applications, it might be more beneficial to focus on document-centric XML. I also have some ideas regarding the storage & search structures used (and please forgive me if they're already in place, as I'm very new to this project.) 1. Are the binary tree representations stored as linked trees or arrays? Typically, if the B-trees can be stored as arrays, the spatial locality for programs increases substantially. 2. Are the B-trees balanced? 3. Could we use a hybrid approach to storage and indexing, using hash tables, array-based B+ trees, and/or Patricia tries?
