I've been doing some more research on this. This article seems a good introduction:
http://www.dcc.uchile.cl/~cgutierr/cursos/FDB/p16-bancilhon.pdf It turns out the naive implementation (a bottom-up fixed point iterator) is pretty easy to understand, and would not be hard to implement -- minus some hairy graph algorithms to get the stratified negation stuff right, and some other optimizations. In fact, it is an almost-freaking-perfect example of something that can run on map/ reduce. I *expect* that a lot of the implementation you find of this stuff will be very good single threaded versions with focus on minimising disk activity, which is not what we want. There is a lot of parallelism to be exploited here. This is a good target for Clojure, I believe. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en -~----------~----~----~----~------~----~------~--~---
