nowfound

Dev tools · free · 2026

24 free alternatives to On-disk B+ tree for Python 3

An on-disk B+tree for Python 3.

Below are 24 products that do a similar job and cost nothing to start: 24 free outright and 0 with a free plan and paid upgrades. Each price was read from the product's own site. They are ranked by how close each is in meaning, then by launch-day votes.

  1. 1

    Recently created a minimal persistent relational database in Go. Main focus was on implementing & understanding working the of database, storage management & transaction handling. Use of B+ Tree for storage engine(support for indexing), managing a Free List (for reusing nodes), Support for transactions, Concurrent Reads. Still have many things to add & fix like query processing being one of the main & fixing some bugs Repo link - https://github.com/Sahilb315/AtomixDB Would love to hear your thoughts

    2025 · github.com · price checked November 2026

  2. 2
    LeavesFree▲93

    Leaves is a text-based disk usage visualizer for servers and containers that displays directory hierarchies as proportionally-sized rectangles in a treemap layout.

    Jul 2026 · github.com · price checked November 2026

  3. 3
    learndb-pyFree▲371

    This is a relational database management system written entirely in Python that functions similarly to SQLite.

    2023 · github.com · price checked November 2026

  4. 4
    SNKVFree▲36

    SQLite has six layers: SQL parser → query planner → VDBE → B-tree → pager → OS. (https://sqlite.org/arch.html) For key-value workloads you only need the bottom three. SNKV cuts the top three layers and talks directly to SQLite's B-tree engine. No SQL strings. No query planner. No VM. Just put/get/delete on the same storage core that powers SQLite. Python: pip install snkv from snkv import KVStore with KVStore("mydb.db") as db: db["hello"] = "world" print(db["hello"]) # b"world" C/C++ (single-header, drop-in): #define SNKV_IMPLEMENTATION #include "snkv.h" KVStore…

    Feb 2026 · github.com · price checked November 2026

  5. 5
    CaskDBFree▲175

    (educational) build your own disk based KV store.

    2022 · github.com · price checked November 2026

  6. 6
    B-fieldFree▲153

    `rust-bfield` is a Rust implementation of our novel "B-field" data structure, which functions like a Bloom filter for key-value lookups instead of set membership queries. The B-field allows you to compactly store data using only a few bytes per key-value pair. We've successfully utilized it in genomics to associate billions of "k-mers" with taxonomic identifiers while maintaining an efficient memory footprint. But the data structure is also useful beyond computational biology, particularly where you have large unique key domains and constrained value ranges. Available under an Apache 2…

    2024 · github.com · price checked November 2026

  7. 7
    Taipy 3.0Free▲299

    Turns Data and AI algorithms into production-ready web applications in no time.

    2024 · github.com · price checked November 2026

  8. 8
    Files SDKFree▲242

    A unified storage SDK for object and blob backends

    May 2026 · files-sdk.dev · price checked November 2026

  9. 9
    HelixDBFree▲237

    HelixDB is an open-source vector-graph database written in Rust that combines vector and graph data types natively for AI applications.

    2025 · github.com · price checked November 2026

  10. 10

    Dep-tree visualizes a codebase's dependencies using a 3D force-directed graph, helping developers understand code complexity and architecture.

    2024 · github.com · price checked November 2026

  11. 11
    LstrFree▲227

    Lstr is a modern command-line tool written in Rust that displays directory structures like the classic tree command, but with interactive features.

    2025 · github.com · price checked November 2026

  12. 12

    This is a Python library for reading and writing PDF files, built from scratch by a developer focused on learning and simplicity.

    2022 · github.com · price checked November 2026

  13. 13

    Long-simmering side project that is finally ready to see the light. HAMTs are a cool persistent data structure and implementing one has been a lot of fun. Beyond the code, there is likely some value in the extensive and largely complete implementation docs; basic benchmarks are linked in the README, too. Kind of aiming to be "the libavl for HAMTs". That is obviously a high and aspirational bar but a distinct possibility if it stirs up a little interest and/or contribution. Anyways, it's time for this to go out, collect feedback and maybe even some use outside of toy projects. Let me…

    2023 · github.com · price checked November 2026

  14. 14

    This project presents a new data structure for storing ordered integer maps. The proposed data structure is a compressive, cache-friendly, radix tree that has performance comparable to an unordered map (`std::unordered_map`) and is an order of magnitude faster than an ordered map (`std::map`).

    2024 · github.com · price checked November 2026

  15. 15

    This proof-of-concept system stores AI conversation memory as markdown files in a Git repository instead of using traditional vector databases.

    2025 · github.com · price checked November 2026

  16. 16
    HelixDBFree▲159

    HelixDB is an OLTP graph database built on object storage that combines graph queries, vector search, and full-text search in a single system.

    Jun 2026 · github.com · price checked November 2026

  17. 17
    RefurbFree▲123

    A tool for refurbishing and modernizing Python codebases

    2022 · github.com · price checked November 2026

  18. 18
    ToplingDBFree▲73

    ToplingDB is a persistent key-value store for external storage built on RocksDB with optimized internal components.

    2025 · github.com · price checked November 2026

  19. 19
    DuckDiskFree▲104

    Table-first storage analysis for Mac, cloud, and SSH

    Aug 2026 · github.com · price checked November 2026

  20. 20
    SlateDBFree▲26

    SlateDB is an embedded storage engine built as a log-structured merge-tree. Unlike traditional LSM-tree storage engines, SlateDB writes data to object storage (S3, GCS, ABS, MinIO, Tigris, and so on). Leveraging object storage allows SlateDB to provide bottomless storage capacity, high durability, and easy replication. The trade-off is that object storage has a higher latency and higher API cost than local disk. To mitigate high write API costs (PUTs), SlateDB batches writes. Rather than writing every put() call to object storage, MemTables are flushed periodically to object storage as a…

    2024 · github.com · price checked November 2026

  21. 21

    This is a bootloader implementation written in C++ that includes the master boot record, partition boot sector, and a second stage that loads kernels from FAT32 filesystems.

    2023 · github.com · price checked November 2026

  22. 22
    DbzeroFree▲7

    DISTIC (Durable, Infinite, Shared, Transactional, Isolated, Composable) storage system for Python 3.x offering flexibility of a memory with durability of a database.

    Dec 2025 · github.com · price checked November 2026

  23. 23

    This local Python prototyping tool bundles Jupyter for data analysis, a choice of Python or MongoDB databases, and Streamlit for frontend visualization.

    2023 · github.com · price checked November 2026

  24. 24
    MinikvFree▲71

    Minikv is an open-source distributed storage engine written in Rust that combines a strongly-consistent key-value database using Raft consensus with S3-compatible object storage.

    Feb 2026 · github.com · price checked November 2026

All alternatives to On-disk B+ tree for Python 3, paid too →About On-disk B+ tree for Python 3 →

Free means the product’s own site says it is free or offers a free plan, as read on the date shown. Plans change; check the site before you rely on one.