I think it's a bit premature for that yet. I think the differently- rendered missing links feature is pretty critical, not just a frill. In the short term the hardware will bail us out until we can find a solution. Along those lines, I'd like to ask for some feedback: if I do the Bloom filter in shared memory thing, I can choose parameters to optimize things. So here's the first question: Bloom filters have no false negatives (that is, there's no risk that they'll show an existing page as non-existing), but there are false positives. What is an acceptable false-positive rate? With a 16-bit filter, the rate will be one in 65,000; I think that's a bit too high. With a 32-bit filter, it's one in 4 billion, which seems reasonable. 24 bits is one in 16 million, which might also be OK. A 32-bit filter for 200,000 pages will fit into 2Mb of memory, which seems reasonable. It would require a 768-bit hash function. Anybody have recommendations for a good 768-bit hash function for titles? Alternatively, 2Mb is probably enough space for a traditional hash table of titles and article IDs, provided the average length of a title isn't too long, and there's some reasonably efficient storage method for it. -- Lee Daniel Crocker &lt;lee(a)piclab.com&gt; <http://www.piclab.com/lee/> "All inventions or works of authorship original to me, herein and past, are placed irrevocably in the public domain, and may be used or modified for any purpose, without permission, attribution, or notification."--LDC