Simplified B+ tree — range queries on sorted data
-
Updated
Jun 22, 2026 - Python
Simplified B+ tree — range queries on sorted data
Multi-dimensional data structures and document similarity methods comparison using Natural Language Processing (NLP).
Implementation of a B+ tree for lexicographically ordered name indexing using a custom hash function
Developed as part of database design course, features a CLI interface and utilizes B+ trees for data storage, w/effective database management techniques.
A relational database engine built from scratch in Python — paged storage, B+ tree & hash indexes, SQL parser, volcano executor, cost-based optimizer, and write-ahead logging with crash recovery. Zero runtime dependencies.
Course project (CMPE 321 Database Systems, Boğaziçi University): a modular four-layer DBMS engine in pure Python with B+ tree and hash indexes, buffer manager and disk space manager
Add a description, image, and links to the bplus-tree topic page so that developers can more easily learn about it.
To associate your repository with the bplus-tree topic, visit your repo's landing page and select "manage topics."