There is no perfect hash function that will give an unique location every time it is called. So BTrees will be faster no doubt.
Also note that with BTrees (or B+Trees) it is easier to retrieve data filtered on range(s) of keys. --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
