A B+ tree would have one pointer for every data record at the leaf level. You could additionally group a bunch of data records together and have a single pointer from leaf to the data block. The trade-off is that you will have to fetch the data block and sequentially parse it to search for an element.
On Jul 27, 1:07 pm, himanshu kansal <[email protected]> wrote: > if u hv say 20 million records and u have to create a b+ tree then you > might be storing 20 million pointers at the leaf level....how can u > optimize this(using b+ tree only)??????? -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
