Marrying words and trees, 26th ACM Symposium on Principles of Database Systems, 2007. ,
DOI : 10.1007/978-3-540-74510-5_3
URL : http://repository.upenn.edu/cgi/viewcontent.cgi?article=1549&context=cis_papers
Visibly pushdown languages, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing , STOC '04, pp.202-211, 2004. ,
DOI : 10.1145/1007352.1007390
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.3757
Combining Temporal Logics for Querying XML Documents, International Conference on Database Theory, pp.359-373, 2007. ,
DOI : 10.1007/11965893_25
Buffering in query evaluation over XML streams, Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '05, pp.216-227, 2005. ,
DOI : 10.1145/1065167.1065195
Efficient and Expressive Tree Filters, Foundations of Software Technology and Theoretical Computer Science, 2007. ,
DOI : 10.1007/978-3-540-77050-3_38
Online evaluation of regular tree queries, Nordic Journal of Computing, vol.13, issue.4, pp.1-26, 2006. ,
On-the-fly tuple selection for XQuery, Proceedings of the 4th international workshop on XQuery implementation, experience and perspectives , XIME-P '07, 2007. ,
DOI : 10.1145/1328158.1328160
Polynomial time fragments of XPath with variables, Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '07, pp.205-214, 2007. ,
DOI : 10.1145/1265530.1265559
URL : https://hal.archives-ouvertes.fr/inria-00135678
Streaming tree automata, Information Processing Letters, vol.109, issue.1, 2008. ,
DOI : 10.1016/j.ipl.2008.08.002
URL : https://hal.archives-ouvertes.fr/inria-00288445
Processing XML streams with deterministic automata and stream indexes, ACM Transactions on Database Systems, vol.29, issue.4, pp.752-788, 2004. ,
DOI : 10.1145/1042046.1042051
Stream processing of XPath queries with predicates, SIGMOD '03: Proceedings of the 2003 ACM SIGMOD international conference on Management of data, pp.419-430, 2003. ,
Visibly pushdown automata for streaming XML, Proceedings of the 16th international conference on World Wide Web , WWW '07, pp.1053-1062, 2007. ,
DOI : 10.1145/1242572.1242714
Towards Aggregated Answers for Semistructured Data, Database Theory -ICDT 2001, pp.346-360, 1973. ,
DOI : 10.1007/3-540-44503-X_22
Locating Matches of Tree Patterns in Forests, Foundations of Software Technology and Theoretical Computer Science, pp.134-145, 1998. ,
DOI : 10.1007/978-3-540-49382-2_12
N-Ary Queries by Tree Automata, 10th International Symposium on Database Programming Languages, pp.217-231, 2005. ,
DOI : 10.1007/11601524_14
URL : https://hal.archives-ouvertes.fr/inria-00536522
SPEX: Streamed and Progressive Evaluation of XPath, IEEE Transactions on Knowledge and Data Engineering, vol.19, issue.7, pp.934-949, 2007. ,
DOI : 10.1109/TKDE.2007.1063
Combined Static and Dynamic Analysis for Effective Buffer Minimization in Streaming XQuery Evaluation, 2007 IEEE 23rd International Conference on Data Engineering, 2007. ,
DOI : 10.1109/ICDE.2007.367869
Validating streaming XML documents, Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '02, pp.53-64, 2002. ,
DOI : 10.1145/543613.543622
Equivalence of finite-valued tree transducers is decidable, Mathematical Systems Theory, vol.4, issue.4, pp.285-346, 1994. ,
DOI : 10.1007/BF01192143
Haskell overloading is DEXPTIME-complete, Information Processing Letters, vol.52, issue.2, pp.57-60, 1994. ,
DOI : 10.1016/0020-0190(94)00130-8
Generalized finite automata theory with an application to a decision problem of second-order logic, Mathematical System Theory, pp.57-82, 1968. ,
DOI : 10.1007/BF01691346