This seminal paper proposes a new query language for graph matching and rewriting overcoming {the declarative} limitation of Cypher while outperforming {Neo4j} on graph matching and rewriting by at least one order of magnitude. We exploited columnar databases (KnoBAB) to represent graphs using the Generalised Semistructured Model.

翻译：本开创性论文提出了一种新的图匹配与重写查询语言，克服了Cypher的声明式限制，同时在图匹配与重写性能上比Neo4j至少高出一个数量级。我们利用列式数据库（KnoBAB）基于广义半结构化模型表示图。