initial development : MiniDataBase
- SHOW Tables
- CREATE Table
- INSERT INTO Table
- DISPLAY Table contents
- SEARCH INTO Table
- DROP Table
The Database System is designed using C++ and C combined features. It stores the data on physical disk using files.
Features of system include:
The data is stored in blocks.
Benefits of blocking: here
All the separate row data of a particular table is stored in different file creating blocks of data. System reads as well as writes data back to files in blocks.
A separate multilevel B+ tree is created for each table. Each node contains maximum of 50 entries. Right now data storage is based only on primary key, primary key can be INTEGER or VARCHAR.
Meta Data of the tables are stored separately which provides quick access to several information like current number of records, table name, etc.
For searching a record in file for particular table, B+ tree indexed search is implemented.B+ indexed search is based on primary key
For searching records other than primary key from table, brute force search algorithm is implemented.
Advantages of B+ Tree Indexing here
System also calculates the time taken by the search algorithm.
The whole project is initially done on eclipse platform(C/C++ perspective)-> in repo MiniDataBase
Further modifications are done on linux
For execution: Open directory DeepDatabase(branch:master) and on terminal
-
Type make, it will compile the project.
-
Type ./deepdb for running project.
-
Type make clean for recompiling the project.
For displaying the table contents, you have to select option 5 from menu and the queries supported by it are, do care about syntax, since complete parser is not implemented.
select * from table_name;
select id,name from table_name;
select id,name from table_name where id = 1;
