Fast tree scan
Fast tree scan
- Subject: Fast tree scan
- From: Florijan Stamenkovic <email@hidden>
- Date: Wed, 31 May 2006 17:21:50 +0200
Hi all,
I have an entity that relates to itself, having a parent and children
of the same entity. It works fine.
The intention is that the tree can be used to indefinite depth, with
an indefinite amount of branches. Practically, this measures let's
say ten levels of depth, and involved hundreds of nodes. And there
can be quite a number of trees managed.
At one point however I need to scan the whole tree. That takes a
while because of EOF faulting, where children are not resolved until
they are asked for. Since this is used in a Java Client scenario,
that means that the children for every node cause a trip to the
application server to get the data. It is immensely cheaper to get it
all in one.
My solution was to relate every node to the root node, which is of a
different entity. That way all the nodes belonging to the same tree
can be resolved through one request, regardless of how deep they are.
This however does not help me, because still the children for every
node are faults, and still a round trip is made when I resolve them.
So, the question is: does anybody know how this can this be
optimized, so that I don't have to have so many round trips?
TIA,
Flor
_______________________________________________
Do not post admin requests to the list. They will be ignored.
Webobjects-dev mailing list (email@hidden)
Help/Unsubscribe/Update your Subscription:
This email sent to email@hidden