The Power of Tarski’s Relation Algebra on Trees-Reference-Cited by-同舟云学术

The Power of Tarski’s Relation Algebra on Trees

Published:2018 Issue: Volume: Page:244-264
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Hellings Jelle,Wu Yuqing,Gyssens Marc,Van Gucht Dirk

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-90050-6_14

Reference26 articles.

1. Barceló, P.: Querying graph databases. In: Proceedings 32nd Symposium on Principles of Database Systems, pp. 175–188. ACM (2013)

2. Barceló, P., Pérez, J., Reutter, J.L.: Relative expressiveness of nested regular expressions. In: Proceedings of 6th Alberto Mendelzon International Workshop on Foundations of Data Management, pp. 180–195. CEUR Workshop Proceedings (2012)

3. Benedikt, M., Fan, W., Kuper, G.: Structural properties of XPath fragments. Theor. Comput. Sci. 336(1), 3–31 (2005)

4. Benedikt, M., Koch, C.: XPath leashed. ACM Comput. Surv. 41(1), 3:1–3:54 (2009)

5. Bray, T., Paoli, J., Sperberg-McQueen, C.M., Maler, E., Yergeau, F., Cowan, J.: Extensible Markup Language (XML) 1.1 (Second Edition). W3C Recommendation, W3C (2006). http://www.w3.org/TR/2006/REC-xml11-20060816

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

1. Practical and comprehensive formalisms for modelling contemporary graph query languages;Information Systems;2021-12

2. FLUX;Proceedings of the 35th IEEE/ACM International Conference on Automated Software Engineering;2020-12-21

3. From Relation Algebra to Semi-join Algebra: An Approach to Graph Query Optimization;The Computer Journal;2020-05-09