On Mon, Jan 18, 2010 at 8:57 AM, Erick Erickson <erickerick...@gmail.com> wrote: > Nope. The problem is that SOLR needs to create a ranked > list. It has to search the entire corpus every time. There's > always the possibility that the very last document examined > would rank highest.
There's also the priority queue used to collect the top matches that needs to remain ordered. Finding and scoring matching documents will normally dominate the time, but if "N" becomes large (for collecting the top N matches), the priority queue operations can become significant. -Yonik http://www.lucidimagination.com
