Database General Idea:

(Yes/No) Is every table in an SQLite on-disk database stored in its own file? ________

What kinds of indexes are supported in SQLite? a) B-tree indexes, b) hash indexes, or c) both ___________

(True/False) B-tree indexes are used in SQLite to store both tables and indexes. _______

(True/False) SQLite tables that store system information are stored as B-trees. _______

(Yes/No) Is it possible to create an SQLite index on only specified rows of a table? _______

f. The cost of searching a B+ tree is closely related to: a) the number of nodes in the tree, b) the depth of the tree, or c) the value of the smallest search key at the root node of the tree? ______

True or false: B+ trees can be used to find all records with search keys belonging to a certain range. True_____ False_____

Assuming good design, which do you expect to give the faster search result? a) a search tree, b) a hash table. ___________

True or false: a benefit of a B+ tree is that it stays balanced as updates occur. True______ False_____.

True or false: In a hash table, the need for overflow buckets increases if the hash function does not assign search keys to buckets in a random way. True______ False _______

What works better for a query that specifies a range of values: a) an ordered index, or b) a hash table? ______

(This question requires the use of Google) With MySQL, can a database administrator specify that a hash index is to be used with a table? Yes _____ No ______

(Fill in the blank) In the worst case, lookup using a hash table is no better than ______________________________.

All nodes in a B+ tree contain search keys. Pointers to file records are contained in: a) all nodes, b) leaf nodes only, or c) non-leaf nodes only? _______

When B+ trees are used in databases, a non-leaf node of the tree will often have a hundred or more child nodes. Why? Is it: a) because a node is taken to be the same size as a disk block, b) to save on pointer storage, or c) to increase disk accesses. _______