Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Validating streaming XML documents
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Processing XML Streams with Deterministic Automata
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Efficient Filtering of XML Documents for Selective Dissemination of Information
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
XPath queries on streaming data
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Efficient Filtering of XML Documents with XPath Expressions
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Monadic datalog and the expressive power of languages for Web information extraction
Journal of the ACM (JACM)
Conditional XPath, the first order complete XPath dialect
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the memory requirements of XPath evaluation over XML streams
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XPath satisfiability in the presence of DTDs
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Structural properties of XPath fragments
Theoretical Computer Science - Database theory
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Forward node-selecting queries over trees
ACM Transactions on Database Systems (TODS)
Visibly pushdown automata for streaming XML
Proceedings of the 16th international conference on World Wide Web
SPEX: Streamed and Progressive Evaluation of XPath
IEEE Transactions on Knowledge and Data Engineering
Tight lower bounds for query processing on streaming and external memory data
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Which XML schemas admit 1-pass preorder typing?
ICDT'05 Proceedings of the 10th international conference on Database Theory
First order paths in ordered trees
ICDT'05 Proceedings of the 10th international conference on Database Theory
PSL model checking and run-time verification via testers
FM'06 Proceedings of the 14th international conference on Formal Methods
Stream firewalling of xml constraints
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
How big must complete XML query languages be?
Proceedings of the 12th International Conference on Database Theory
Bounded Delay and Concurrency for Earliest Query Answering
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Earliest query answering for deterministic nested word automata
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
XPath query processing improvements
Proceedings of the 2010 Conference of the Center for Advanced Studies on Collaborative Research
Queries on Xml streams with bounded delay and concurrency
Information and Computation
Evolving schemas for streaming XML
Theoretical Computer Science
Streamable fragments of forward XPath
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Early nested word automata for XPath query answering on XML streams
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
We investigate streaming evaluation of filters on XML documents, evaluated both at the root node and at an arbitrary node. Motivated by applications in protocol processing, we are interested in algorithms that make one pass over the input, using space that is independent of the data and polynomial in the filter. We deal with a logic equivalent to the XPath language, and also an extension with an Until operator. We introduce restricted sublanguages based on looking only at "reversed" axes, and show that these allow polynomial space streaming implementations. We further show that these fragments are expressively complete. Our results make use of techniques developed for the study of Linear Temporal Logic, applied to XML filtering.