Paper Info
Title
Approximation algorithms for querying incomplete databases
Abstract
Certain answers are a widely accepted semantics of query answering over incomplete databases. As their computation is a coNP-hard problem, recent research has focused on developing (polynomial time) evaluation algorithms with correctness guarantees, that is, techniques computing a sound but possibly incomplete set of certain answers. The aim is to make the computation of certain answers feasible in practice, settling for under-approximations.
Year
DOI
Venue
2019
10.1016/j.is.2019.03.010
Information Systems
Keywords
Field
DocType
Incomplete database,Certain query answer,Approximation algorithm
Approximation algorithm,Data mining,Suite,Computer science,Correctness,Time complexity,Semantics,Database,Data complexity,Computation
Journal
Volume
ISSN
Citations 
86
0306-4379
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Sergio Greco11249265.35
Cristian Molinaro212628.71
Irina Trubitsyna311924.66