Pattern matching of core GQL, the new ISO standard for querying property graphs, cannot check whether edge values are increasing along a path, as established in recent work. We present a constructive translation that overcomes this limitation by compiling the increasing-edges condition into the input graph. Remarkably, the benefit of this construction goes beyond restoring expressiveness. In our proof-of-concept implementation in Neo4j's Cypher, where such path constraints are expressible but costly, our compiled version runs faster and avoids timeouts. This illustrates how a theoretically motivated translation can not only close an expressiveness gap but also bring practical performance gains.

翻译：核心GQL作为查询属性图的新型ISO标准，其模式匹配功能无法检测路径中边值是否递增，这一局限性已在近期研究中得到证实。本文提出一种构造性转换方法，通过将递增边条件编译到输入图中来突破此限制。值得注意的是，该构造的益处不仅限于恢复表达能力。我们在Neo4j的Cypher语言中的概念验证实现表明：虽然此类路径约束本身可表达但计算代价高昂，而经过编译的版本不仅运行速度更快，还能避免超时问题。这证明理论上驱动的转换方法不仅能弥补表达能力缺口，还能带来实际性能提升。