jackrabbit-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Marcel Reutegger <marcel.reuteg...@gmx.net>
Subject Re: efficient note type indexing
Date Tue, 25 Apr 2006 09:22:29 GMT
Florent Guillaume wrote:
>> using different types for the child nodes is definitively a good idea, 
>> as it helps narrowing down the set of nodes that may match.
> 
> If I have the (non-mixin) types:
>   [my:bar]
>      ...
>   [my:foo] > my:bar
>      ...
>   [my:gee] > my:bar
>      ...
> the spec (6.6.3.2) tells me that I can query
>   //element(*, my:bar)
> and I'll get my:foo and my:gee nodes too. But is this implemented in 
> jackrabbit using efficient indexes, or is there an iteration and 
> comparison going on?

jackrabbit uses an index to resolve the types. it basically expands the 
type hierarchy on parse time and then uses the index to collect the node.


regards
  marcel

Mime
View raw message