Thanks for your response, Alex. I should hang my head in shame that I did not think of that. I guess my mind automatically excluded a more manual process. Thanks again for your help.
Kind regards, James On 17 March 2010 10:39, Alexander Klimetschek [via Jackrabbit] < [email protected]<ml-node%[email protected]> > wrote: > On Wed, Mar 17, 2010 at 09:52, Gadbury <[hidden > email]<http://n4.nabble.com/user/SendEmail.jtp?type=node&node=1596173&i=0>> > wrote: > > How do you mean by node graph? Please would you be able to provide an > > example...? Do you mean call getNodes() on the providerNode? > > Yes. Navigational access in JCR is a very notable difference compared > to RDBMS. It is seen as the major feature, whereas search can be > considered as "optional" (yet very convenient for many use cases). > Just like in a file system. > > > If so, how would I supply property or type constraints? > > By looking at the properties while traversing ;-) > > If the number of nodes is low enough (say less then a few hundred or > one thousand) and if there is no need for a more complex, "dynamic" > query, node traversal will be better, ie. more performant and > scalable. Especially if your content model is optimized for that (main > & read) use case. > > Regards, > Alex > > -- > Alexander Klimetschek > [hidden > email]<http://n4.nabble.com/user/SendEmail.jtp?type=node&node=1596173&i=1> > > > ------------------------------ > View message @ > http://n4.nabble.com/XPath-query-with-path-constraint-and-same-name-siblings-tp1594661p1596173.html > To unsubscribe from Re: XPath query with path constraint and same name > siblings, click here< (link removed) =>. > > > -- View this message in context: http://n4.nabble.com/XPath-query-with-path-constraint-and-same-name-siblings-tp1594661p1596179.html Sent from the Jackrabbit - Users mailing list archive at Nabble.com.
