shivamagarwal2996 / bplus_tree Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

Implementation of Bplus tree with following operations: 1. Initialize (m): create a new m-way B+ tree 2. Insert (key, value) 3. Delete (key) 4. Search (key): returns the value associated with the key 5. Search (key1, key2): returns values such that in the range key1 <= key <= key2

0 stars 0 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
README.md		README.md
bplustree.java		bplustree.java
input.txt		input.txt
makefile		makefile
report.pdf		report.pdf

Repository files navigation

bplus_tree

Implementation of Bplus tree in JAVA with following operations:

Initialize (m): create a new m-way B+ tree
Insert (key, value)
Delete (key)
Search (key): returns the value associated with the key
Search (key1, key2): returns values such that in the range key1 <= key <= key2

About

Implementation of Bplus tree with following operations: 1. Initialize (m): create a new m-way B+ tree 2. Insert (key, value) 3. Delete (key) 4. Search (key): returns the value associated with the key 5. Search (key1, key2): returns values such that in the range key1 <= key <= key2

Report repository

Releases

No releases published

Packages

Languages