On 25/07/06, [EMAIL PROTECTED] <[EMAIL PROTECTED]> wrote:
!snip!
[for the record, the bit i stumbled over was the underlying tag/keyword store. so many trade-offs in b-tree algorithms, and was that really what i wanted anyway?]
This just reminded me of one of Caerwyn's Inferno projects: http://www.caerwyn.com/ipn/2005/07/lab-34-lexis-semantic-binary-model.html He'd be better able to say, but it should be possible to construct a namespace so it can search upas/fs mailboxes too. Presuming that using Inferno programs isn't a problem ... -- Darren Bane
