Paper Info
Title
Optimizing The Computation Of Approximate Certain Query Answers Over Incomplete Databases
Abstract
In many database applications there is the need of extracting information from incomplete data. In such scenarios, certain answers are the most widely adopted semantics of query answering. Unfortunately, the computation of certain query answers is a coNP-hard problem. To make query answering feasible in practice, recent research has focused on developing polynomial time algorithms computing sound (but possibly incomplete) sets of certain answers. In this paper, we propose a novel technique that allows us to improve recently proposed approximation algorithms, obtaining a good balance between running time and quality of the results. We report experimental results confirming the effectiveness of the new technique.
Year
DOI
Venue
2019
10.1007/978-3-030-27629-4_8
FLEXIBLE QUERY ANSWERING SYSTEMS
Field
DocType
Volume
Data mining,Approximation algorithm,Computer science,Time complexity,Semantics,Database,Computation
Conference
11529
ISSN
Citations 
PageRank 
0302-9743
0
0.34
References 
Authors
0
3
Name
Order
Citations
PageRank
Nicola Fiorentino111.71
Cristian Molinaro212628.71
Irina Trubitsyna311924.66