Activity: Indexing
(no submission)Purpose:
- Understand the concepts of indexing
- Use B+ tree to find records, insert keys, and delete keys
- Get ready to work on homework assignment
- Prepare for exam 2
You may make a copy of a worksheet and complete this activity or type your answers in any text editor.
You may work alone or with 3-4 other students in this course.
- Construct a B+ tree for the following set of key values:
(10, 15, 20, 30, 60, 65, 80, 95, 100, 112, 124, 140, 148)
Assume that the tree is initially empty and values are added in ascending order. Construct B+ tree for the cases where the number of pointers (n) that will fit in one node is five.
- Use the B+ tree constructed in question 1, what is the minimum number of pointers to be followed to satisfy the query:
Get all records of data associated with key(s) between 40 and 85?
- Use the B+ tree from question 1,
apply each of the following operations in order, and show the tree after each operation.
- Insert 18
- Insert 40
- Insert 85
- Delete 124
- Insert 138
- Insert 135
- Insert 120
Copyright © 2025 Upsorn Praphamontripong
Released under the
CC-BY-NC-SA 4.0 license.
Last updated 2025-11:13 9:51