Ah, yes, I could use Datalog, but I need a couple of other things it doesn't do right now—namely, cached derived relations. But in any case, Datalog is a good example of the second choices for both the first and second questions.
What I'm interested in, though, are the relative merits of both approaches to both questions—what would be the best/fastest/most- efficient/elegant/idiomatic/Clojure-y ways: vectors or maps, one ref or many little refs. For those people who use the Contrib's Datalog, how is its performance? (Come to think of it, there's also a third way to manage relations' data internally: instead of a set of tuples/maps, a map of indexes to tuples/maps. It'd probably be the fastest, but perhaps harder to edit?) On Dec 4, 4:37 pm, "Alex Osborne" <a...@meshy.org> wrote: > samppi <rbysam...@gmail.com> writes: > > I want to create a little Clojure library that creates cached > > relational systems in the style of Ben Moseley's "Out of the Tar > > Pit" (http://web.mac.com/ben_moseley/frp/paper-v1_01.pdf), which is > > something that I think would serve me better than just nested maps for > > something. > > You may already know about it, but if you don't, you might also like to > take a look at clojure.contrib.datalog. There's some documentation here: > > http://code.google.com/p/clojure-contrib/wiki/DatalogOverview -- 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 Note that posts from new members are moderated - please be patient with your first post. 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
