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.
Sven Schewe; Thomas Schneider; Jef Wijsen. 24th International Symposium on Temporal Representation and Reasoning (TIME 2017), Oct 2017, Mons, Belgium. Schloss Dagstuhl, Leibniz International Proceedings in Informatics, 90, pp.4:1-4:19, 〈http://informatique.umons.ac.be/time2017/〉. 〈10.4230/LIPIcs.TIME.2017.4〉
https://hal.inria.fr/hal-01570603
Contributeur : Pierre Senellart
<>
Soumis le : lundi 31 juillet 2017 - 12:20:05
Dernière modification le : mardi 24 avril 2018 - 17:20:16
Antoine Amarilli, Mouhamadou Lamine Ba, Daniel Deutch, Pierre Senellart. Possible and Certain Answers for Queries over Order-Incomplete Data. Sven Schewe; Thomas Schneider; Jef Wijsen. 24th International Symposium on Temporal Representation and Reasoning (TIME 2017), Oct 2017, Mons, Belgium. Schloss Dagstuhl, Leibniz International Proceedings in Informatics, 90, pp.4:1-4:19, 〈http://informatique.umons.ac.be/time2017/〉. 〈10.4230/LIPIcs.TIME.2017.4〉. 〈hal-01570603〉
