B-tree and B+ Tree's are used for Multi-level Indexing in Databases. By using the search effectiveness of B-tree, this project was implemented for database indexing of students, given their information a Btree is created as per their Gr_no[Unique/Primary Key] and offset is stored accordingly.
-
Notifications
You must be signed in to change notification settings - Fork 2
B-tree and B+ Tree's are used for Multi-level Indexing in Databases. By using the search effectiveness of B-tree, this project was implemented for database indexing of students, given their information a Btree is created as per their Gr_no[Unique/Primary Key] and offset is stored accordingly.
sa171/Database-Indexing-using-Btree
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
B-tree and B+ Tree's are used for Multi-level Indexing in Databases. By using the search effectiveness of B-tree, this project was implemented for database indexing of students, given their information a Btree is created as per their Gr_no[Unique/Primary Key] and offset is stored accordingly.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published