> Excellent point, your last comment gives me a tangible incentive for using
> hash instead of btree. Since I don't need to use other operators than '=',
> there is really no need to spend extra time creating a btree while all I
> need is a hash table. In the end, both are as fast for searching, but I
> gain some additional speed for inserting and removing entries.
Is the hash faster to create?
--
Bruce Momjian | http://www.op.net/~candle
[EMAIL PROTECTED] | (610) 853-3000
+ If your life is a hard drive, | 830 Blythe Avenue
+ Christ can be your backup. | Drexel Hill, Pennsylvania 19026
************
