[Haskell-cafe] STM, IO and b-trees

[Ben]

for sake of argument, suppose an enterprising haskell newbie wanted to
code up concurrent b-trees (really b-link trees) in haskell.  if i am
understanding STM correctly, it will NOT help in any way with the
implementation, because of the IO-intensive nature of the algorithms?
so i will have to resort to the usual games with locks and latches?

(using

Ibrahim Jaluta, Seppo Sippu and Eljas Soisalon-Soininen. Concurrency
control and recovery for balanced B-link trees. The VLDB Journal,
Volume 14, Issue 2 (April 2005), Pages: 257 - 277, ISSN:1066-8888.

as a source for b-tree algorithms.)

take care, B