Lock free data structures are cool... but not really applicable to
databases. They have a high maintenance overhead, severe complexity,
and will fail when there are many concurrent inserts/deletes to the
structure. I messed with them a year or so ago, and that's what I found
in every implementation.
Pailloncy Jean-Gerard wrote:
Hi,
I read recently a paper
Keir Fraser & Tim Harris, Concurrent Programing without Locks, ACM
Journal Name, vol V, n° N, M 20YY, Page 1-48
About algorithm to manage structure (exemple about red-black tree,
skip list) with dead-lock free property, parallel read, etc.
Does this have been studied for PostgreSQL ?
There is surely some good idea in it.
Cordialement,
Jean-Gérard Pailloncy
---------------------------(end of broadcast)---------------------------
TIP 9: the planner will ignore your desire to choose an index scan if
your
joining column's datatypes do not matc
h
---------------------------(end of broadcast)---------------------------
TIP 8: explain analyze is your friend
