@bharath: To store the bunch of records together also, we gonna need another useful ds like "linked list" or "array" which again points to the problem of excessive storage or excessive pointers... correct me if am not..!
On 7/28/11, bharath <bharath.sri...@gmail.com> wrote: > @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 <duman...@gmail.com> wrote: >> Use multilevel indexing >> >> On Jul 27, 11:07 pm, himanshu kansal <himanshukansal...@gmail.com> >> 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 algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
