Re:Show HN: On-disk B+ tree for Python 3
by nicolaslem on Sunday January 21, 2018 @03:13PM
(#16199734)
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.
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.