46 search results - page 1 / 10 » XPath evaluation in linear time with polynomial combined com... |
PODS
2009
ACM
13 years 9 months ago
2009
ACM
PODS
2008
ACM
14 years 5 months ago
2008
ACM
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
ICDT
2009
ACM
14 years 5 months ago
2009
ACM
We study the problem of incrementally maintaining an XPath query on an XML database under updates. The updates we consider are node insertion, node deletion, and node relabeling. ...
VLDB
2002
ACM
13 years 4 months ago
2002
ACM
Our experimental analysis of several popular XPath processors reveals a striking fact: Query evaluation in each of the systems requires time exponential in the size of queries in ...
ICDE
2006
IEEE
14 years 6 months ago
2006
IEEE
Streaming XPath evaluation algorithms must record a potentially exponential number of pattern matches when both predicates and descendant axes are present in queries, and the XML ...