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
most of the db applications tend to heavily perform range queries which
btrees are excellent for.
range queries are something like
select * from my_table where age > 30 etc
just for fetching exact values (==) hash tables are still faster by using
hash functions like md5. amount of data doesnt matte
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
