Associating omega-automata to path queries on Webs of Linked Data

作者：Giannakis Konstantinos^*; Theocharopoulou Georgia; Papalitsas Christos; Andronikos Theodore; Vlamos Panayiotis

来源：Engineering Applications of Artificial Intelligence, 2016, 51: 115-123.

DOI：10.1016/j.engappai.2016.01.013

• Linked Data
• omega-automata
• Infinite computation
• SPARQL queries
• Mining Linked Data
• omega-regular path queries

The emergence of semantically enriched data sets along with the elegant way they are interconnected through the concept of Linked Data has drawn the attention of various scientific branches. The volume and the quality of information that lie inside the Linked Data, along with the capabilities they offer, make them ideal candidate to mine and extract valuable material, especially in field with great humanitarian importance, such as biology, medicine and social networks. As we show in this work, there are queries that cannot be expressed neither by standard SPARQL nor its expansion with regular path queries.
These queries assume that the Web of Linked Data can be infinite and therefore classic queries expressed in terms of SPARQL need to be revisited. We propose a novel method associating a variant of automata that read infinite inputs, namely the omega-automata, to each query on this infinite structure. We call these queries omega-regular path queries due to the fact that they use omega-regular expressions. These expressions are of the form a vertical bar(ab)(omega). We present our approach through examples and figures, mainly inspired from systems related to biological functions and processes, providing indicative queries.

• 出版日期2016-5