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> --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
