Exam 8: Physical Database Design
Exam 1: Introduction to Database Management76 Questions
Exam 2: Introduction to Database Development76 Questions
Exam 3: The Relational Data Model75 Questions
Exam 4: Query Formulation With SQL75 Questions
Exam 5: Understanding Entity Relations76 Questions
Exam 6: Developing Data Models for Business Databases75 Questions
Exam 7: Normalization of Relational Tables76 Questions
Exam 8: Physical Database Design76 Questions
Exam 9: Advanced Query Formulation With SQL74 Questions
Exam 10: Application Development With Views75 Questions
Exam 11: Stored Procedures and Triggers76 Questions
Exam 12: View Design and Integration76 Questions
Exam 14: Data and Database Administration76 Questions
Exam 15: Transaction Management75 Questions
Exam 16: Data Warehouse Technology and Management78 Questions
Exam 17: Client-Server Processing and Distributed Databases76 Questions
Exam 18: Object Database Management Systems83 Questions
Select questions type
In index matching,the condition in the WHERE clause can never contain pattern matching (using the keyword LIKE),regardless of whether the index is a single-column or a composite index.
Free
(True/False)
4.8/5
(33)
Correct Answer:
False
Although they are useful when more than 5% of the rows of a file must be retrieved,clustering indexes are harder to maintain than a non-clustering index when data is modified.
Free
(True/False)
4.8/5
(33)
Correct Answer:
True
Different hash functions may be used on different attributes of the same table.
Free
(True/False)
4.8/5
(35)
Correct Answer:
False
A database consists of the tables STUDENT (PK = sno, sname, major), COURSE (PK = cno, major, ), OFFERINGS (PK = cno and ofno, ), ENROLLMENT (sno, cno, ofno, grade). All tables satisfy BCNF. Overall_gpa and gpa_in_major are computed for each student.
-There is a DBMS with 3 disks that can be read and written in parallel and a file that contains the following sequential physical records: PR1,PR2,PR3,PR4,PR5,PR6,PR7,PR8,PR9.The records are allocated in sequence to disk stripes.Select the correct statement:
(Multiple Choice)
4.8/5
(34)
In a(n)_________________ file,the most popular variation of the Btree,all keys are stored redundantly in the leaf nodes.
(Short Answer)
5.0/5
(34)
A simple file structure in which records are stored by a key value is a(n)_________________ file.
(Short Answer)
4.8/5
(37)
In the processing of an SQL statement by the DBMS,a relational algebra query is the output of:
(Multiple Choice)
4.9/5
(40)
In Btree file structures,the physical record size,the key size and the pointer size determine node capacity.How many <key,pointer> pairs can be stored in a node if the physical record size is 1024 bytes,the key size is 8 bytes,and the pointer size is 8 bytes? __________
(Short Answer)
4.7/5
(30)
A simple file structure in which records are stored in the order they are inserted is a(n)_________________ file.
(Short Answer)
4.7/5
(32)
Figuer:
-The following operation should be performed in AA:

(Multiple Choice)
4.7/5
(28)
Figuer:
-Each node of the B-tree can contain at most 4 keys.To delete the records with key = 30 and key = 20,do the following:

(Multiple Choice)
4.8/5
(38)
Periodic reorganization of a file as it becomes too full is necessary for both static hashing and Btree file structures.
(True/False)
4.8/5
(39)
Using the index matching rules on a table with indexes created on columns C1,C2,C3,and C4,list the column(s)that would be matched if the WHERE clause contained the conditions "C2 = 10 AND C1 BETWEEN 15 AND 20 AND C3 <= 4"._____________
(Short Answer)
4.8/5
(37)
In the processing of an SQL statement by the DBMS,code generation:
(Multiple Choice)
4.9/5
(32)
In order to optimize queries,some DBMSs allow the programmer to use hints that influence the access plan,but these should be used cautiously because a hint will override the optimizer.
(True/False)
4.7/5
(33)
In a hash file,if two keys hash to the same physical address it is referred to as a contraction.
(True/False)
4.8/5
(33)
To analyze value distribution in a table,a ___________________ is often used,which is a two-dimensional graph where the x-axis represents the column ranges and the y-axis represents the number of rows containing the range of values.
(Short Answer)
4.8/5
(29)
A database consists of the tables STUDENT (PK = sno, sname, major), COURSE (PK = cno, major, ), OFFERINGS (PK = cno and ofno, ), ENROLLMENT (sno, cno, ofno, grade). All tables satisfy BCNF. Overall_gpa and gpa_in_major are computed for each student.
-Which of the following is not true of having sname as an attribute of ENROLLMENT?
(Multiple Choice)
4.9/5
(34)
List three characteristics of a Btree file structure that lend themselves to the possible meaning of the B in the name: _________________________
(Short Answer)
4.8/5
(31)
Showing 1 - 20 of 76
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)