Containment of queries for graphs with data.
Journal of Computer and System Sciences(2018)
摘要
We consider the containment problem for regular queries with memory and regular queries with data tests: two recently proposed query languages for graph databases that, in addition to allowing the user to ask topological queries, also track how the data changes along paths connecting various points in the database. Our results show that the problem is undecidable in general. However, by allowing only positive data comparisons we find natural fragments with better static analysis properties: the containment problem is PSpace -complete in the case of regular queries with data tests and ExpSpace -complete in the case of regular queries with memory.
更多查看译文
关键词
Graph databases,Query languages,Data values,Query containment
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络