Hybrid-Binary-Tree-Index-with-TOF-File-Structure-and-B-Tree-Node-Splitting

TP-SFSD

TOF File Indexing System

Two-level binary tree indexing for file management with B-Tree implementation.

Overview

Part 1: Dual tree structure (T1/T2) for efficient file indexing
Part 2: B-Tree of order 5 with node splitting

Features

• Create data files with bulk loading
• Build index files from data
• Search records by key
• Insert new records
• B-Tree operations

Structure

• T1 Tree: Stores key ranges [v1, v2] and pointers to T2 trees
• T2 Tree: Stores actual keys with block number and position
• B-Tree: Alternative indexing with max 4 keys per node

Files

• data.tof - Data file
• index.tof - Index file
• Source files: main.c, bulkload.c, search.c, insert.c, btree.c

Usage

gcc -o tof *.c
./tof

Authors

SalahOuelhadj Halima Benmoussa Dihia SFSD TP 2025/2026