Long version: http://www.grappa.univ-lille3.fr/~niehren/Papers/streamability/0.pdfInternational audienceWe present a query answering algorithm for a fragment of Forward XPath on XML streams that we obtain by compilation to deterministic nested word automata. Our algorithm is earliest and in polynomial time. This proves the finite streamability of the fragment of Forward XPath with child steps, outermost-descendant steps, label tests, negation, and conjunction (aka filters), under the reasonable assumption that the number of conjunctions is bounded. We also prove that finite streamability fails without this assumption except if P=NP
AbstractThe important challenge of evaluating XPath queries over XML streams has sparked much intere...
International audienceWe investigate the complexity of earliest query answering for n-ary node selec...
Abstract. We address the embedding existence problem (often referred to as the fil-tering problem) o...
Long version: http://www.grappa.univ-lille3.fr/~niehren/Papers/streamability/0.pdfInternational audi...
Abstract. We present a query answering algorithm for a fragment of Forward XPath on Xml streams that...
International audienceEarliest query answering (EQA) is an objective of many recent streaming algori...
International audienceQuery answering algorithms on XML streams check answer candidates on the fly i...
AbstractQuery answering algorithms on Xml streams check answer candidates on the fly in order to avo...
International audienceAlgorithms for answering XPath queries on XML streams have been studied intens...
During the last years, XML has evolved into the quasi standard format for data exchange. Most typica...
International audienceEarliest query answering is needed for streaming XML processing with optimal m...
Early query answering is the core issue of memory efficient query evaluation on data streams. The id...
We present a novel solution to streaming XPath query evaluation, capable of supporting forward and r...
The challenge that we tackle in this thesis is the problem of how to answer XPath queries on XML str...
The important challenge of evaluating XPath queries over XML streams has sparked much interest in th...
AbstractThe important challenge of evaluating XPath queries over XML streams has sparked much intere...
International audienceWe investigate the complexity of earliest query answering for n-ary node selec...
Abstract. We address the embedding existence problem (often referred to as the fil-tering problem) o...
Long version: http://www.grappa.univ-lille3.fr/~niehren/Papers/streamability/0.pdfInternational audi...
Abstract. We present a query answering algorithm for a fragment of Forward XPath on Xml streams that...
International audienceEarliest query answering (EQA) is an objective of many recent streaming algori...
International audienceQuery answering algorithms on XML streams check answer candidates on the fly i...
AbstractQuery answering algorithms on Xml streams check answer candidates on the fly in order to avo...
International audienceAlgorithms for answering XPath queries on XML streams have been studied intens...
During the last years, XML has evolved into the quasi standard format for data exchange. Most typica...
International audienceEarliest query answering is needed for streaming XML processing with optimal m...
Early query answering is the core issue of memory efficient query evaluation on data streams. The id...
We present a novel solution to streaming XPath query evaluation, capable of supporting forward and r...
The challenge that we tackle in this thesis is the problem of how to answer XPath queries on XML str...
The important challenge of evaluating XPath queries over XML streams has sparked much interest in th...
AbstractThe important challenge of evaluating XPath queries over XML streams has sparked much intere...
International audienceWe investigate the complexity of earliest query answering for n-ary node selec...
Abstract. We address the embedding existence problem (often referred to as the fil-tering problem) o...
_logo.svg%3Fwidth%3D300&w=3840&q=75){kind=logo}
Add to ORKG