Re: Search in NestedSets

I'm with you up to where you say "...AND the whole tree above this element...". If you weren't locked into the relational/SQL model, and the address could be a multivalued attribute (as in a Pick database), the query to retrieve the "structure element" with an address "like Schmidt" would be simplified - it would be SELECT {filename} WITH ADDRESS "[Schmidt]". That would give you all of the "structure elements" with an address containing the substring "Schmidt", where each "structure element" can have an infinite number of addresses, each of infinite length.

Can you elaborate on the nature of the structure - or heirarchy - please? Maybe, if you're unfamiliar with Pick, you could represent the structure in XML? It might be that you would need to go down to subvalue level (in Pick terminology) - but I'm not sure that's what you're after.

Regards,
Mike. Received on Sat May 14 2005 - 02:41:36 CEST