This project implements an efficient data storage and retrieval system using the B-tree data structure in C++.

Learn different data structure in C

In-memory B+ tree implementation for Go.

A persistent and crash-safe CoW B-Tree storage engine in Go (built from scratch with zero dependencies)

Index records comprise search-key values and data pointers. Multilevel index is stored on the disk along with the actual database files.

A document database built from scratch in C++20: BSON storage engine, append-only collections, hand-written on-disk B+Tree indexes, a query engine with explain plans, a TCP server (bisond), and an interactive shell (bisonsh). No third-party storage or networking libraries.

Un proyecto realizado en Windows Forms (.NET / C#), enfocado en el uso y manipulación de Estructuras de datos Avanzados (Grafos y algoritmos de grafos, arboles B+, HashTable) de una manera visual. En conjunto con un proyecto de entrega donde se muestra un uso practico relacionado a grafos (Transporte de Bienes).

This Java package implements a system which searches for some given words into a large number of text files, and returns all the locations where they are found.

Modern database management system uses advanced datastructures like B+ Trees, which are closely related, and extension rather, to B-Trees. The motive of this project was to implement the CRUD operations for B Trees and make a practically useful system, applying the knowledge of data structures and algorithms to optimize wherever possible.

Repository for the "SCC0215 - File Organization" course's project offered for Computer Science undergraduates at ICMC - USP, by professor Cristina Ciferri.

A from-scratch implementation of core database storage engine internals in pure Python (no external dependencies) — built to understand, hands-on, how a database keeps data on disk, indexes it efficiently, and survives a crash.

in this repository i am create implementation of hash table, b-tree and

BTree Java语言实现

This repository implements a simple DBMS using B-trees for efficient data indexing. It supports operations like creating indexes, searching, adding, and deleting records, with a command-line interface. Data is managed through text files.

A modern C++ container library designed as a simpler, more intuitive alternative to the STL

simple implementation based on algorithm metioned in Introduction to Algorithms

Complete functional BTree with efficient data insertion/searching/removal with real time data manipulations

Implementation of B-tree

Trabalho 2 de árvoreB desenvolvidas na disciplina TBO na UFES, em 2024/2