Maybe I am not clear, but I am not able to find anything on the net.
Basically, if I had in my index millions of names starting with A* I would
like to know how many distinct surnames are present in the resultset
(similar to a distinct SQL query).
I will attempt to have a look at the SOLR sources to try to see if this is
possible to implement. Any hints where to look at would be great!
Thanks,
Bruno
2009/2/3 Bruno Aranda <brunoaranda@gmail.com>
> But as far as I understand the total number of constraints is limited
> (there is a default value), so I cannot know the total if I don't set the
> facet.limit to a really big number and then the request takes a long time. I
> was wondering if there was a way to get the total number (e.g. 100.000
> constraints) to show it to the user, and then paginate using facet.offset
> and facet.limit until I reach that total.
> Does this make sense?
>
> Thanks!
>
> Bruno
>
> 2009/2/3 Markus Jelsma  Buyways B.V. <markus@buyways.nl>
>
> Hello,
>>
>>
>> Searching for ?q=*:* with facetting turned on gives me the total number
>> of available constraints, if that is what you mean.
>>
>>
>> Cheers,
>>
>>
>>
>> On Tue, 20090203 at 16:03 +0000, Bruno Aranda wrote:
>>
>> > Hi,
>> >
>> > I would like to know if is there a way to get the total number of
>> different
>> > facets returned by a faceted search? I see already that I can paginate
>> > through the facets with the facet.offset and facet.limit, but there is a
>> way
>> > to know how many facets are found in total?
>> >
>> > For instance,
>> >
>> > Name Surname
>> >
>> > Peter Smith
>> > John Smith
>> > Anne Baker
>> > Mary York
>> > ... 1 million records more with 100.000 distinct surnames
>> >
>> > For instance, now I search for people with names starting with A, and I
>> > retrieve 5000 results. I would like to know the distinct number of
>> surnames
>> > (facets) for the result set if possible, so I could show in my app
>> something
>> > like this:
>> >
>> > 5000 people found with 1440 distinct surnames.
>> >
>> > Any ideas? Is this possible to implement? Any pointers would be greatly
>> > appreciated,
>> >
>> > Thanks!
>> >
>> > Bruno
>>
>
>
