Register

MadeEasy Test Series: Databases - Indexing

• edited by
411 views

1 Answer

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

Related questions

1.2k
views
1 answers
2 votes
sumit chakraborty asked Jan 26, 2018
1,185 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 ... largest possible order of a leaf node in a B+ tree implementing this file structure is
User Avatar
1.5k
views
2 answers
2 votes
nish kim asked Jan 19, 2018
1,453 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 ______.
User Avatar
1.8k
views
2 answers
2 votes
souravsaha asked Jan 15, 2018
1,786 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 ... 63 as the answer, but in the solution, it's saying 64. Can anyone check?
User Avatar
644
views
0 answers
2 votes
Abhishek Kumar Singh asked Jan 4, 2018
644 views
MadeEasy Test Series: Databases - Indexing
#DBMSWhich of the following statements is/are true?(A) For any data file it is possible to construct two separate sparse first level indexes on different keys ... first level index and a dense second level index both should be useful.
User Avatar
Link Copied!