Consider the two internal organizations for heap files (using lists of pages and a directory of pages) discussed in the text. 1. Describe them briefly and explain the trade-offs. Which organization would you choose if records are variable in length?

Consider the two internal organizations for heap files (using lists of pages and a directory of pages) discussed in the text. 1. Describe them briefly and explain the trade-offs. Which organization would you choose if records are variable in length?

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

Given the following data file: STUDENT(ID, SNAME, ADDRESS, LEVEL, GPA, …) Suppose that: record size R = 200 bytes block size B = 512 bytes r = 2000 records Then, Find out: Blocking factor(Bfr) Bfr=B/R Number of file blocks(b) b=r/bfr
Minix Attributes associated with a file can be maintained in several places as discussed inthe course content:a. Within the set of open file descriptorsb. Within the system-wide file table entry for the filec. Within the ‘i-node’ (or ‘v-node’)These attributes can be associated with the actual file (e.g. the file size), or can be associatedwith an open instance of the file (e.g. whether the file is opened for reading or writing, whether thefile is opened for non-blocking I/O, etc.).What would be preferred location of the following attributes of a file and why? Discuss anytradeoffs if that attribute could be in more than one of the above.a. The owner of the file.b. The “read/write” pointer of the open file.c. Whether the file is opened for reading, writing, or both.
Prepare 2 interview questions about Queue in data structure. State the questions and give the answers in detail.
Implement a city database using a BST to store the database records. Each database record contains the name of the city (a string of arbitrary length) and the coordinates of the city expressed as integer x- and y-coordinates. The BST should be organized by city name. Your database should allow records to be inserted, deleted by name or coordinate, and searched by name or coordinate. Another operation that should be supported is to print all records within a given distance of a specified point.Collect running-time statistics for each operation. Which operations can be implemented reasonably efficiently (i.e., in O(log n) time in the average case) using a BST? Can the database system be made more efficient by using one or more additional BSTs to organize the records by location?
The CVT Company is a leader in the manufacture of work clothes. You are hired as database administrator for the company and your IT supervisor asked you to solve a retrieval speed problem they used to have with a large file for item records. Your supervisor mentioned that they have sorted the file but the problem didn’t improve, so they need to create a B+ tree index to solve the problem. Your supervisor outlined the way to do it: “The best way to accomplish this task is to scan the file, record by record, inserting each one using the B+ tree insertion procedure.” Being a fresh graduate, you noticed that since the file is already sorted there is a better way to do it. What performance and storage utilization problems are there with your supervisor’s approach? Explain how the bulk-loading algorithm provides a better alternative than the proposed scheme.
Is the following schedule a serializable schedule? Explain your answer.
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,…
Attributes associated with a file can be maintained in several places as discussed inthe course content:a. Within the set of open file descriptorsb. Within the system-wide file table entry for the filec. Within the ‘i-node’ (or ‘v-node’)These attributes can be associated with the actual file (e.g. the file size), or can be associatedwith an open instance of the file (e.g. whether the file is opened for reading or writing, whether thefile is opened for non-blocking I/O, etc.).What would be preferred location of the following attributes of a file and why? Discuss anytradeoffs if that attribute could be in more than one of the above.a. The owner of the file.b. The “read/write” pointer of the open file.c. Whether the file is opened for reading, writing, or both.
The specification for a typical disk storage system is shown in Table P18.1. An employee file consisting of 100,000 records is stored on the disk. The employee record structure and the size of the fields in bytes (shown in brackets) are given below: Employee Employee number name (6) (20) Designation Address (10) (30) Basic pay (6) Number of platters Number of cylinders Allowances Deductions (20) Number of tracks (surfaces)/cylinder Number of sectors/track Number of bytes/sector Maximum seek time Average seek time Maximum Latency time Average latency time Time to read/write a sector 6 800 10 50 512 50 ms 25 ms 16.66 ms 8.33 ms 0.33 ms (20) Total salary (6) a) What is the storage space (in terms of bytes) needed to store the employee file in the disk? b) What is the storage space (in terms of cylinders) needed to store the employee file in the disk?
What is the Big O categorization of the execution time for constructing the database? Of a single insertion? Of a single removal? Of a single add? Of a single search?