[XML-DEV Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message]

Re: XPath calculation

• From: Rick Jelliffe <ricko@a...>
• To: xml-dev@l...
• Date: Sun, 11 Feb 2001 07:04:25 +0800

A less brute-force way (if the IDs are already hashed, or if perhaps the
document was deep rather than broad) would be:

 0) Use the root as the default anchor.
 1) Find any elements with IDs closer than the root element.
 2) Find the closest of these elements.
 3) Find any unique paths which are shorter than the length of the current
element.

Use the closest of these as the anchor.

Cheers
Rick Jelliffe

• Prev by Date: Re: XML Parser in Servlet Performance Problem
• Next by Date: getting a xml file from oracle8i
• Previous by thread: tree with xml
• Next by thread: UML Mapping
• Index(es):
  • Date
  • Thread