File organization (heap, sequential, hashing) in DBMS Theory - Mini Project: Build & Apply

Understanding File Organization: Heap, Sequential, and Hashing

📖 Scenario: You are working as a database assistant helping to organize data storage for a small library system. The library wants to understand different ways to store book records efficiently.

🎯 Goal: Build a simple representation of three types of file organization methods: heap, sequential, and hashing, using lists and dictionaries to simulate how records are stored and accessed.

📋 What You'll Learn

Create a list called heap_file to represent unordered records.

Create a list called sequential_file with records sorted by book ID.

Create a dictionary called hash_file to simulate hashing with book ID as key.

Add a variable search_id to represent the book ID to find.

Write code to find a book record by search_id in each file organization.

💡 Why This Matters

🌍 Real World

File organization methods are used in database systems to store and retrieve data efficiently depending on the type of queries and operations.

💼 Career

Understanding these methods helps database administrators and developers optimize data storage and access for applications.

1

Create the heap file with unordered book records

Create a list called heap_file containing these book records as dictionaries with keys 'id' and 'title': {'id': 102, 'title': 'Python Basics'}, {'id': 215, 'title': 'Data Science'}, {'id': 150, 'title': 'Databases'}.

DBMS Theory

# Create the heap_file list with unordered book records
# Your code here

Need a hint?

Use a list with dictionaries for each book record in any order.

2

Create the sequential file with sorted book records

Create a list called sequential_file containing the same book records sorted by 'id' in ascending order: {'id': 102, 'title': 'Python Basics'}, {'id': 150, 'title': 'Databases'}, {'id': 215, 'title': 'Data Science'}.

DBMS Theory

heap_file = [
    {'id': 102, 'title': 'Python Basics'},
    {'id': 215, 'title': 'Data Science'},
    {'id': 150, 'title': 'Databases'}
]
# Create the sequential_file list sorted by 'id'
# Your code here

Need a hint?

Sort the records by the 'id' key in ascending order inside a list.

3

Create the hash file using a dictionary with book IDs as keys

Create a dictionary called hash_file where each key is the book 'id' and the value is the corresponding 'title' for these books: 102, 215, and 150.

DBMS Theory

heap_file = [
    {'id': 102, 'title': 'Python Basics'},
    {'id': 215, 'title': 'Data Science'},
    {'id': 150, 'title': 'Databases'}
]

sequential_file = [
    {'id': 102, 'title': 'Python Basics'},
    {'id': 150, 'title': 'Databases'},
    {'id': 215, 'title': 'Data Science'}
]
# Create the hash_file dictionary with book id as key and title as value
# Your code here

Need a hint?

Use a dictionary with book IDs as keys and titles as values.

4

Add a search_id and find the book in each file organization

Create a variable called search_id and set it to 150. Then write code to find the book with this ID in heap_file using a for loop with variables record, in sequential_file using a for loop with variables record, and in hash_file by accessing the key directly.

DBMS Theory

heap_file = [
    {'id': 102, 'title': 'Python Basics'},
    {'id': 215, 'title': 'Data Science'},
    {'id': 150, 'title': 'Databases'}
]

sequential_file = [
    {'id': 102, 'title': 'Python Basics'},
    {'id': 150, 'title': 'Databases'},
    {'id': 215, 'title': 'Data Science'}
]

hash_file = {
    102: 'Python Basics',
    215: 'Data Science',
    150: 'Databases'
}

# Set search_id to 150
search_id = 150

# Find the book in heap_file using a for loop
# Find the book in sequential_file using a for loop
# Find the book in hash_file by key access
# Your code here

Need a hint?

Use loops to search lists and direct key access for the dictionary.