Register

MadeEasy Test Series: Databases - Indexing

• edited by
380 views
1 votes
1 votes

A file is organized so that the ordering of data record is same as or close to the ordering of data block in some index. Then that index is called

  1. Dense
  2. Sparse
  3. Clustered
  4. Unclustered 

Given answer is :- Sparse. Is it correct?

This is similar to https://gateoverflow.in/8222/gate2015-1_24 with some variation i highlighted

• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
1
sumit chakraborty asked Jan 26, 2018
1,137 views
MadeEasy Test Series 2018: Databases - Indexing
In a database file structure, the search key field is 9 bytes long, the block size is 1024 bytes, a record pointer is 7 bytes and a block pointer is 6 bytes. The largest possible order of a leaf node in a B+ tree implementing this file structure is
In a database file structure, the search key field is 9 bytes long, the block size is 1024 bytes, a record pointer is 7 bytes and a block pointer is 6 bytes. The largest ...
User Avatar
2 votes
2 votes
2 answers
2
nish kim asked Jan 19, 2018
1,323 views
MadeEasy Test Series 2018: Databases - Indexing
Database file consist 1250 records. Block can hold either 3 records or (10 keys, 11 pointers). The maximum number of levels of index required for sparse B+ tree index for database file are ______.
Database file consist 1250 records. Block can hold either 3 records or (10 keys, 11 pointers). The maximum number of levels of index required for sparse B+ tree index for...
User Avatar
Link Copied!