Vladimir, What do you think about my high-level solution shared in the previous email? What if we implement the SortedSet they way I suggested?
- Denis On Tue, Sep 8, 2020 at 4:15 AM Vladimir Pligin <vova199...@yandex.ru> wrote: > Denis, > > I absolutely agree with you that a SortedSet doesn't need to be > partitioned. > The main idea I wanted to put attention on is that now it's not possible to > find a row with a particular number with log complexity. We need to scan > node-local index until we reach some offset, it seems to be linear. For > example Redis uses a combination of a hash table and skip list to achieve > that. I'm not aware how complicated it is to implement it in Ignite as we > use trees. Just wanted to draw some attention to it. > > > > > > -- > Sent from: http://apache-ignite-developers.2346864.n4.nabble.com/ >
