Register

check the question

424 views
2 votes
2 votes
Given a data file with 100 records per pages and on index page capacity of 512 index entries, how deep should be the B++ tree to index this file.
User Avatar

1 Answer

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

Related questions

0 votes
0 votes
1 answer
2
Don't you worry asked Jun 3, 2016
1,465 views
.The data dictionary tells the DBMS
A. what files are in the database B. what attribute are possessed by the data C. what these files contain D. All of the above
A. what files are in the databaseB. what attribute are possessed by the dataC. what these files containD. All of the above
User Avatar
1 votes
1 votes
1 answer
3
Don't you worry asked Jun 3, 2016
2,497 views
Each of data files has a _____ that describe the way the data is stored in the file.
A. File structure B. Records C. Fields D. Database
A. File structureB. RecordsC. FieldsD. Database
User Avatar
1 votes
1 votes
1 answer
4
Purple asked Jan 25, 2016
8,797 views
Which is the best file organization when data is frequently added or deleted from a file? IETE_ELAN
Which is the best file organization when data is frequently added or deleted from a file? (A) Sequential (B) Direct (C) Index sequential (D) None of the above
Which is the best file organization when data is frequently added or deleted from a file?(A) Sequential (B) Direct(C) Index...
User Avatar
Link Copied!