ld
>> values on
>> which I'm doing a distinct to construct my distinct set. Problem
>> with this
>> is that I have tree structures where a parent has over 100K children.
>> Retrieving each doc for this size is too time- and memory-
>> consuming. S
use
>> paging. The problem I faced is that I do not know if a distinct value in
>> the
>> current query was actually returned in some previous query for a previous
>> page.
>>
>> Sorry for the long description, but wanted to make sure I explained it as
>> clear
Hi Terry,
Why not have another index in which a document has one field for the
parent and another field containing all of its children. An OR query
over the "children" field would return you exactly what you want - one
document for each distinct parent.
Steve
dontspamterry wrote:
> Hi all,
>
>
Terry,
On Wednesday 16 May 2007 01:13, dontspamterry wrote:
>
> ... I played around with caching BitSets for the fields
> which I'd like to do a distinct on, but given the amount of data, I run out
> of memory.
I don't know whether your final solution will require filtering,
but if it does, deco
nct
value in the
current query was actually returned in some previous query for a
previous
page.
Sorry for the long description, but wanted to make sure I explained
it as
clearly as I could.
-Terry
--
View this message in context: http://www.nabble.com/Multi-field-
distinct-query
ctually returned in some previous query for a previous
page.
Sorry for the long description, but wanted to make sure I explained it as
clearly as I could.
-Terry
--
View this message in context:
http://www.nabble.com/Multi-field-distinct-query-
