Question
a.
Bulk loading
b.
Mass insertion
c.
Quick insertion
d.
Quick loading
Posted under Indexing and Hashing DBMS
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Insertion of a large number of entries at a time into an index is referred to as _______ of the index.
Similar Questions
Discover Related MCQs
Q. ___________ are the indices that store the values of some attributes along with the pointers to the record.
View solution
Q. The term ______ is used to denote a unit of storage that can store one or more records
View solution
Q. If K denotes the set of all the search key values, and B denotes the set of all bucket addresses, a function from K to B is called as __________
View solution
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
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!
