[
https://issues.apache.org/jira/browse/OAK-1654?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13956405#comment-13956405
]
Thomas Mueller commented on OAK-1654:
-------------------------------------
> Only in the case where you have to join the results because of 'and'
> constraints. How do you join if you don't know the values of the sets?
I can create a patch. Yes, it's a bit harder to do things lazily than for the
other cases we have so far (such as Cursors.newPathCursorDistinct). Still, it's
possible to do it more lazily and possibly conserve memory (read until there is
a match, instead of fully read both in every case; only keep entries in memory
of one side). The bigger problem is that reading the paths only breaks
jcr:score().
> Composite index aggregates
> --------------------------
>
> Key: OAK-1654
> URL: https://issues.apache.org/jira/browse/OAK-1654
> Project: Jackrabbit Oak
> Issue Type: Bug
> Components: oak-lucene, query
> Reporter: Alex Parvulescu
> Assignee: Alex Parvulescu
> Fix For: 0.20
>
> Attachments: OAK-1654.patch
>
>
> This is a followup for what is still missing from OAK-828: composite
> aggregates.
> This covers 2 parts:
> - when searching for 2 tokens that can be present on 2 different nodes, the
> common aggregated parent doesn't show up
> - when adding together multiple contains clauses on different hierarchy
> levels: now the lucene index simply returns an infinite cost.
--
This message was sent by Atlassian JIRA
(v6.2#6252)
