adplus-dvertising
frame-decoration

Question

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

a.

Buckets can be allocated dynamically

b.

Lookup involves additional level of indirection

c.

It involves a lesser space overhead

d.

Hash structure can be modified dynamically

Posted under DBMS

Answer: (b).Lookup involves additional level of indirection

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

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

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

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

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

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

Q. A bitmap is _______

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

Q. Intersection of the bitmaps is done by

Q. What does an existence bitmap do?

Q. The complement operation in bitmaps is done by using

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

Q. We create an index in SQL using _______ command

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

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

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

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.

Q. Indices whose search key specifies an order different from the sequential order of the file are called ___________ indices.

Q. An ____________ consists of a search-key value and pointers to one or more records with that value as their search-key value.

Q. In a _______ clustering index, the index record contains the search-key value and a pointer to the first data record with that search-key value and the rest of the records will be in the sequential pointers.

Q. In a __________ index, an index entry appears for only some of the search-key values.