Register

#file structure

303 views
0 votes
0 votes
Q. suppose the order of b-tree is 23. then how many index records will be stored in level 4(including root as level 1)
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

1 votes
1 votes
1 answer
1
Don't you worry asked Jun 3, 2016
2,488 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
2
Purple asked Jan 25, 2016
8,781 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
0 votes
0 votes
2 answers
3
shefali1 asked Dec 10, 2016
610 views
#dbms #file structure
The order of a leaf node in a B+ tree is the maximum number of (value, data record pointer), it can hold. Given that the block size is 5 Kbyte, field is 9 byte long and a block pointer is 6 byte long, what is the order of the leaf node?
The order of a leaf node in a B+ tree is the maximum number of (value, data record pointer),it can hold. Given that the block size is 5 Kbyte, field is 9 byte long and a ...
User Avatar
Link Copied!