Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

BNCOD
2004

favoriteEmaildiscussreport

75views Database» more BNCOD 2004»

Evaluating Complex Queries Against XML Streams with Polynomial Combined Complexity

13 years 5 months ago

Evaluating Complex Queries Against XML Streams with Polynomial Combined Complexity

Download www.furche.net

Dan Olteanu, Tim Furche, François Bry

Real-time Traffic

BNCOD 2004 | BNCOD 2007 |

claim paper

Related Content

» An Evaluation of Regular Path Expressions with Qualifiers against XML Streams

» Complexity of Earliest Query Answering with Streaming Tree Automata

» ViteX A Streaming XPath Processing System

» An Efficient XPath Query Processor for XML Streams

» SketchBased Summarization of Ordered XML Streams

» Flexible and efficient XML search with complex fulltext predicates

» Combining Incompleteness and Ranking in Tree Queries

» On the complexity of query answering over incomplete XML documents

» Efficient Complex Query Support for Multiversion XML Documents

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2004
Where	BNCOD
Authors	Dan Olteanu, Tim Furche, François Bry

Comments (0)