Relative expressive power of navigational querying on graphs using transitive closure-Reference-Cited by-同舟云学术

Relative expressive power of navigational querying on graphs using transitive closure

Published:2015-07-13 Issue:5 Volume:23 Page:759-788
ISSN:1367-0751
Container-title:Logic Journal of IGPL
language:en
Short-container-title:Logic Jnl IGPL

Author:

Surinx Dimitri,Fletcher George H. L.,Gyssens Marc,Leinders Dirk,Van den Bussche Jan,Van Gucht Dirk,Vansummeren Stijn,Wu Yuqing

Publisher

Oxford University Press (OUP)

Subject

Logic

Link

http://academic.oup.com/jigpal/article-pdf/23/5/759/5083155/jzv028.pdf

Reference22 articles.

1. R. Angles, P. Barceló, and G. Rios. A practical query language for graph dbs. In Proceedings 7th Alberto Mendelzon International Workshop on Foundations of Data Management, Vol. 1087 of CEUR Workshop Proceedings, L. Bravo and M. Lenzerini, eds, 2013.

2. Survey of graph database models;Angles;ACM Computing Surveys,2008

3. Structural properties of XPath fragments

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

1. Executable First-Order Queries in the Logic of Information Flows;Logical Methods in Computer Science;2024-05-22

2. The power of Tarski's relation algebra on trees;Journal of Logical and Algebraic Methods in Programming;2022-04

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

4. Comparing the expressiveness of downward fragments of the relation algebra with transitive closure on trees;Information Systems;2020-03

5. Dichotomies for Evaluating Simple Regular Path Queries;ACM Transactions on Database Systems;2019-12-17