bstar-implementation

Bstar Tree Implementation, a data structure library designed to store sorted data and optimize search performance in databases. It provides a seamless user experience to help developers manage large datasets efficiently, reduce disk access overhead, and maintain balanced node distributions.

C++ console application implementing a B* tree index for fast lookups in a CUSTOMER table by primary key. Supports creation, insertion, deletion, and multiple search modes (by ID, by name, by list of IDs) with performance cost reporting. Built for the Algorithms and Data Structures 2 coursework on index structures and database search optimization.