I'd like to be able to guarantee that a search will finish in (approximately?) N seconds. This seems like a generally applicable goal for the project. It would be nice to not have to worry about malicious or naive users DOSing a search instance. In some cases, precision can be sacrificed, to see results returned more speedily.
This can presently be accomplished by modifying Scorers, such that the skipTo method is aware of how long the query has been underway. One can simply return the best results found after a predetermined amount of time. It is unfortunate, however, that iteration is performed from oldest to newest. In most cases, the newest content is the most relevant. In the scenario described above, the newest (and therefore best) content would not be found. As I understand it, documents are stored in singly linked lists. Therefore, reverse iteration is impossible. What do people think about modifying Lucene, such that iteration is performed in reverse? -- Kyle Maxwell Software Engineer CastTV, Inc http://www.casttv.com --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
