[
https://issues.apache.org/jira/browse/ACCUMULO-1682?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13757800#comment-13757800
]
Corey J. Nolet commented on ACCUMULO-1682:
------------------------------------------
In the past, I've seen source iterators used that will sort the column
qualifiers in memory (sounds similar Adam's approach of using a sorted map) and
they were definitely not scalable in terms of memory use.
Even if it's an iterator or paradigm for caching off keys so they can be
sorted, I was hoping there could be a standard approach to this that can be
reused easily (something to add to the examples at the very least). I'll dig
deeper and see if it's even something worth investigating further.
> Iterator and example to support intersection of document-partitioned index
> terms by ranges with lower and upper bounds.
> -----------------------------------------------------------------------------------------------------------------------
>
> Key: ACCUMULO-1682
> URL: https://issues.apache.org/jira/browse/ACCUMULO-1682
> Project: Accumulo
> Issue Type: Improvement
> Reporter: Corey J. Nolet
> Priority: Minor
> Labels: proposal
>
> The current IntersectingIterator seeks to discrete terms that are encoded
> into the column families to find all column qualifiers that share all of the
> discrete column families of interest (with the additional ability to negate
> some of the column families). Looking at the current IntersectingIterator
> code, it should be possible to return all column qualifiers with a column
> family within a given range.
> An example of this is finding all terms where NAME=Joe and (AGE>=30 &&
> AGE<60) and STATE!=MD. If an example is provided, numerical types like the
> age could easily be encoded using the new Lexicoders.
--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators
For more information on JIRA, see: http://www.atlassian.com/software/jira
