tomas.zerolo wrote > > But then the results would be wrong? Suppose the documents are not evenly > distributed (wrt the sort criterium) across all the shards. In an extreme > case, just imagine all 2000 top-most documents are on shard 3. You would > get > the 500 top-most (from shard 3) and some other you don't want (from the > other shards). You wouldn't even know. > > What SOLR is doig here is planning for the worst case. > > Now if it could just do some piece-wise "merge sort" of sorts, that would > be > better. > Yeah, it's true. But from the other side, the second month I'm trying to resolve this problem on my huge data, so I'm attempting to raise any ideas, maybe, even these ideas are incorrect.
Thanks. -- View this message in context: http://lucene.472066.n3.nabble.com/Poor-performance-on-distributed-search-tp3590028p3600648.html Sent from the Solr - User mailing list archive at Nabble.com.
