Computing Possible and Certain Answers over Order-Incomplete Data - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2019

Computing Possible and Certain Answers over Order-Incomplete Data

Antoine Amarilli


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 in a useful fragment of SQL, namely positive relational algebra with aggregates, whose bag semantics we extend to the partially ordered setting. Our semantics leads to the study of two main computational problems: the possibility and certainty of query answers. We show that these problems are respectively NP-complete and coNP-complete, but identify tractable cases depending on the query operators or input partial orders. We further introduce a duplicate elimination operator and study its effect on the complexity results.
Fichier principal
Vignette du fichier
S0304397519303214.pdf (783.51 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01891814 , version 1 (20-07-2022)


Attribution - NonCommercial



Antoine Amarilli, Mouhamadou Lamine Ba, Daniel Deutch, Pierre Senellart. Computing Possible and Certain Answers over Order-Incomplete Data. Theoretical Computer Science, 2019, 797, pp.42-76. ⟨10.1016/j.tcs.2019.05.013⟩. ⟨hal-01891814⟩
236 View
25 Download



Gmail Facebook X LinkedIn More