3 citations · 3 across the 1 of their papers we have counts for
2 papers
cs.DB2018
Computing Possible and Certain Answers over Order-Incomplete Data
Antoine Amarilli, Mouhamadou Lamine Ba, Daniel Deutch +1
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 f…
cs.DB2017★ 3 cited
Possible and Certain Answers for Queries over Order-Incomplete Data
Antoine Amarilli, Mouhamadou Lamine Ba, Daniel Deutch +1
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 e…