Alexei Scherbakov commented on IGNITE-4523:

PartitionSet hides internal implementation of int array. 

This allows as to efficiently represent contiguous range of partitions and 
defines clear API for ordered iteration over partitions and containment check.

Even better to go with compressed bitmap, as I mentioned in ticket comment. 
This will allow us to minimize heap footprint for this object.

Moreover, it will be useful to create reusable compressed bitmap implementation 
in Ignite and use it in other cases, on example, for replacing H2's IntArray 
and Set<Integer>.

Should I create a ticket for this ?

> Allow distributed SQL query execution over explicit set of partitions
> ---------------------------------------------------------------------
>                 Key: IGNITE-4523
>                 URL: https://issues.apache.org/jira/browse/IGNITE-4523
>             Project: Ignite
>          Issue Type: Improvement
>          Components: cache, SQL
>    Affects Versions: 1.8
>            Reporter: Alexei Scherbakov
>            Assignee: Alexei Scherbakov
>             Fix For: 1.9
> 3Currently distributed SQL query is executed on all nodes containing primary 
> partitions for a cache, sending map query requests on all nodes in grid.
> Sometimes we know in advance which partitions hold a data for query, on 
> example, in case of custom affinity function. 
> Therefore it's possible to reduce number of nodes receiving map query request 
> by providing explicit set of partitions, which will give significant 
> performance advantage and traffic reduction in case of very large clusters.
> Internally we already have such functionality, so the only necessary thing is 
> to provide public API for what.

This message was sent by Atlassian JIRA

Reply via email to