Assume a database has N = 14,000,000 pages, and the manager is trying to use external merge sort algorithm to sort it. The DBMS did not apply double buffer or blocked I/O, it use quicksort for in- memory sorting If the DBMS has 8 buffers. Q1. Based on Lecture 8 (sorting), in order to sort the file, how many passes do we need? A.8 B.9 C.10 D.11 Q2. based on Lecture 8 (sorting), in order to sort the file, What is the total I/O cost? A. 224,000,000 B. 252,000,000 C. 280,000,000 D. 308,000,000 A.7 B.8 C.9 D.10 Q3. What is the smallest number of buffers that the DBMS can sort the target file using 8 passes?

Assume a database has N = 14,000,000 pages, and the manager is trying to use external merge sort algorithm to sort it. The DBMS did not apply double buffer or blocked I/O, it use quicksort for in- memory sorting If the DBMS has 8 buffers. Q1. Based on Lecture 8 (sorting), in order to sort the file, how many passes do we need? A.8 B.9 C.10 D.11 Q2. based on Lecture 8 (sorting), in order to sort the file, What is the total I/O cost? A. 224,000,000 B. 252,000,000 C. 280,000,000 D. 308,000,000 A.7 B.8 C.9 D.10 Q3. What is the smallest number of buffers that the DBMS can sort the target file using 8 passes?

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

A File was sorted by key field, and then 10 records were stored in each block. Multi-level Indexing is made here, and 100 indexes are stored in each block. To find a specific record, the total number of block accesses is less than 4. Calculate the maximum number of records that make up this file.
CSC 472 Introduction to Database Systems Project Please provide answer to second question; first question is provided for reference. We have a database file with six million pages (6,000,000 pages), and we want to sort it using external merge sort. Assume that the DBMS is not using double buffering or blocked I/O, and that it uses quicksort for in-memory sorting. Assume that the DBMS has six buffers. How many runs will you produce in the second pass (Pass #1)? Group of answer choices 1,000,000 200,000 1,000,001 200,001 3,334 Refer to the previous question. How many passes does the DBMS need to perform in order to sort the file completely? (Note: an online log calculator can be found at https://www.calculator.net/log-calculator.html (Links to an external site.)) Group of answer choices 6 11 12 13 10
We have a database file with ten million pages (N = 10,000,000 pages), and we want to sort it using external merge sort. Assume that the DBMS uses quicksort for in- memory sorting. Let B denote the number of buffers. What is the smallest number of buffers B that the DBMS can sort the target file using only four passes?
Design a direct file organization using a hash function, to store an item file withitem number as its primary key. The primary keys of a sample set of records ofthe item file are listed below. Assume that the buckets can hold two records eachand the blocks in the primary storage area can accommodate a maximum of fourrecords each. Make use of the hash function h(k) = k mod 8, where k represents thenumerical value of the primary key (item number).369 760 692 871 659 975 981 115 620 208 821 111 554 781 181 965
A file has a dense secondary index with blocking factor equal to 64 index entries per block. If the total number of blocks for the first index level is 1024 blocks, answer the following questions: What is the total number of blocks needed for the second and third level indexes? How many blocks need to be accessed to access a record in this three level index?
Assume you have a database table with 10,000 records and you want to retrieve all records that satisfy a certain condition using a binary search algorithm. On average, how many comparisons would be needed to retrieve all the records?
Compute total no of blocks} Consider a file of 8192 records. Each record is 16 bytes long and its key field Is of size 6 bytes. The file is ordered on a key field, and the file organization is unspanned. The file is stored in a file system with block size 512 bytes, and the size of a block pointer is 10 bytes. If the primary index is built on the key field of the file, and a multilevel index scheme is used to store the primary index, number of first-level and second level blocks in the multilovel index are the respectively 16 and 1 b. 32 and 1 16 and 2 8 and 1 c. d.
Suppose that one block in a disk can store either 8 records or 16 key pointers. If a database contains 1024 records, how many blocks do we need to store the data file and the dense index P
For on ordered file based on non-key attribute, the following index can be created: Clustering. Both Primary and Secondary. Secondary. O Primary. If an index file includes one entry for each record in the data file, hence it is called: Dense index. O Non-dense index.
41. If several requests have different deadlines that are relaticely close together, then using the SCAN – EDF algorithm : a. the SCAN ordering will service the requests in that batch b. the EDF ordering will service the requests in that batch c. the FCFS ordering will service the requests in that batch d. none of the mentioned
Design a direct file organization using a hash function, to store an item file with item number as its primary key. The primary keys of a sample set of records of the item file are listed below. Assume that the buckets can hold two records each and the blocks in the primary storage area can accommodate a maximum of four records each. Make use of the hash function h(k) = k mod 8, where k represents the numerical value of the primary key (item number).369 760 692 871 659 975 981 115 620 208 821 111 554 781 181 965 don't copy bartleby old answer its wrong
Design a direct file organization using a hash function, to store an item file with item number as its primary key. The primary keys of a sample set of records of the item file are listed below. Assume that the buckets can hold two records each and the blocks in the primary storage area can accommodate a maximum of four records each. Make use of the hash function h(k) = k mod 8, where k represents the numerical value of the primary key (item number).369 760 692 871 659 975 981 115 620 208 821 111 554 781 181 965