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?

A Guide to SQL

9th Edition

ISBN:9781111527273

Author:Philip J. Pratt

Publisher:Philip J. Pratt

Chapter2: Database Design Fundamentals

Section: Chapter Questions

Problem 11RQ

See similar textbooks

Similar questions

A database must store an employee table consisting of 100000records each of which is 80byteslong. Answer the following questions by assuming these configurations/parameters: B = 512bytes,interblock gap size G = 128bytes, numberof blockspertrack = 256, numberof trackspersurf ace =400. The disk has 8 platters each with two heads (only one head can read at a time of all 16 heads),rotates at 7200rpm, has a track − to − trackseektime(m) of 1ms, s = 12ms, r = 4.16ms, andbtt = 0.03255ms. 1. How many records can be stored per block (blocking factor) using spanned and unspannedconfigurations?2. What is the utilization (%) for the unspanned configuration?3. If the file is physically ordered, what is the average time in milli second to read a record ineach configuration? Can you provide detailed solution?
this is an ITSE 2356 COURSE we use Bob Bryla and Iggy fernandez books as a reference .the question is a case study and the description and requirement as below: The idea here is to export/import/archive/backup data from one of the customer tables into another. There are customer tables within the ITSE-2309 and ITSE-1345 databases. Since the table structures are different in there respective databases - determine which of the tables will need to be modified to accept the incoming data -- or -- maybe the better approach is to create an entirely new table - merging data from both -and -remember -- this will be a new process/responsibilities to be developed in you newly created position. such as new table or modify table and why this option supports organization operations and needs along with output of new table structure and data .
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
Suppose we have a record file constructed according to the SimpleDB specificapoints) Suppose we have a record file constructed according to the SimpleDB specifications. That is, the block size is 400 bytes, an integer occupies 4 bytes, a string requires an integer length plus one byte per character, and each slot of a record page has an integer INUSE/EMPTY flag; records do not span multiple pages. For each of the tables in the sample database (and assuming there are many records in each table, not just the given sample data), determine how many records will fit per block (be sure to show your calculations). Is there any wasted space in any of the blocks?tions. That is, the block size is 400 bytes, an integer occupies 4 bytes, a string requires an integer length plus one byte per character, and each slot of a record page has an integer INUSE/EMPTY flag; records do not span multiple pages. For each of the tables in the sample database (and assuming there are many records in each table,…
Some database systems allow the administrator to choose between two forms of logging: normal logging, used to recover from system crashes, and archival logging, used to recover from media (disk) failure. When can a log record be deleted, in each of these cases, using the recovery algorithm of Section 19.4?
A database has 4 transactions, shown below.TID Date items_boughtT100 10/15/04 {K, A, D, B}T200 10/15/04 {D, A, C, E, B}T300 10/19/04 {C, A, B, E}T400 10/22/04 {B, A, D}Assuming a minimum level of support min_sup = 60% and a minimum level ofconfidencemin_conf = 80%:(a) Find all frequent itemsets (not just the ones with the maximum width/length) using the Apriori algorithm. Show your work—just showing the final answer is not acceptable. For each iteration show the candidate and acceptable frequent itemsets. You should show your work similar to the way the example was done in thePowerPoint slides.(b)List all of the strong association rules, along with their support and confidence values, whichmatch the following metarule, where X is a variable representing customers and itemi denotes variables representing items (e.g., “A”, “B”, etc.).x  transaction, buys(X, item1)  buys(X, item2)  buys(X, item3)Hint: don’t worry about the fact that the statement above uses relations. The point of the…
EXPLAIN WHERE YOU FIND THE The database has 500000 million records A database must store an employee table consisting of 100000records each of which is 80byteslong. Answer the following questions by assuming these congurations/parameters: B = 512bytes,interblock gap size G = 128bytes, numberof blockspertrack = 256, numberof trackspersurf ace =400. The disk has 8 platters each with two heads (only one head can read at a time of all 16 heads),rotates at 7200rpm, has a track − to − trackseektime(m) of 1ms, s = 12ms, r = 4.16ms, andbtt = 0.03255ms. 1. How many records can be stored per block (blocking factor) using spanned and unspannedcongurations?2. What is the utilization (%) for the unspanned conguration?3. If the le is physically ordered, what is the average time in milli second to read a record ineach conguration?
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?
We think other solution in bartleby is wrong so be carefull please. A database must store an employee table consisting of 100000records each of which is 80byteslong. Answer the following questions by assuming these congurations/parameters: B = 512bytes,interblock gap size G = 128bytes, numberof blockspertrack = 256, numberof trackspersurf ace =400. The disk has 8 platters each with two heads (only one head can read at a time of all 16 heads),rotates at 7200rpm, has a track − to − trackseektime(m) of 1ms, s = 12ms, r = 4.16ms, andbtt = 0.03255ms. 1. How many records can be stored per block (blocking factor) using spanned and unspannedcongurations?2. What is the utilization (%) for the unspanned conguration?3. If the le is physically ordered, what is the average time in milli second to read a record ineach conguration?
Assuming that a query has a buffer holding up to 3 blocks, and each block can hold two records. Use merge-sort to sort the following records in ascending order: 10, 11, 1, 5, 90, 1, 2, 101 (a) How many runs will be produced in the whole algorithm and what are the contents of the runs? (b) Clearly identify what the algorithm will do in each merge pass. (c) Over the entire course, how many blocks are transferred from the disk to the memory?
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
Provide two drawbacks for each of the following techniques for storing a relational database: Maintain each relationship in a separate file.

SEE MORE QUESTIONS

Recommended textbooks for you

A Guide to SQL

Computer Science

ISBN:

9781111527273

Author:

Philip J. Pratt

Publisher:

Course Technology Ptr

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781285196145

Author:

Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos Coronel

Publisher:

Cengage Learning

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781305627482

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

A Guide to SQL

Computer Science

ISBN:

9781111527273

Author:

Philip J. Pratt

Publisher:

Course Technology Ptr

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781285196145

Author:

Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos Coronel

Publisher:

Cengage Learning

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781305627482

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

SEE MORE TEXTBOOKS