论文标题
模块化路径查询与算术
Modular Path Queries with Arithmetic
论文作者
论文摘要
我们提出了一种查询图形数据库的新方法。我们的方法平衡了表达能力，语言清晰度和计算复杂性的竞争目标。我们方法的一个独特特征是能够表达最小值（例如最短）和最大（例如最有价值的）路径的能力。为了以模块化的方式表达复杂的特性，我们引入了标记生成的本体论。由此产生的形式主义在计算上具有吸引力 - 可以在数据库大小的非确定性对数空间中回答查询。
We propose a new approach to querying graph databases. Our approach balances competing goals of expressive power, language clarity and computational complexity. A distinctive feature of our approach is the ability to express properties of minimal (e.g. shortest) and maximal (e.g. most valuable) paths satisfying given criteria. To express complex properties in a modular way, we introduce labelling-generating ontologies. The resulting formalism is computationally attractive - queries can be answered in non-deterministic logarithmic space in the size of the database.
