No, because I never visit the site directly. Instead, I read through an RSS reader.

Interesting, because I always click the comments link in Google Reader rather than the article. I read the comments first to get a sense of whether I will read the article or not.

And that's what it did. As the article said, an assertion failed and the application died (instead of silently corrupting your data).

What is your criteria for a record being "old"? Once you've established your criteria, just archive the database as it is now and then drop the rows that match your oldness criteria.

I imagine that I have also to query down to the dependent tables?

I might be missing something here, but what about this (I didn't even attempt to run this)? Basically, just call map1 and map2 with a single-number interval, and then apply the function from map3 to that result. This avoids making a local copy, but does require a lot of function calls.

(defun compmap (fn mapper1 mapper2 start end) (cond ((= start end) '()) (else (cons (fn start (+ (mapper1 start start) (mapper2 start start))) (compmap fn mapper1 mapper2 (+ start 1) end)))))

Everything does not have a complexity of one bit. The object you describe with a complexity of 1 bit doesn't specify the object you want. In the permutation, there may be a string that specifies some universe, but then you have to specify where in the permutation that string is and how long it is, thus increasing the complexity required to describe that particular universe object.