Exam 8: Physical Database Design

arrow
  • Select Tags
search iconSearch Question
flashcardsStudy Flashcards
  • Select Tags

File structures,data placement,data formatting,and denormalization are all ____________ of the physical database design process.

(Short Answer)
4.9/5
(35)

Which of the following is true about access plan execution?

(Multiple Choice)
4.8/5
(22)

Which one of the following is true about B-trees (including B-tree variations)?

(Multiple Choice)
4.9/5
(36)

A dominant RAID architecture which uses both data and error-correcting pages to improve reliability is ____________.

(Short Answer)
4.8/5
(39)

A physical record:

(Multiple Choice)
4.7/5
(34)

In selecting an index,a column that has almost unique values is a good choice for a clustering index if it is used in equality conditions.

(True/False)
4.8/5
(32)

A(n)_____________ file is a specialized file structure that transforms a key value into a physical record address to provide fast access to the data.

(Short Answer)
4.9/5
(34)

One of the dominant RAID architectures,___________ involves a full mirror or redundant array of disks,on which each physical record is written to both arrays in parallel.

(Short Answer)
4.8/5
(36)

The table EMPLOYEE with primary key = empno uses as hash function empno Mod 100, which gives the physical record number when applied to Empno. The linear probe procedure is used for collision handling. The physical records are created in the order of logical records (= rows) in the table, one physical record for one logical record EMPLOYEE Empno 2011 2012 2211 2311 2312 2313 2317 -Which logical record (identified by empno)is stored at physical address 13?

(Multiple Choice)
4.9/5
(40)

A Sequential File is a simple file organization in which records are stored in insertion order or by key value.

(True/False)
4.9/5
(34)

Bitmap indexes are a good alternative to Btree index nodes when the columns to be indexed contain only a few values.

(True/False)
4.7/5
(28)

The B+tree structure improves the performance of sequential searches over Btree because the leaf nodes are connected together so that the search does not have to move up and down the tree.

(True/False)
4.8/5
(22)

In hash files,if a collision occurs because two keys hash to the same physical address,one method for locating a physical record with free space is a linear probe.

(True/False)
4.8/5
(30)

A logical record may be split across several physical records.

(True/False)
4.8/5
(40)

Which of the following contributes to the difficulty of physical database design?

(Multiple Choice)
4.8/5
(28)

INSERT and DELETE statements affect only the indexes of the records being added or deleted.

(True/False)
4.9/5
(33)

In a ____________ index,the order of the data records is close to the index order.

(Short Answer)
4.8/5
(38)

A(n)________________ is a situation that occurs when a hash function assigns the same physical record address to more than one key in a file.

(Short Answer)
4.8/5
(29)

You should avoid creating too many indexes on tables which will have many insertion and/or deletion operations.

(True/False)
5.0/5
(36)

A(n)______________ is a collection of bytes that are transferred between volatile storage in main memory and stable storage on a disk.

(Short Answer)
5.0/5
(38)
Showing 21 - 40 of 76
close modal

Filters

  • Essay(0)
  • Multiple Choice(0)
  • Short Answer(0)
  • True False(0)
  • Matching(0)