I guess, in C# code without sorting you will have a similar time to Luke . Just sort your memory collection after Lucene search with your preferable sorting algorithm or just use ordered collection. Slowness of built-in Lucene sorting is known problem.
On Wed, Apr 29, 2009 at 4:06 PM, Karl Geppert <[email protected]> wrote: > What might cause the following query to take about 20 seconds to run in c# > code, but only 47ms to run in luke-all 0.9.2 on the same query and same > index (but without the sort)? > > Is there any easy thing I can do to bring it to this speed? > > hits = ixs.Search( bq, new Sort( new SortField[] { new > SortField( "name" ), SortField.FIELD_SCORE }) ); > > where bq is +name:DODECYLANILINE -type:U > > >
