John Wright wrote:
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.
Good to see I'm not alone. :-)
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.)
OK, you are my man! :-)
Please go ahed with ideas and suggestions: you are most welcome. As of now we badly need skills like yours, so please, *please*, go ahead and share with us your opinions.
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?
The short answer to these questions is "I really don't know". I have never been that deep into the Xindice internals, maybe others might help you here.
3. Could we use a hybrid approach to storage and indexing, using hash tables, array-based B+ trees, and/or Patricia tries?
Look, I'll be very straight with you: I know little or nothing about hard-core programming with data structures. I've been using database from a long while, but this is my first attempt in making one. While I try to catch up by reading papers and making exercises, please try to explain me what might be in your opinion the best solution (any comment about my previous email on SAX events storage?). Don't waste time typing: a pointer to some web documentation would be more than enough. I promise to learn fast. :-) And if you want to join the team, of course, you are more than welcome.
Ciao,
-- Gianugo Rabellino
