[
https://issues.apache.org/jira/browse/LUCENE-2454?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=12878434#action_12878434
]
Mark Harwood commented on LUCENE-2454:
--------------------------------------
bq. Wow, this is absolutely awesome!
Thanks. I've found that this certainly solves problems I previously couldn't
address at all in standard Lucene.
bq. The leading concern I have with this implementation is the size of the
number of documents in the index as it affects the size of filters
These filters can obviously be cached but you'll need one filter per level you
"roll up" to. Assuming a 300m doc index and only rolling up matches to the root
that should only cost 300m /8 bits per byte = 37.5 meg of RAM. Index reloads
should avoid the cost of completely rebuilding this filter nowadays because
filters are cached at segment level and unchanged segments will retain their
cached filters.
Perhaps a bigger concern is any norms arrays which are allocated one BYTE (as
opposed to one bit) per document in the index.
bq. and they don't share any fields with the parent.
For parents with only 1 child document instance of a given type, these could be
safely "rolled up" into the parent and stored in the same document.
> Nested Document query support
> -----------------------------
>
> Key: LUCENE-2454
> URL: https://issues.apache.org/jira/browse/LUCENE-2454
> Project: Lucene - Java
> Issue Type: New Feature
> Components: Search
> Affects Versions: 3.0.2
> Reporter: Mark Harwood
> Assignee: Mark Harwood
> Priority: Minor
> Attachments: LuceneNestedDocumentSupport-1.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.
-
You can reply to this email to add a comment to the issue online.
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
