B+ Tree Database Indexing

A school database project focused on improving data retrieval performance using B+ tree indexes.

The project explores how database indexes can reduce the amount of disk access required when searching through large datasets.

Features

• B+ tree based indexing
• Clustered and unclustered indexes
• Indexing records by surname
• Indexing records by salary
• Record offsets into data files
• Bulk loading of index data
• Range and interval queries
• Disk-based index storage
• Binary serialization using ByteBuffer
• Analysis of disk I/O operations

Technologies

• Java
• B+ Trees
• Database Indexing
• RandomAccessFile
• ByteBuffer
• File I/O

University Project

Developed as part of a university Database Systems course.