Query answering over uncertain RDF knowledge bases: explain and obviate unsuccessful query results

被引:0
作者
Ibrahim Dellal
Stéphane Jean
Allel Hadjali
Brice Chardin
Mickaël Baron
机构
[1] University of Poitiers,LIAS/ISAE
来源
Knowledge and Information Systems | 2019年 / 61卷
关键词
Uncertain knowledge bases; RDF quad; SPARQL queries; Empty answers; Named graph; Reification; Quadstore;
D O I
暂无
中图分类号
学科分类号
摘要
Several large uncertain knowledge bases (KBs) are available on the Web where facts are associated with a certainty degree. When querying these uncertain KBs, users seek high-quality results, i.e., results that have a certainty degree greater than a given threshold α\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha $$\end{document}. However, as they usually have only a partial knowledge of the KB contents, their queries may be failing i.e., they return no result for the desired certainty level. To prevent this frustrating situation, instead of returning an empty set of answers, our approach explains the reasons of the failure with a set of α\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha $$\end{document}minimal failing subqueries (α\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha $$\end{document}MFSs) and computes alternative relaxed queries, called α\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha $$\end{document}maXimal succeeding subqueries (α\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha $$\end{document}XSSs), that are as close as possible to the initial failing query. Moreover, as the user may not always be able to provide an appropriate threshold α\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha $$\end{document}, we propose three algorithms to compute the α\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha $$\end{document}MFSs and α\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha $$\end{document}XSSs for other thresholds, which also constitutes a relevant feedback for the user. Multiple experiments with the WatDiv benchmark show the relevance of our algorithms compared to a baseline method.
引用
收藏
页码:1633 / 1665
页数:32
相关论文
共 41 条
  • [1] Rodríguez M(2016)Sigmakb: multiple probabilistic knowledge base fusion Proc VLDB Endow 9 1577-1580
  • [2] Goldberg S(2013)YAGO2: a spatially and temporally enhanced knowledge base from Wikipedia Artif Intell 194 28-61
  • [3] Wang DZ(2013)A probabilistic optimization framework for the empty-answer problem Proc VLDB Endow 6 1762-1773
  • [4] Hoffart J(1997)Minimization in cooperative response to failing database queries Int J Coop Inf Syst 6 95-149
  • [5] Suchanek FM(2017)Handling failing RDF queries: from diagnosis to relaxation Knowl Inf Syst (KAIS) 50 167-195
  • [6] Berberich K(2009)Semantics and complexity of SPARQL ACM Trans Database Syst (TODS) 34 16:1-16:45
  • [7] Weikum G(1997)Levelwise search and borders of theories in knowledge discovery Data Min Knowl Discov 1 241-258
  • [8] Mottin D(2011)A unified framework for managing provenance information in translational research BMC Bioinform 12 461-730
  • [9] Marascu A(2015)Fast rule mining in ontological knowledge bases with AMIE+ VLDB J 24 707-114
  • [10] Roy SB(2012)Approximating query answering on RDF databases J World Wide Web Internet Web Inf Syst (WWW) 15 89-260