longint hashmap which uses DataAccess -> not ready as we'll use a btree instead (more memory efficient as no rehashing necessary)
implemented simple btree
special leaf case for BTree to save memory, also do compaction every 1mio insert