Live data from Hacker News

Show HN: On-disk B+ tree for Python 3

github.com

1–10 of 22 posts

Re: Show HN: On-disk B+ tree for Python 3

#8
post #4

Nice, I'm a big user of various data stores for scientific work. How does this compare to LMDB ( http://www.lmdb.tech/doc/ ), which uses B-trees (and has a Python interface)?

I haven't done any benchmark yet but I expect my implementation to be at least an order of magnitude slower.

I've found my implementation to be CPU intensive: creating Python objects from the raw pages is expensive. That's why bulk inserts and iterations are much faster than insert/get in a loop.

Post reply on HN