This project focused on implementing a B+ Tree index on a search key of integer type in a typical relation. The idea behind implementing an index is to improve performance when accessing elements in the relation. This is accomplished by storing <key,rid> pairs into the B+ Tree index. Efficient use of the B+ Tree and Buffer Manager are important to the structure and must be taken into consideration.
- cd to make directory and then do the make, you will see a error called no .relA files, this is for second run ignore this error
- use ./src/badgerdb_main to run the exeu file
- cd to make dir, then use make clean
- then use make to build files
- use ./src/badgerdb_main to run the exeu file
- to edit test cases use main.cpp
- to change Btree algo use BTree.cpp