Consider the following scenario: • A table is sorted on indexed column and has 20,000,000 rows. Each row is 300 bytes. . • Table and index blocks are 4 kilobytes. Assume 1 kilobyte is approximately 1,000 bytes. • Assuming the index is sparse, how many entries are in the index? 000,000,000 entries

Consider the following scenario: • A table is sorted on indexed column and has 20,000,000 rows. Each row is 300 bytes. . • Table and index blocks are 4 kilobytes. Assume 1 kilobyte is approximately 1,000 bytes. • Assuming the index is sparse, how many entries are in the index? 000,000,000 entries

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

Consider the bitmap representation of the free-space map, where for each block in the file, two bits are maintained in the bitmap. If the block is between 0 and 30 percent full the bits are 00, between 30 and 60 percent the bits are 01, between 60 and 90 percent the bits are 10, and above 90 percent the bits are 11. Such bitmaps can be kept in memory even for quite large files. Outline two benefits and one drawback to using two bits for a block, instead of one byte as described earlier in this chapter. Describe how to keep the bitmap up to date on record insertions and deletions. c .Outline the benefit of the bitmap technique over free lists in searching for free space and in updating free space information.
Consider the bitmap representation of the free-space map, where for eachblock in the file, two bits are maintained in the bitmap. If the block is between0 and 30 percent full the bits are 00, between 30 and 60 percent the bits are01, between 60 and 90 percent the bits are 10, and above 90 percent the bitsare 11. Such bitmaps can be kept in memory even for quite large files. Describe how to keep the bitmap up to date on record insertions and deletions.
Consider the bitmap form of the free-space map, in which two bits are kept in the bitmap for each block in the file. If the block is between 0 and 30% filled, the bits are 00, between 30% and 60% full, 01, between 60% and 90% full, and over 90% full, the bits are 11. Even for very big data, such bitmaps may be retained in memory. Explain how to maintain the bitmap updated with record insertions and deletions.
Consider a file system that uses contiguous allocation method. For a disk consists of 100 data blocks, each block is 4KB. What is the maximum and minimum number of files of size 15KB can it save? Find the number of files the disk able to support using (1) link allocation and (2) index allocation, assuming the address is 32 bit.
Consider the following code snippet in C: char *base_url = malloc(11 * sizeof(char)); printf("Enter an 11 character URL: "); scanf("%s", base_url); char src[11]; char dst[11]; // copies base_url to src strncpy(src, base_url, 11); // copies src to dest strcpy(dst, src); printf("src: %s dst: %s\n", src, dst); Identify at least one potential buffer overflow vulnerability and explain why/how it can be exploited (i.e., not just that it’s a buffer overflow, but where the problem will manifest itself).
Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving a request at cylinder 2,150, and the previous request was at cylinder 1,805. The queue of pending requests, in FIFO order, is:2,069 1,2122,2962,8005441,6183561,5234,9653681a. FCFSb. SSTFc. SCANd. LOOKe. C-SCANf. C-LOOK
Consider a file system that uses indexed file allocation. Disk block size is 1K-byte, and a file pointer is 64 bits (8-bytes). If we assume that an i-node just holds 2 direct entries and 4 single indirect entries, what is the maximum size of a file the system can allow? List the steps that lead to your conclusion.
Consider a Data file of r=30,000 EMPLOYEE records of fixed-length, consider a disk with block size B=512 bytes. A block pointer is P=6 bytes long and a record pointer is P R =7 bytes long. Each record has the following fields: NAME (30 bytes), SSN (9 bytes), DEPARTMENTCODE (9 bytes), ADDRESS (40 bytes), PHONE (9 bytes), BIRTHDATE (8 bytes), SEX (1 byte), JOBCODE (4 bytes), SALARY (4 bytes, real number). An additional byte is used as a deletion marker. Calculate the record size R in bytes. Calculate the blocking factor bfr and the number of file blocks b assuming an unspanned organization. Suppose the file is ordered by the key field SSN and we want to construct a primary index on SSN. Calculate the index blocking factor bfr .
Suppose that there is a file system with blocks of 512 bytes in size. For each inode, there are 20 direct blocks, 2 singly-indirect blocks, and 2 doubly-indirect blocks. The size of a pointer is 4 bytes. Calculate the maximum possible size of a file in bytes. Show your work.
CA_6 We study the properties of cache memory, and for reasons of easier design and efficient circuits, we assume that the cache capacity is 2i Bytes, and cache line size is 2j Bytes, with i and j being natural numbers: (a) How many bits should the tag field have? And can the tag field contain 0 bit (i.e., be empty)? Elaborate (b) Repeat the above for the index field. (c) Repeat the above for the byte-offset field. (d) Finally, depict a figure showing a cache line, indicate what fields it possibly has, state the possible sizes of these fields, and explain the uses of these fields.
Write a R script to create a matrix as given below and display it in the output. 21 26 31 3622 27 32 3723 28 33 3824 29 34 39
In the variable-length record representation, a null bitmap is used to indicateif an attribute has the null value. In some applications, tuples have a very large number of attributes, most of which are null. Can you modify the record representation such that the only overhead for a null attribute is the single bit in the null bitmap?