一句话：提出支持算术与最小/最大路径性质的模块化图数据库路径查询形式，并证明查询可在非确定性对数空间内回答。
论文面向图数据库查询，力图在表达能力、语言清晰性与计算复杂度之间取得平衡。作者提出一种新的模块化路径查询方法，可表达满足给定条件的最小（如最短）与最大（如最有价值）路径的性质。为模块化地描述复杂属性，引入标签生成本体（labelling-generating ontologies）。所得形式化框架具有良好计算性质：查询可在与数据库大小相关的非确定性对数空间（NLOGSPACE）内回答。这为路径查询在表达力与复杂度间的权衡提供了新方案。
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.