Sciweavers

591 search results - page 2 / 119
» The complexity of XPath query evaluation
Sort
View
ICDE
2006
IEEE
149views Database» more  ICDE 2006»
14 years 6 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
XSYM
2007
Springer
150views Database» more  XSYM 2007»
13 years 11 months ago
Fast Answering of XPath Query Workloads on Web Collections
Several web applications (such as processing RSS feeds or web service messages) rely on XPath-based data manipulation tools. Web developers need to use XPath queries effectively o...
Mariano P. Consens, Flavio Rizzolo
WWW
2005
ACM
14 years 6 months ago
A fast XPATH evaluation technique with the facility of updates
This paper addresses the problem of fast retrieval of data from XML documents by providing a labeling schema that can easily handle simple as well as complex XPATH queries and als...
Ashish Virmani, Suchit Agarwal, Rahul Thathoo, She...
PODS
2008
ACM
143views Database» more  PODS 2008»
14 years 5 months ago
XPath, transitive closure logic, and nested tree walking automata
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...
Balder ten Cate, Luc Segoufin
PODS
2004
ACM
137views Database» more  PODS 2004»
14 years 5 months ago
On the Memory Requirements of XPath Evaluation over XML Streams
The important challenge of evaluating XPath queries over XML streams has sparked much interest in the past few years. A number of algorithms have been proposed, supporting wider f...
Ziv Bar-Yossef, Marcus Fontoura, Vanja Josifovski