Containment of queries for graphs with data

作者：

Highlights：

• Study of graph query languages that can deal with data values.

• Containment problem for these languages is undecidable in general.

• Containment is decidable if one focuses on languages that can only check for equalities.

• Proofs make use of automata models.

摘要

•Study of graph query languages that can deal with data values.•Containment problem for these languages is undecidable in general.•Containment is decidable if one focuses on languages that can only check for equalities.•Proofs make use of automata models.

论文关键词：Graph databases,Query languages,Data values,Query containment

论文评审过程：Received 18 August 2016, Revised 4 September 2017, Accepted 10 September 2017, Available online 29 September 2017, Version of Record 13 November 2017.

论文官网地址：https://doi.org/10.1016/j.jcss.2017.09.005