@Dumanshu: A B+ tree is a multi-level index. It indexes the index until the final level is small enough to fit into a data block that can fit in memory.
On Jul 27, 10:11 pm, Dumanshu <[email protected]> wrote: > Use multilevel indexing > > On Jul 27, 11: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.
