Purpose:
You may make a copy of a worksheet and complete this activity, or simply type your answers in any text editor.
You may work alone or with at most two other students in this course (feel free to make use of any communication channels of your choice, or simply type in Zoom's chat .. or talk if that works for your team).
(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.
Assume each disk block holds t
tuples
of a relation customer
.
A relation customer
has 100 tuples;
and 10 disk blocks are used to hold tuples of the relation.
An attribute city
indicates a city where a customer lives.
The customer
relation is sorted by city
(ascending).
There are 80 distinct values of the city
in the customer
relation.
For each of the following data access methods, estimate the I/O cost to answer the query: Find information of customers who live in Charlottesville
city
of the customer
relation)city
)