bplustree | extreme fast B+ tree indexing structure demo | Dataset library

You should not do a synchronous put() within the EntryProcessor. Processor is already invoked within a lock, so this can cause a deadlock and/or thread starvation.

If you need to update the processed entry, use MutableEntry#setValue(..).

Striped pool used for processing of the Ignite messages. Looks like for some reason all the threads from this pool is waiting for some operation (remove from cache in your log). It could be related to network problems or removing takes a lot of time (for example you are going to remove all the data).

Could you please attach the thread dump and your test code for investigation?

You may combine update and select by the help of merge like the following statement :

Comparable is a bit weird when dealing with generics. I believe the correct definition is below:

Please try to turn on isStoreKeepBinary in cache settings - like this; please note the last line:

Adding the insert() in the Node class isn't bad at all. If it does look weird to you when BPlusTree::insert() calls Node::insert() please don't be there are quite some advantages to this style of code.

My answer could be opinion based.

With the Node::insert() node is much more complete and is a full fledged class on its own. The Node class can be used by many other classes that you might make in the future. So you won't have to write the insert() function again and again.

Modularity is exactly what the above paragraph means. Your code becomes much more modular this way.

I'm not against friending the BPlusTree class but the thing is that the day you make BPlusTreeImproved or anything that uses Node you'll have to friend that as well to use the Node. Which means constant pain of changing and recompiling Node.