edited by
1,092 views
2 votes
2 votes
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
edited by

1 Answer

Related questions

2 votes
2 votes
2 answers
1
nish kim asked Jan 19, 2018
1,265 views
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...