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
I got this question by my school principal while I was bunking the class.
The above asked question is from B+ trees topic in portion Indexing and Hashing of RDBMS