: I didn't realize how much more complicated this gets with distributed : search. Do you think it's worth opening a JIRA issue for this?
features are always worth opening jiras for if you have ideas related to those features to add as comments (or a patch) by all means open a jira and put whatever relevant notes you think make sense (crib from my email as much as you want) as i (think i) smentioned: the only feasible way i can think of to appraoch this type of problem in a generalized way at scale is to think about hte API as a "sampling" API, where instead of specying absolute (ie: give me the top 100 constraints from the top 10,000 matches) the API works in terms of "goals" (ie: suggest the top 100 constraints based on top 10% matches") and then solr has some wiggle room -- it can ask each shard for the 100*N constraints from the top (10*M)% matches, then weght all those constraints based on how many matches come from each shard to pick the final 100 constraints, then ask each shard for the final counts from those constraints (like it already does) : Is there already some ongoing work on the faceting code that this might fit in with? not that i know of. -Hoss
