🏅State-of-the-art learned data structure that enables fast lookup, predecessor, range searches and updates in arrays of billions of items using orders of magnitude less space than traditional indexes

An embedded key-value store library specialized for building state machine and log store

An open-source BzTree implementation

GPU B-Tree with support for versioning (snapshots).

Source codes for the Data Structures and Algorithms in C++ and Java book

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.

🌲 A C++ implementation of all functionalities (insertion, deletion, search etc) of a 2-3 (two-three) Tree using Rotation, Split and Merge operations. (Please share if you find any bug in the code)

C++ template containers with optimized memory consumption

Reverse Query-Aware LSH for Furthest Neighbor Search (TKDE 2017)

Memory based B+ tree in C++

Low level indexed key value engine designed for a database backed up by an on disk file storage written in C++ for educational reasons. Also used as resource for database programming tutorial at https://medium.com/ (Link in readme).

B-tree implementation in C++ to index documents based on numerical id's and title strings

Some advanced data structures' implementations in C++

基于B-树的GUI图书管理系统

Data Structures and Algorithms in C++

b-tree c++ implement

Code done for the Data Structure class on UFSC

Common Data Structures And Algorithms Implemented In C++. FOR LEARNING PURPOSES ONLY

Trabalho sobre Árvores desenvolvido durante a disciplina de Estrutura de Dados II 2015.1 do curso de Ciência da Computação da Universidade Federal de Roraima

The project is a menu-driven application for student courses database where the user is able to perform operations like adding a course, searching for a courses or deleting a course, etc.