- From: Christian Nentwich <c.nentwich@cs.ucl.ac.uk>
- Date: Fri, 22 Jun 2001 08:05:17 -0400 (EDT)
- To: rayw@netscape.com (Ray Whitmer), Philippe Le Hegaret <plh@w3.org>, bradford@dbxmlgroup.com
- Cc: www-dom@w3.org
> >>I have further requirements that require the repeated evaluation of > >> XPaths (>= 100000 times). I find the Xalan approach quite useful here, > >> which parses the path once to be evaluated multiple times. I see quite a > >> bad performance hit coming along if I use the interfaces from the draft > Either of these cases can be improved in the implementation by very > simple caching schemes: I agree completely. However, 100000 hash table lookups take longer than 0 hashtable lookups. More importantly, the application programmer will know a lot better when a parsed path object is not needed anymore. I would like to be able to control this behaviour, not have it hidden behind the interface. I can already see myself editing the processor source code because it discards my objects too frequently :) One size does not fit all... As for moving these features into the query working group, I have no real interest in pluging additional bulky packages into my code just to achieve something as simple as reusing parsed path expressions.. Christian Christian Nentwich Dept. of Computer Science, University College London +44 (0)20 7679 7190 - http://www.cs.ucl.ac.uk/staff/c.nentwich
Received on Friday, 22 June 2001 14:11:57 UTC