In this project, you are going to implement an Index Organized Table with B+-tree indexing structure with Pleaf>= 3. The project consists of 2 main tasks. I the first task, you are going to implement a main memory Index-Organized Table (IOT) witch is based on B+-tree indexing structure including the following functions (or methods):
• Lookup(int value): find the specified value for Primary Key. If the value exists, returning all rows including column values.
• Insert(int value, ArrayList columns): insert the specified value and other column values.
• Delete(int value): delete the specified value for Primary Key.
• Display(int node): print out the entire IOT with indexing tree structure under specified node like the figure below.
• Implementing SQL-Like interface. For example,
SELECT * FROM DEPARTMENT WHERE ID = 1;
INSERT INTO DEPARTMENT VALUES (1, HR, 100, 1000);
DELETE FROM DEPARTMENT WHERE ID = 1;
• Implementing range search. For example,
SELECT * FROM DEPARTMENT WHERE ID > 1;
For the first task, you can utilize a provided pseudo code in Java for your better understanding.
Note that Pleaf>= 3, which means each node has 3 rows. Binary is NOT allowed in IOT.