Possible and Certain Answers for Queries over Order-Incomplete Data - Archive ouverte HAL Access content directly
Conference Papers Year :

Possible and Certain Answers for Queries over Order-Incomplete Data

(1) , (2) , (3) , (4, 5)
1
2
3
4
5

Abstract

To combine and query ordered data from multiple sources, one needs to handle uncertainty about the possible orderings. Examples of such “order-incomplete” data include integrated event sequences such as log entries; lists of properties (e.g., hotels and restaurants) ranked by an unknown function reflecting relevance or customer ratings; and documents edited concurrently with an uncertain order on edits. This paper introduces a query language for order-incomplete data, based on the positive relational algebra with order-aware accumulation. We use partial orders to represent order-incomplete data, and study possible and certain answers for queries in this context. We show that these problems are respectively NP-complete and coNP-complete, but identify many tractable cases depending on the query operators or input partial orders.
Fichier principal
Vignette du fichier
1707.07222.pdf (1.12 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01614571 , version 2 (31-07-2017)
hal-01614571 , version 1 (11-10-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Antoine Amarilli, Mouhamadou Lamine Ba, Daniel Deutch, Pierre Senellart. Possible and Certain Answers for Queries over Order-Incomplete Data. 24th International Symposium on Temporal Representation and Reasoning (TIME 2017), Oct 2017, Mons, Belgium. pp.4:1-4:19, ⟨10.4230/LIPIcs.TIME.2017.4⟩. ⟨hal-01614571v2⟩
785 View
122 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More