in reply to Idea for XPath implementation

The name of the node is not unique - you can have many <bad> tags and you would have to search them all. This would be inefficient if there is just one <bad> node under the /colors/paprika/ subtree.

To state the obvious XPath is a bit complex - you did look only on one kind of query for one kind of XML structure. Perhaps it might be usefull for such a restricted case. It might be even a good start for something more general, but you would have to add much to it.

But to start you should do a research on existing solutions. Do you know what data structures uses XML::XPath? Have you looked at XML DB (this is a library I've just recently learned about on PM)?

Replies are listed 'Best First'.
Re: Re: Idea for XPath implementation
by Jaap (Curate) on Apr 01, 2003 at 11:06 UTC
    I did do some research on other XPath implementations (XML::XPath) but i wanted to keep my post clear & focussed.
    XML::Xpath uses XML::Parser to build a nested hash tree of the entire XML document.
[reply]
      Ok - so sorry for that question. I hope I did provide the focussed answer in the beginning of my post.
[reply]

In Section Seekers of Perl Wisdom