Correct answer: (C) file records have the same order as index entries
Explanation
Clustering concerns physical record order relative to the indexing order, rather than whether indexed fields form a key. If data records follow the same order as index entries, nearby index keys lead to nearby records. Thus C.
More File Organization and Indexing (B and B+ Trees) questions
GATE 2011 CS (CS1) Q49– A large relation r has attributes A₁,…,Aₙ. Q₁ projects A₁,…,Aₙ after selecting Aₚ=c. Q₂…
GATE 2010 CS (CS1) Q28– A B+ tree allows at most five keys per node. Find the minimum number of keys in any…
GATE 2015 CS (CS2) Q32– For the B+ tree of order 1 shown, find the minimum number of index nodes, including the…
GATE 2015 CS (CS3) Q39– A B+ tree has 12-byte search keys, 1024-byte blocks, 10-byte record pointers and 8-byte…
GATE 2021 CS (CS2) Q31– A sorted data file has 150000 student records and 4096-byte blocks. Disk record pointers…
GATE 2026 CS (CS2) Q46– An index in a DBMS is said to be dense if an index entry appears for every search-key…