XML query engines

[Julian Reschke]

At Sun, 31 Jan 1999 16:53:32 -0800, Tim Bray (tbray at textuality.com) wrote:

>At 08:24 PM 1/31/99 +73900, John Cowan wrote:
>>Assign a sequentially increasing number to each *tag* (start-tag or
end-tag)
>>in the document, treating an empty tag as a start-tag followed by an
>>end-tag. Then e1 is a descendant of e2 iff e1.start > e2.start
>>and e1.end < e2.end. Also, e1 is a left sibling of e2 (and e2 is
>>a right sibling of e1) iff e1.end + 1 = e2.start; e1 is the leftmost
>>child of e2 iff e1.start = e2.start + 1. Modeling the child/parent
>>relationship is not so easy, and requires iteration.
>
>This structure has all sorts of advantages; that's how the
>Open Text SGML-savvy search engine of yore used to run. Fast as
>ell, equal access to any & all elements without performance
>penalty.
>
>
>But hard to update.

Is there an easy way to apply this model to a MSXML.DLL DOM object?
Microsoft's documentation (uniqueID Method, elementIndexList Method) is not
very clear about how these IDs are generated, and whether they remain the
same across to separate parser invocations on the same XML data...

--
Julian Reschke
MedicalData Service GmbH (http://www.medicaldataservice.de)



xml-dev: A list for W3C XML Developers. To post, mailto:xml-dev at ic.ac.uk
Archived as: http://www.lists.ic.ac.uk/hypermail/xml-dev/ and on CD-ROM/ISBN 981-02-3594-1
To (un)subscribe, mailto:majordomo at ic.ac.uk the following message;
(un)subscribe xml-dev
To subscribe to the digests, mailto:majordomo at ic.ac.uk the following message;
subscribe xml-dev-digest
List coordinator, Henry Rzepa (mailto:rzepa at ic.ac.uk)