Q. In a __________ , we obtain the address of the disk block containing a desired record directly by computing a function on the search key value of the record

View solution

Q. In a __________ we organize the search keys, with their associated pointers, into a hash file structure

View solution

Q. What is a bucket overflow?

View solution

Q. Some buckets are assigned more records than the others which causes bucket overflow, this condition is called as ________

View solution

Q. Overflow handling using a linked list of buckets is called as ____________

View solution

Q. State true or false: A hash index organizes the search keys, with their associated pointers, into a hash file structure

View solution

Q. Which of the following is the worst hash function among the given choices

View solution

Q. State true or false: Hash indices are only primary index structures

View solution

Q. Dynamic hashing allows us to?

View solution

Q. Dynamic hashing is also called as _________

View solution

Q. Which of the following operations can be performed on an extendable hash structure?

View solution

Q. The space overhead in dynamic hashing is ________ than that of static hashing

View solution

Q. Which of the following is a disadvantage of the dynamic hashing structure

View solution

Q. The form of dynamic hashing that avoids the additional level of indirection is called as _________

View solution

Q. Hash structures are not the best choice for which of the following?

View solution

Q. Which of the following is an issue that needs to be considered while choosing an indexing technique?

View solution

Q. Which of the following hash function classifies data into least number of buckets?

View solution

Q. Which of the following hash function classifies data into the highest number of buckets ?

View solution

Q. A bitmap is _______

View solution

Q. A _________ on the attribute A of relation r consists of one bitmap for each value that A can take

View solution