Sciweavers

1018 search results - page 13 / 204
» On the minimization of XPath queries
Sort
View
93
Voted
ADC
2009
Springer
145views Database» more  ADC 2009»
15 years 1 months ago
Efficient XQuery Join Processing in Publish/Subscribe Systems
Efficient XML filtering has been a fundamental technique in recent Web service and XML publish/subscribe applications. In this paper, we consider the problem of filtering a contin...
Ryan H. Choi, Raymond K. Wong
99
Voted
DOCENG
2006
ACM
15 years 3 months ago
Comparing XML path expressions
XPath is the standard declarative language for navigating XML data and returning a set of matching nodes. In the context of XSLT/XQuery analysis, query optimization, and XML type ...
Pierre Genevès, Nabil Layaïda
ICDE
2006
IEEE
149views Database» more  ICDE 2006»
15 years 10 months ago
An Efficient XPath Query Processor for XML Streams
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 ...
Yi Chen, Susan B. Davidson, Yifeng Zheng
91
Voted
ICDT
2012
ACM
235views Database» more  ICDT 2012»
12 years 12 months ago
Equivalence and minimization of conjunctive queries under combined semantics
The problems of query containment, equivalence, and minimization are recognized as very important in the context of query processing, specifically of query optimization. In their...
Rada Chirkova
ICDT
2009
ACM
125views Database» more  ICDT 2009»
15 years 10 months ago
How big must complete XML query languages be?
Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete ? that is it cannot express every query definable in firsto...
Clemens Ley, Michael Benedikt