Hi, In reality there is no perfect hash function since database tend to store large data...hash may get destructive many time if hash function is not correctly..BTrees gives us bushy nature so...its fast as compared..
Now-a-days BTrees usage has also got down...databases are now using R-trees and R+ trees which are more effective.. cheers, koushik On 4/19/07, C++4LifePuta <[EMAIL PROTECTED]> wrote: > > > A programmer friend of mine told me that research was done and for > database applications, B-Trees were faster on average as opposed to > hashes. > > I thought about this for a minute and could only come up with maybe > the amount of data they are storing is so large that a resonably > unique hash function could not always be derived resulting in frequent > collisions. > > Any thoughts on this? > <first time poster> > > > > > -- *************************************************************** 30 years from now it doesn't matter which shoe you wore,which branded jean you wore..what all matters is WHAT YOU HAVE LEARNED AND HOW YOU HAVE USED IT. http://students.iiit.ac.in/~koushik_c --~--~---------~--~----~------------~-------~--~----~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
