Re: Lockfree hashtables

Lock-free and wait-free algorithms have been used in various databases, but most people tend to shy away from them because of their complexity, difficulty to debug, and low-level portability issues.

I've used them in the past (lock-free hash tables and skip lists), and they're pretty awesome if used properly, but the majority of PG's current performance problems aren't generally found as part of our hash table implementation (which I'm quite fond of actually).  FWIS, I think we'll look more into this sometime in the future.