HarperFast / HarperFast/harper
Faster ID list data structure in LMDB (replace sorted array)
Open
area:storage
enhancement
from-jira
- Dominant language
- JavaScript
- Stars
- 89
- Forks
- 10
- Avg merge
- 2d 6h
- Merged PRs (30d)
- 200
Description
LMDB uses sorted integer arrays for dirty/free page tracking. Insertions are O(n), which becomes a bottleneck in large transactions. Replace with a more efficient data structure (e.g., B-tree, skip list, or bitmap) to reduce write transaction cost at scale.
🤖 Filed by Claude on behalf of Kris.
Contributor guide
Assessment
This issue has not been assessed yet.