Efficient and Expressive Tree Filters-Reference-Cited by-同舟云学术

Efficient and Expressive Tree Filters

Published:2007 Issue: Volume: Page:461-472
ISSN:0302-9743
Container-title:FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science
language:
Short-container-title:

Author:

Benedikt Michael,Jeffrey Alan

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-77050-3_38.pdf

Reference25 articles.

1. Altinel, M., Franklin, M.: Efficient filtering of XML documents for selective dissemination of information. In: Proc. 26th International Conference on Very Large Data Bases (VLDB), pp. 53–64 (2000)

2. Bar-Yossef, Z., Fontoura, M., Josifovski, V.: On the memory requirements of XPath evaluation over XML streams. In: Proc. 23rd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pp. 177–188. ACM Press, New York (2004)

3. Benedikt, M., Fan, W., Geerts, F.: XPath satisfiability in the presence of DTDs. In: Proc. 24th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), ACM Press, New York (2005)

4. Benedikt, M., Fan, W., Kuper, G.: Structural properties of XPath fragments. Theoretical Computer Science 336(1), 3–31 (2005)

5. Benedikt, M., Jeffrey, A.S.A.: Efficient and expressive tree filters. Full version available from the authors web pages (2007)

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Early Nested Word Automata for XPath Query Answering on XML Streams;Implementation and Application of Automata;2013

2. Evolving schemas for streaming XML;Theoretical Computer Science;2011-08

3. Queries on Xml streams with bounded delay and concurrency;Information and Computation;2011-03

4. Streamable Fragments of Forward XPath;Implementation and Application of Automata;2011

5. Bounded Delay and Concurrency for Earliest Query Answering;Language and Automata Theory and Applications;2009