A on an attribute of a relation is a data structure that allows the database system to ﬁnd those tuples in the relation that have a speciﬁed value for that attribute eﬃciently, without scanning through all the tuples of the relation.

M

Mr. Dubey • 52.49K Points
Coach

Q. A                  on an attribute of a relation is a data structure that allows the database system to ﬁnd those tuples in the relation that have a speciﬁed value for that attribute eﬃciently, without scanning through all the tuples of the relation.

(A) index

(B) reference

(C) assertion

(D) timestamp

Correct Answer - Option(A)
Views: 280
Filed under category Database Management System (DBMS)

Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. _________ is a pressure type microphone with permanent coil as a transducing element.

Q. Absolute time of an event is modeled as ________

Q. A register that is used to store binary information is called

Q. A decimal counter has states.

Q. When the "voice of customers" is brought into the organization, which of the following organizational structures work best?

Q. efficient implementation of basic communication operation can improve

Q. The iterator maintains the of its execution in between calls so that successive next() requests receive successive result tuples.

Q. Activity diagram is a special kind of ________

Q. A technique used by codes to convert an analog signal into a digital bit stream is known as

Q. Does the level shifter converts the voltage levels between RS-232 and transistor-transistor logic.

Question analytics