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

Q. Intersection of the bitmaps is done by

View solution

Q. What does an existence bitmap do?

View solution

Q. The complement operation in bitmaps is done by using

View solution

Q. State true or false: Bitmaps can be combined with B+ trees

View solution

Q. We create an index in SQL using _______ command

View solution

Q. We delete and index in SQL using the ________ command

View solution

Q. State true or false: Intersection operations are extremely slow on bitmaps

View solution

Q. Which of the following operations is used for the union of bitmaps?

View solution

Q. In ordered indices the file containing the records is sequentially ordered, a ___________ is an index whose search key also defines the sequential order of the file.

View solution