Analyzing real-world SPARQL queries and ontology-based data access in the context of probabilistic data

被引:7
作者
Schoenfisch, Joerg [1 ]
Stuckenschmidt, Heiner [1 ]
机构
[1] Univ Mannheim, Res Grp Data & Web Sci, Mannheim, Germany
关键词
Safeness of probabilistic queries; SPARQL; Probabilistic data; Linked data; DESCRIPTION LOGICS;
D O I
10.1016/j.ijar.2017.08.005
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
\ Handling uncertain knowledge is crucial for modeling many real world domains. Ontologies and ontology-based data access (OBDA) have proven to be versatile methods to capture this knowledge. Multiple systems for OBDA have been developed and there is theoretical work towards probabilistic OBDA, namely identifying efficiently processable queries. These queries are called safe queries. However, there is no analysis on the safeness of probabilistic queries in real-world applications, and there exists no tool support for applying the existing formalisms to the standard query language of SPARQL. In this paper we investigate queries collected from several public SPARQL endpoints and determine the distribution of safe and unsafe queries. This analysis shows that many queries in practice are safe, making probabilistic OBDA feasible and practical to fulfill real-world users' information needs. Furthermore, we design and conduct benchmarks on real-world and generated data sets which show that the approach of answering safe queries in the appropriate way is scalable to large amounts of data. (C) 2017 Elsevier Inc. All rights reserved.
引用
收藏
页码:374 / 388
页数:15
相关论文
共 39 条
[1]  
[Anonymous], 2011, ser. Synthesis Lectures on Data Management
[2]  
[Anonymous], 1996, INTRO BAYESIAN NETWO
[3]  
[Anonymous], 2007, Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI)
[4]   The DL-Lite Family and Relations [J].
Artale, Alessandro ;
Calvanese, Diego ;
Kontchakov, Roman ;
Zakharyaschev, Michael .
JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2009, 36 :1-69
[5]  
Bail Samantha., 2012, CEUR WORKSHOP PROC, V943, P1
[6]  
Berendt B., 2011, P 20 INT C COMPANION, P305, DOI [10.1145/ 1963192.1963324., DOI 10.1145/1963192.1963324]
[7]  
BIZER C, 2001, INT J SEMANT WEB INF, V5, P1, DOI DOI 10.4018/JSWIS.2009040101
[8]   Tractable reasoning and efficient query answering in description logics:: The DL-Lite family [J].
Calvanese, Diego ;
De Giacomo, Giuseppe ;
Lembo, Domenico ;
Lenzerini, Maurizio ;
Rosati, Riccardo .
JOURNAL OF AUTOMATED REASONING, 2007, 39 (03) :385-429
[9]  
Calvanese D, 2017, SEMANT WEB, V8, P471, DOI 10.3233/SW-160217
[10]  
Carlson A, 2010, AAAI CONF ARTIF INTE, P1306