Name
Abstract | ||
|---|---|---|
Linked Data is a field with ongoing development showing not only practical applications but also elegant theoretical results. Parts of these works concern the query process of Linked Data using SPARQL. Our work examines the querying of such data sources which are characterized by eventual computability, rather than finite. This infinite character of the data and the query process stimulated the use of Büchi automata in order to properly verify this computation model. In brief, our work contributes by presenting a novel approach to describe the infinite computation of SPARQL queries on a Web of Linked Data using Büchi automata. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/SMAP.2014.15 | Semantic and Social Media Adaptation and Personalization |
Keywords | Field | DocType |
program verification,query processing,semantic Web,Bυchi automata,SPARQL,data process,data sources,eventual computability,query process,querying linked data,semantic Web | Computer science,Linked data,SPARQL,Computability,Theoretical computer science,Named graph,Büchi automaton,Computation | Conference |
Citations | PageRank | References |
1 | 0.35 | 15 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Konstantinos Giannakis | 1 | 12 | 5.82 |
| Theodore Andronikos | 2 | 105 | 15.07 |