for example, i wanna query "lucene", it's numFound is 234300.
and results should sorted by score. if u do, how to pagination and sort it's score? 2007/5/15, Mike Klaas <[EMAIL PROTECTED]>:
On 14-May-07, at 7:15 PM, James liu wrote: > if i set rows=(page-1)*10,,,it will lose more result which fits query. > > how to set start when pagination. I'm not sure I understand the question. When combining results from partitions, you can't use startAt.
if not use startAt, how to define rows to keep user can find results? You
must always assemble the docs from 0 to N for each partition (whether through one request or multiple).
if rows bigger it will slow, if smaller it will lose data and sort score not correctly. -Mike
> > > 2007/5/15, James liu <[EMAIL PROTECTED]>: >> >> >> >> 2007/5/15, Mike Klaas <[EMAIL PROTECTED]>: >> > >> > On 14-May-07, at 1:35 AM, James liu wrote: >> > >> > > if use multi index box, how to pagination with sort by score >> > > correctly? >> > > >> > > for example, i wanna query "search" with 60 index box and sort by >> > > score. >> > > >> > > i don't know the num found from every index box which have >> different >> > > content. >> > > >> > > if promise 10 page with sort score correctly, i think solr 's >> start >> > > is 0, >> > > and rows is 100.(10 result per page) >> > > >> > > 60*100=6000, sort it and get top 100 to cache. >> > >> > > it is very slove although it promise 10 page with sort score >> > > correctly. >> > >> > With few index partitions, you it is sufficient to ask for startAt >> > +numNeeded docs from each partition and sort globally. Normally if >> > you wanted 10 for the first page, you would ask for 10 from each >> > server and cache the remainder. It is better to ask for more later >> > if the user asks for page ten. >> > >> > >> > When you get up to 60 partitions, you should make it a multi stage >> > process. Assuming your partitions are disjoint and evenly >> > distributed, estimate the number of documents that will appear >> in the >> > final result from each. >> >> >> yes, partitions distrbuted. >> >> >> Double or triple that (and put a minimum >> > threshold), try to assemble the number of documents you require, >> and >> > if one partition "runs out" of docs before it is done, request a >> new >> > round. >> >> >> i dont' know what u mean "runs out" >> >> one user request will generate 60 partitions request. >> >> they work in parallel。 >> >> so i don't know every partion's status before they done. >> >> >> To promise 10 page result sorted by score correctly, the only way >> seems to >> get 100 results(rows=100) from each partitioin. but it very slow. >> >> now i wanna find a way to get result sorted by score correctly and >> search >> fast. >> >> >> -Mike >> > >> >> Thks Mike. But it not i want. >> >> >> -- >> regards >> jl > > > > > -- > regards > jl
-- regards jl
