Hi David, > One thought I had was to preprocess the data into more of a > tree structure instead of the flat structure it is now ... > > <item > > > <item> > > <item> > > </item> > > </item> > > then I can use ancestor axis to search up the tree instead of > a flat search ... But if these were already indexed it > "should" be a near instant access as a flat structure (???)
What I have done before in a similar case was simply chunk the whole document in separate items and store these as individual documents. While doing that, you could use the directory facilities and create paths according to the parent-child relations. It was quite easy and fast to query for items and retrieve information from the hierarchy as well. I did this with a list of terms of at least 9000 items, where each had a code and translations into a dozen languages, and a hierarchy of several levels deep. A quite different alternative might be to use map:map. Either during querying or during reconstructing the hierarchy.. Kind regards, Geert Drs. G.P.H. Josten Consultant http://www.daidalos.nl/ Daidalos BV Source of Innovation Hoekeindsehof 1-4 2665 JZ Bleiswijk Tel.: +31 (0) 10 850 1200 Fax: +31 (0) 10 850 1199 http://www.daidalos.nl/ KvK 27164984 De informatie - verzonden in of met dit emailbericht - is afkomstig van Daidalos BV en is uitsluitend bestemd voor de geadresseerde. Indien u dit bericht onbedoeld hebt ontvangen, verzoeken wij u het te verwijderen. Aan dit bericht kunnen geen rechten worden ontleend. _______________________________________________ General mailing list [email protected] http://xqzone.com/mailman/listinfo/general
