: My example is just simple, in real life the numbers are a lot bigger. However,
: the amount of unique products vs variations is such that it seems a lot of
: work to iterate over al variations in a DocSet just to get the few unique
: products.
: But, what I understand from you anwser is that the
Hi Thijs.
If you are not concerned with a *EXACT* number there is a paper that was
published in 1990 that discusses this problem.
http://dblab.kaist.ac.kr/Publication/pdf/ACM90_TODS_v15n2.pdf
from the paper (If I understand it correctly)
For 120,000,000 records you can sample 10,112,529 reco
It must be my english.
When I read your comment, I think you could compare it to the category
example...
Maybe with an example I can explain my situation better:
The documents in the index contain variations of different products.
Say for example I have 10 different products. Every product is i
: You are correct I'm looking for the unique values for one field in a DocSet.
: The field is not multivalued. and it contains only 1 long value, the pk of a
: database table
: But you said the counts are stored in the index, I don't see that. Because
there's something very confusing about your qu
from the database.
Is there a faster way to get the unique values from a field in a result?
If you are looking for the unique terms for a field across all
documents, faceting is the way to go. The counts are stored in the
index, so i don't think that is a substantial loss.
If you are
the unique values for that field.
The field's contain database Id's that I use on the client side to
get aditional information from the database.
Is there a faster way to get the unique values from a field in a
result?
If you are looking for the unique terms for a field ac
ontain database Id's that I use on the client side to get
aditional information from the database.
Is there a faster way to get the unique values from a field in a result?
Thijs
