Indeed, all sets, regardless of whether they collocated or not, share single cache, and also use onheap data structures irresistable to checkpointing/recovery.
2018-02-13 2:14 GMT+03:00 Dmitriy Setrakyan <dsetrak...@apache.org>: > On Fri, Feb 9, 2018 at 6:26 PM, Andrey Kuznetsov <stku...@gmail.com> > wrote: > > > Hi all, > > > > Current set implementation has significant flaw: all set data are > > duplicated in onheap maps on _every_ node in order to make iterator() and > > size(). For me it looks like simple yet ineffective implementation. > > Currently, these maps are damaged by checkpointing/recovery, and we could > > patch them somehow. Another future change to Ignite caches can damage > them > > again. This looks fragile when datastructure is not entirely backed by > > caches. Pavel's proposal seems to be a reliable solution for > non-collocated > > sets. > > > > I would agree, but I was under an impression that non-collocated sets are > already implemented this way. Am I wrong? > -- Best regards, Andrey Kuznetsov.
