Question
a.
it is on a set of fields that form a candidate key
b.
it is on a set of fields that include the primary key
c.
the data records of the file are organized in the same order as the data entries of the index
d.
the data records of the file are organized not in the same order as the data entries of the index
Posted under GATE cse question paper DBMS
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. An index is clustered, if
Similar Questions
Discover Related MCQs
Q. A clustering index is defined on the fields which are of type
View solution
Q. A file is organized so that the ordering of data records is the same as or close to the ordering of data entries in some index. Then that index is called
View solution
Q. Given the following input (4322, 1334, 1471, 9679, 1989, 6171, 6173, 4199) and the hash function x mod 10, which of the following statements are true?
1. 9679, 1989, 4199 hash to the same value
2. 1471, 6171 hash to the same value
3. All elements hash to the same value
4. Each element hashes to a different value
View solution
Q. How many serial schedules are possible using n-transactions?
View solution
Q. Which of the following is wrong?
The goal of concurrent execution is
View solution
Q. Consider the following ordering of transactions:
T1 : R(X); T2 : R(X); T1 : w(x); T1 : r(y); T2 : w(x); T2 : Commit; T1: w(y) ; T1: Commit
Which of the following is true?
View solution
Q. In strict two-phase locking protocol
View solution
Q. Suppose three are 3 transactions T22, T23, T24 with timestamps 10, 20, 30. Now T23 occupies a data item that is required by T22 and T24. Among the four possibilities what will be true in wait–die schema?
View solution
Q. Two transactions T₁ and T₂ are given as follows:
T₁: r₁ (A); w₁(A); r₁ (B); w₁(B)
Find the no. of conflict serializable schedules that can be formed over T₁ and T₂.
View solution
Q. Which of the following schedule are not conflict serializable?
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!