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 keyI 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

If a relation can have more than one record containing the same search

1.	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 keyI 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
Answer» The CORRECT option is (B) Non UNIQUE search key For EXPLANATION: If a relation can have more than one record containing the same search key value, the search key is said to be a non-unique search key. A problem with non-unique search keys is inefficiency during delete operations.

Discussion

No Comment Found

Related InterviewSolutions

Which of the following operations is used for the union of bitmaps?(a) Logical AND(b) Logical OR(c) Logical NOT(d) Logical NORI got this question in a national level competition.My query is from Bitmap Indices topic in portion Indexing and Hashing of RDBMS
State true or false: Intersection operations are extremely slow on bitmaps(a) True(b) FalseI have been asked this question at a job interview.This interesting question is from Bitmap Indices topic in portion Indexing and Hashing of RDBMS
We delete and index in SQL using the ________ command(a) Remove index(b) Delete index(c) Drop index(d) None of the mentionedThe question was posed to me in class test.The above asked question is from Bitmap Indices in division Indexing and Hashing of RDBMS
We create an index in SQL using _______ command(a) Create index(b) New index(c) Create new index(d) Develop indexI have been asked this question in exam.The query is from Bitmap Indices topic in portion Indexing and Hashing of RDBMS
State true or false: Bitmaps can be combined with B+ trees(a) True(b) FalseThis question was addressed to me in quiz.The question is from Bitmap Indices topic in portion Indexing and Hashing of RDBMS
The complement operation in bitmaps is done by using(a) Logical AND(b) Logical OR(c) Logical NOT(d) Logical NORI have been asked this question in class test.Question is taken from Bitmap Indices topic in portion Indexing and Hashing of RDBMS
What does an existence bitmap do?(a) It recognizes deleted records(b) It inserts values into empty bitmaps(c) It makes sure that no records are deleted(d) None of the mentionedI have been asked this question in an online quiz.I'm obligated to ask this question of Bitmap Indices in portion Indexing and Hashing of RDBMS
Intersection of the bitmaps is done by(a) Logical AND(b) Logical OR(c) Logical NOT(d) Logical NORI got this question by my college professor while I was bunking the class.The query is from Bitmap Indices topic in chapter Indexing and Hashing of RDBMS
A _________ on the attribute A of relation r consists of one bitmap for each value that A can take(a) Bitmap array(b) Bitmap index(c) Bitmap excess(d) BitmapI got this question in an international level competition.The query is from Bitmap Indices topic in portion Indexing and Hashing of RDBMS
A bitmap is_______(a) An array of bits(b) An index of bits(c) A function mapping all the bits of data(d) None of the mentionedI got this question in an online interview.My doubt is from Bitmap Indices topic in section Indexing and Hashing of RDBMS

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment