Computing Possible and Certain Answers ...

Document type :
Article dans une revue scientifique
DOI :
10.1016/j.tcs.2019.05.013
Permalink :
http://hdl.handle.net/20.500.12210/74900
Title :
Computing Possible and Certain Answers over Order-Incomplete Data
Author(s) :
Amarilli, Antoine [Auteur]
Data, Intelligence and Graphs [DIG]
Ba, Mouhamadou Lamine [Auteur]

Deutch, Daniel [Auteur]
Tel Aviv University [TAU]
Senellart, Pierre [Auteur]
Value from Data [VALDA]
Data, Intelligence and Graphs [DIG]
Journal title :
Theoretical Computer Science
Pages :
42-76
Publisher :
Elsevier
Publication date :
2019
ISSN :
1879-2294
English keyword(s) :
Uncertain data
Partial order
Certain answer
Possible answer
HAL domain(s) :
Informatique [cs]/Base de données [cs.DB]
Informatique [cs]/Web
English abstract : [en]
This paper studies the complexity of query evaluation for databases whose relations are partially ordered; the problem commonly arises when combining or transforming ordered data from multiple sources. We focus on queries ...
Show more >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :
Harvested from HAL
Submission date :
2022-06-15T02:26:45Z
Files
Thumbnail