Hi, On Sat, Oct 22, 2011 at 11:33 PM, Stack <st...@duboce.net> wrote:
> On Sat, Oct 22, 2011 at 1:17 AM, Dhruba Borthakur <dhr...@gmail.com> > wrote: > > How would you scan in order an HashSet? Deletes across spans > (families or all older than a particular timestamp)? > > On the other hand, I did have a chat w/ the LMAX folks recently. They > had made a point earlier in the day that java Collections and > Concurrent are well due an overhaul (as an aside in a talk whose > general thrust was revisit all assumptions especially atop modern > hardware). I was asking what the underpinnings of a modern Collection > might look like and in particular described our issue with > ConcurrentSkipListMap. One of the boys threw out the notion of > catching the inserts in their Disruptor data structure and then > sorting the data structure. > I would think that the bottleneck for insert is the wal part? It would be possible to do a kind of memory list preparation during the wal insertion, and if the wal insertion is confirmed, do the insertion in the memory list. But it's strange to have the insertion in memory important vs. the insertion on disk...
