论文信息 - pSPARQL: A Querying Language for Probabilistic RDF (Extended Abstract)

pSPARQL: A Querying Language for Probabilistic RDF (Extended Abstract)

In this paper, we present a querying language for probabilistic RDF databases, where each triple has a probability, called pSRARQL, built on SPARQL, recommended by W3C as a querying language for RDF databases. Firstly, we present the syntax and semantics of pSPARQL. Secondly, we define the query problem of pSPARQL corresponding to probabilities of solutions. Finally, we show that the query evaluation of general pSPARQL patterns is PSPACEcomplete.

Hong Fang | Xiaowang Zhang | Xiaowang Zhang | Hong Fang

[1] Xiang Lian,et al. Efficient query answering in probabilistic RDF graphs , 2011, SIGMOD '11.

[2] Wang-Chiew Tan,et al. Query Answering over Incomplete and Uncertain RDF , 2014 .

[3] Joerg Schoenfisch. Querying Probabilistic Ontologies with SPARQL , 2014, GI-Jahrestagung.

[4] Dan Suciu,et al. Efficient query evaluation on probabilistic databases , 2004, The VLDB Journal.

[5] Chengfei Liu,et al. Query Evaluation on Probabilistic RDF Databases , 2009, WISE.

[6] Anastasios,et al. Query Answering over Incomplete and Uncertain RDF ∗ , 2014 .

[7] Marcelo Arenas,et al. Semantics and complexity of SPARQL , 2006, TODS.