I am working on an XPath implementation that is less memory hungry that XML::XPath, which is based on XML::Parser, which creates trees of hashes and arrays.
My module is slower than XML::XPath, but uses FAR less memory. It is based on a data structure that does not contain the children of a node, but the (unique) parent. Searches/queries are done backwards. It is therefore very fast on queries like //apples, if you are into fruit.
What could be a good namespace for this? Perhaps XML::Xpath::Backwards?
Any thoughts are appreciated. Teun van Eijsden PAUSE id: TEUN
