I am using MemoryIndex in a similar scenario. I have not as many queries though, less than 100, but several 'articles' coming per second.
Works nicely. On Sun, Nov 23, 2008 at 10:00 AM, Erik Hatcher <[EMAIL PROTECTED]> wrote: > > On Nov 22, 2008, at 10:57 PM, Ian Holsman wrote: >> >> Hi. apologies for the off-topic question. > > Not off-topic at all! > >> I was wondering if anyone knew of a open source solution (or a pointer to >> the algorithms) >> that do the reverse of lucene. >> By that I mean store a whole lot of queries, and run them against a >> document to see which queries match it. (with a score etc) >> >> I can see the case for this would be a news-article and several people >> writing queries to get alerted if it matched a certain condition. > > This use-case was the reason MemoryIndex was created. It's a fast single > document index where incoming documents could be sent in parallel to the > main index - and slamming a bunch of queries at it. There's also > InstantiatedIndex to compare to, as it can handle multiple documents. > > Erik > > > --------------------------------------------------------------------- > To unsubscribe, e-mail: [EMAIL PROTECTED] > For additional commands, e-mail: [EMAIL PROTECTED] > > --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]