ConcurrentSortedDictionary implementation in (c#, .NET 7) . It is implemented using a concurrent B+Tree

This contains a C++ code that implements a B-Tree data structure. A B-Tree is a self-balancing tree that can store and retrieve data efficiently. It is commonly used in databases and file systems.

data structures and algorithms implemented in Python

Some advanced data structures' implementations in C++

An SQL like database implementation in C using B-Trees for indexing.

B-Tree implementation using Java programming language.

An implementation of B-Trees in TypeScript

Implementation of External Memory Fractal Tree (a variant of the Buffered Repository Tree) in C++ through the STXXL library.

Allocate and store B-trees in a shared arena

Extendable C++ implementation of B+Tree data structure

Distributed System Data Base implemented in C++ using B-Trees to manage and manipulate the death rate dataset efficiently.

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

This course mainly introduces the theory and application of database systems, including: 1. Introduction and architecture of database systems 2. ER data schema 3. File storage structure 4. Relational data schema 5. SQL query language 6. Conversion between ER data model and relational data model 7. Database normalization 8. Optimized query 9. Tra…

B and B+ trees implementations in Python

Repositório contendo os códigos da disciplina Algoritmos e Estruturas de Dados 2, ministrado pela professora Ariane Machado Lima, na Escola de Artes, Ciências e Humanidades (EACH) da Universidade de São Paulo

C++ project using a B-tree index (order 3–10) for fast retrieval and management of CUSTOMER and CUSTOMER_ACCOUNT data

All my projects from CMSC420 (Advanced Data Structures)

Trabalho 1 da disciplina Técnicas de Programação Em Plataformas Emergentes