[lilactown]

The "Optimized B-Trees" section I _think_ is suggesting to get rid of datoms, which I 100% agree with. I do not think they add anything at all; IME you can have a collection of all attributes indexed by entity ID and then have additional indexes on top of that collection.

My stupid question is: why even bother with B-Trees? I believe asami[0] stores everything in memory using Clojure maps & sets.

[0] https://github.com/quoll/asami

[westoncb]

I'm curious about this too. I think the clojure maps are backed by RRBTs (relaxed radix binary trees), and I've wondered how possible it is to take advantage of that structure for writing algorithms on top of (vs it being sort of "behind the scenes" only, taking care of immutability/persistence).