论文标题
常规路径查询的出处
Provenance for Regular Path Queries
论文作者
论文摘要
常规路径查询（RPQ）无处不在的机制，用于查询部分已知结构的数据图。 RPQ在边缘符号上实质上是正则表达式。给定图（数据库）上RPQ的答案是一对对象，通过路径在常规路径查询的语言中拼写单词连接。通常，数据库边缘会带有对它们的权重。这样的权重可以距离，不适的水平，多重性等。我们使用半级框架对权重进行建模。
Regular path queries (RPQs) the ubiquitous mechanism for querying data graphs of partially known structure. RPQs are in essence regular expressions over the edge symbols. The answer to an RPQ on a given graph (database) is the set of pairs of objects, which are connected by paths spelling words in the language of the regular path query. Often the database edges come with a weights assoaciated to them. Such weights can distances, levels of discomfort, multiplicities, etc. We model weights using semiring frameworks.
