Question
a.
Linear hashing
b.
Static hashing
c.
Directive hashing
d.
Indirective hashing
Posted under DBMS
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. The form of dynamic hashing that avoids the additional level of indirection is called as _________
Similar Questions
Discover Related MCQs
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
Q. Indices whose search key specifies an order different from the sequential order of the file are called ___________ indices.
View solution
Q. An ____________ consists of a search-key value and pointers to one or more records with that value as their search-key value.
View solution
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.
View solution
Q. In a __________ index, an index entry appears for only some of the search-key values.
View solution
Q. Incase the indices values are larger, index is created for these values of index. This is called
View solution
Suggested Topics
Are you eager to expand your knowledge beyond DBMS? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
