B+ Trees are very wide. If I say that I have a B+ tree with M nodes of order 170 and L nodes of order 30, then I insert a bunch of data (N elements), how tall would the tree be for these values of N?

N = 100; 2,500; 30,000; 4,000,000;

With B+ Tree who has M nodes of order 170 and L nodes of order 30. After I insert 4,000,000 elements it’s a pretty big tree. That said, if I have to update a record, how many disk reads and how many disks writes will be needed to make that happen?

Answer rating: 100% (QA)

Step 1 B Trees are very wide If I say that I have a B tree with M nodes of order 170 and L nodes of order 30 then I insert a bunch of data N elements how tall would the tree be for these values of N N ... View the full answer