Given an IGiB file subdivided into 262144 pages with records of 512B size, calculate the costs for each of the three file structures

INSTRUCTIONS TO CANDIDATES

ANSWER ALL QUESTIONS

Exercise 3: Data Access

(a) Given an IGiB file subdivided into 262144 pages with records of 512B size, calculate the costs for each of the three file structures I) heap file, 2) sorted file, and 3) hashed file and the following operations. Assume that files are sortedlhashed on primary key attribute A and assume D=l5ms, C=H=O.lus.

i Searching for A = 42.

ii. Inserting a record.

(b) Assume pages of size p = 4096B, index entries (on leaf pages) of size k* 1158, page pointers of size pp 64bit, and separator keys of size sk Ikil 238. Note, that for practical reasons leaf nodes can have a different maximum number of entries than inner nodes - otherwise, the index would waste space in leaves or would not be able to store all entries on a given page.

Given the above storage sizes, compute

i. the maximum possible order d of the B. tree, and

ii. the maximum possible number of index entries in a leaf page.

(c) Given the following tree, perform each instruction i)-üi) on the original tree. For the search, state which pages get accessed, and for insertions/deletions show the resulting tree.

ii. Insert entry with key = 13 (without redistribution).

iii. Insert entry with key = 23 (without redistribution).

iv. Delete the entries corresponding to the following keys in the shown sequence 14. 19,20,22,24

(show the resulting tree at the end). Use redistributionlmerging on right sibling (if it exists).

Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of