If you index the queries consider also that they can potentially be
indexed in an optimised form.
For example, take a phrase query for "Alonso Smith". You need only index
one of these terms - an incoming document must contain both terms to be
considered a match. If you chose to index this query on the rare term
"Alonso" you would get far fewer requests to run this query than if you
chose to index the comparitively more common "Smith". Basically any
query with mandatory terms can be "index optimised" to record only the
rarest mandatory term (rarity typically being measured by using a
look-up on some background index).
Cheers,
Mark
Ian Holsman wrote:
Thanks for all the suggestions guys..
This is great!
Andrzej Bialecki wrote:
Ian Holsman wrote:
Hi. apologies for the off-topic question.
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.
http://www.seas.upenn.edu/~svilen/publications/subscribe.pdf
---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
------------------------------------------------------------------------
No virus found in this incoming message.
Checked by AVG - http://www.avg.com
Version: 8.0.175 / Virus Database: 270.9.9/1806 - Release Date: 11/22/2008 6:59 PM
---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]