Suppose we are building a B-Tree. Pages are 4008 bytes. A key value takes 8 bytes, and a pointer to a tree node or a record takes 8 bytes. a) What is the maximum number of keys in each node? b) Calculate the maximum number of pages N, which can be indexed with anindex file with height, h=2 and m keys (m is calculated in part a)? c) How many I/O operations are required for searching through N pages using a sorted file (N is calculated in part b)?

Suppose we are building a B-Tree. Pages are 4008 bytes. A key value takes 8 bytes, and a pointer to a tree node or a record takes 8 bytes. a) What is the maximum number of keys in each node? b) Calculate the maximum number of pages N, which can be indexed with anindex file with height, h=2 and m keys (m is calculated in part a)? c) How many I/O operations are required for searching through N pages using a sorted file (N is calculated in part b)?

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter8: Advanced Data Handling Concepts

Section: Chapter Questions

Problem 20RQ

See similar textbooks

Similar questions

Consider a disk with block size B=512 bytes. A block pointer is P = 6 bytes long. A record pointer is P = 7 bytes long and key value size = 9 bytes long. Construct a B Tree with 30,000 records. The minimum height of the tree is (Assume root node is of level 1).
READ THE PROBLEM AND USE PYTHON PROGRAMMING LANGUAGE!!In this problem, you are going to implement a filesystem using a tree data structure. Similar to a filesystem, each node (or file), may have multiple children. If the specified path does not exist, then you should disregard that file. Once you are done adding elements to the filesystem, you should print the directory structure in the specified format. Required modifications: 1. Insertion of a new element 2. Printing of the directory from the root node. 3. Parsing of the input. Input Format First line is the name of the root directory. Second line, n, is the number of subdirectories that follows. For each line that follows, it shows the following format: Filename-root node,next path,next path,... Constraints You may assume that the filenames are all alphabetical characters with no special characters. n < 100 The maximum path length is 20 (including the root directory). You may assume that there are no similar…
Subject code- rcs502 Consider a Table T with a key field k. A and B tree of order P denotes the maximum number of record pointers in a B tree. Assume K is 10 bytes long disk block size is 512 Bytes. Record pointer is 8 Bytes and block pointer size is 5 Bytes long in order for each P tree node to fit in a single disk block the maximum value of P. I will downvote,if you do anything wrong
Consider a Table T with a key field k. A and B tree of order P denotes the maximum number of record pointers in a B tree. Assume K is 10 bytes long disk block size is 512 Bytes. Record pointer is 8 Bytes and block pointer size is 5 Bytes long in order for each P tree node to fit in a single disk block the maximum value of P.
To index (create a concordance for) the web, provide an implementation of Page that displays B-tree nodes as text files on web pages. Utilise a list of keywords. Take the normal input of web pages to be indexed. Take the command-line argument m and establish an upper maximum of 10m internal nodes to maintain control (before executing for big m, consult with your system administrator). When naming your internal nodes, use an m-digit number. Your nodes' names, for instance, may be BTreeNode0000, BTreeNode0001, BTreeNode0002, and so on when m is 4. Keep strings in pairs on the pages. Add the sort and write operations close() to the API.
. Assume you have a binary search tree with a root at 50, which of the following could not represent a valid search through the tree for a value? 2.Assume you have 8 different elements and wish to build a tree out of them. What are the largest and smallest heights this tree can have? 3.Assume you have a binary search tree where every pointer to another node requires 8 bytes and every value is a 4 byte integer. What is the total amount of space required if you have a tree with 3 levels and all levels are full? 4. Assume we are comparing a binary search tree and a normal tree's performance. Which of the following are a limitation of the BST in comparison with a normal tree? 5. Assume you have the first 5 outputs from a traversal of a binary search tree, 50, 45, 35, 25, 15. Which of the following could be the traversal represent? 6. Assume you have a complete binary search tree with a total size of 8 elements, what is the largest number of nodes that may have to be visited in a search…
Suppose that a disk drive has 6,000 cylinders, numbered 0 to 5999. The drive is currently serving a request at cylinder 2225, and the previous request was at cylinder 5195 (Hint: this indicates the reading head’s moving direction). The queue of pending requests, in FIFO order, is: 5962,2876,5452,1369,3594,5046,866,3269,409,1744 Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for each of the following disk-scheduling algorithms? a. FCFS SSTF SCAN LOOK C-SCAN C-LOOK
1) A file system is similar to a binary search tree. a. True b. False 2)A min-heap is a binary tree in which each node is less than or equal to both of its children. a. True b. False
Suppose that you traverse the binary search tree in write the data item in each node visited to a file. You plan to read this file later and create a new binary search tree by using the ADT binary search tree operation "add()". In creating the file, in what order should you traverse the tree so that the new tree will have exactly the same shape and nodes as the original tree?
Suppose that a disk drive has 7,000 cylinders, numbered 0 to 6,999. The drive is currently serving a request at cylinder 1,958, and the previous request was at cylinder 1,807. The queue of pending requests, in FIFO order, is: 2,069, 1,212, 2,296, 2,800, 544, 1,618, 356, 1,523, 4,965, 3681 Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests with First Come First Serverd(FCFS) alogrithim?
COMPLETE THE GIVEN CODE BELOW TO SOLVE THE PROBLEM - PYTHONIn this problem, you are going to implement a filesystem using a tree data structure. Similar to a filesystem, each node (or file), may have multiple children. If the specified path does not exist, then you should disregard that file. Once you are done adding elements to the filesystem, you should print the directory structure in the specified format. Required modifications: 1. Insertion of a new element 2. Printing of the directory from the root node. 3. Parsing of the input. Input Format First line is the name of the root directory. Second line, n, is the number of subdirectories that follows. For each line that follows, it shows the following format: Filename-root node,next path,next path,... Constraints You may assume that the filenames are all alphabetical characters with no special characters. n < 100 The maximum path length is 20 (including the root directory). You may assume that there are no similar…
Assume that disk block size is 1024 bytes. A B+-tree is created on an attribute of length 12 bytes. Each tree pointer is 6 bytes long and each data pointer is 7 bytes long. Find the order n of B+-tree nodes.