[
https://issues.apache.org/jira/browse/LUCENE-2454?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13052223#comment-13052223
]
Mark Harwood commented on LUCENE-2454:
--------------------------------------
bq. prevSetBit is called for each child doc
You could call nextSetBit on the first child to know the "safe" range of child
docs attributable to the same parent but you would be taking a gamble that this
was worth the call i.e. there were many possible children per parent to be
tested.
bq. It uses 2 passes if you also want to collect child docs per parent
I tend to work with distributed indexes so it involves a 2 pass op anyway - one
to understand best parents across the multiple shards first then the
perparentlimitedquery to ensure we only pay the retrieve costs for those
parents that make the final cut.
bq. I think it should use a PQ to find the lowest child to evict per parent doc?
Careful object reuse would need to be factored in to avoid excessive GC - each
parent would fill a PQ full of child-match object instances that could/should
be reused in assessing the next parent
> Nested Document query support
> -----------------------------
>
> Key: LUCENE-2454
> URL: https://issues.apache.org/jira/browse/LUCENE-2454
> Project: Lucene - Java
> Issue Type: New Feature
> Components: core/search
> Affects Versions: 3.0.2
> Reporter: Mark Harwood
> Assignee: Mark Harwood
> Priority: Minor
> Attachments: LUCENE-2454.patch, LUCENE-2454.patch,
> LuceneNestedDocumentSupport.zip
>
>
> A facility for querying nested documents in a Lucene index as outlined in
> http://www.slideshare.net/MarkHarwood/proposal-for-nested-document-support-in-lucene
--
This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira
---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
