adplus-dvertising
frame-decoration

Question

If a relation can have more than one record containing the same search key value, the search key is said to be a __________

a.

Unique search key

b.

Non unique search key

c.

Multiple search key

d.

Identical search key

Posted under Indexing and Hashing DBMS

Answer: (b).Non unique search key

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. If a relation can have more than one record containing the same search key value, the search key is said to be a __________

Similar Questions

Discover Related MCQs

Q. State true or false: The fanout of nodes can be increased by using a technique called _________

Q. Insertion of a large number of entries at a time into an index is referred to as _______ of the index.

Q. ___________ are the indices that store the values of some attributes along with the pointers to the record.

Q. The term ______ is used to denote a unit of storage that can store one or more records

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 __________

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

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

Q. What is a bucket overflow?

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

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

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

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

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

Q. Dynamic hashing allows us to?

Q. Dynamic hashing is also called as _________

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

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

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

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?