On Thu, Aug 22, 2002 at 07:38:20AM -0400, Norman Walsh wrote:
> / Bob Stayton <> was heard to say:
> | I'll bet you are chunking out a lot of files. If so, then
> | you are probably I/O bound. I get similar results on
>
> I/O bound, or just working really hard to calculate all of the
> navigational links.
>
> Chunking really big documents requires some potentially expensive
> operations over the document tree.
Basically the next and previous are recomputed *everytime* for
each chunk, independantly that next->prev is the current start node.
At least minimal caching here would help, okay I know one cannot
override variables, but still what a waste of power...
Can't you just compute the boundaries once, use a key() to store them
and come back to linear cost for this computation ?
Daniel
--
Daniel Veillard | Red Hat Network https://rhn.redhat.com/
| libxml GNOME XML XSLT toolkit http://xmlsoft.org/
http://veillard.com/ | Rpmfind RPM search engine http://rpmfind.net/
