This is a Bplus tree implementation to handle following queries:
INSERT x
- To insert x into the B+ treeFIND x
- OutputsYES
ifx
exists in the B+ tree, elseNO
COUNT x
- Outputs no. of occurances ofx
in the B+ treeRANGE x y
- Outputs no. of elements in betweenx
andy
in B+ tree
python3 BplusTree.py <input_filename>
Implemented linear hashing and handled duplicate elimination.
python3 linearhashing.py <input_filename>