1018 search results - page 14 / 204 » On the minimization of XPath queries |
88
Voted
PODS
2008
ACM
15 years 9 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...
167
click to vote
ICDE
2008
IEEE
15 years 10 months ago
2008
IEEE
We study new hierarchical indexing approach to process XPATH queries. Here, a hierarchical index consists of index entries that are pairs of queries and their (full/partial) answer...
DATESO
2010
14 years 7 months ago
2010
Abstract. Current XPath processors use direct approach to query evaluation which is quite inefficient in some cases and usually implemented serially. This may be a problem in case ...
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
We propose XQGen, a stand-alone, algebra-based XPath generator to aid engineers in testing and improving the design of XML query engines. XQGen takes an XML schema sketch and user...
119
click to vote
XIMEP
2006
ACM
15 years 3 months ago
2006
ACM
We discuss query evaluation for XML-based server systems where the same query is evaluated on every incoming XML message. In a typical scenario, many of the incoming messages will...