Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by yoginandal
4
answers
1
B+ Tree Find Order
In a database file, the search key field is 9 bytes long the block size is 512 bytes, a record pointer is 6 bytes and block pointer is 7 bytes. The largest possible order of a non leaf node in B+ tree implementing this file structure {order defines maximum number of keys ... <= 518 n <= 39.84 order = 39 Answer given as 31 . How is this possible . Correct me if i am wrong
In a database file, the search key field is 9 bytes long the block size is 512 bytes, a record pointer is 6 bytes and block pointer is 7 bytes. The largest possible order...
8.8k
views
answered
Jan 20, 2020
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register