Top-k Querying of Unknown Values under Order Constraints

Abstract : Many practical scenarios make it necessary to evaluate top-k queries over data items with partially unknown values. This paper considers a setting where the values are taken from a numerical domain, and where some partial order constraints are given over known and unknown values: under these constraints, we assume that all possible worlds are equally likely. Our work is the first to propose a principled scheme to derive the value distributions and expected values of unknown items in this setting, with the goal of computing estimated top-k results by interpolating the unknown values from the known ones. We study the complexity of this general task, and show tight complexity bounds, proving that the problem is intractable, but can be tractably approximated. We then consider the case of tree-shaped partial orders, where we show a constructive PTIME solution. We also compare our problem setting to other top-k definitions on uncertain data.
Document type :
Conference papers
Complete list of metadatas

Cited literature [46 references]  Display  Hide  Download

https://hal.inria.fr/hal-01439295
Contributor : Pierre Senellart <>
Submitted on : Wednesday, January 18, 2017 - 2:50:59 PM
Last modification on : Friday, June 7, 2019 - 11:18:32 AM
Long-term archiving on : Wednesday, April 19, 2017 - 2:32:47 PM

File

amarilli2017top.pdf
Files produced by the author(s)

Identifiers

Citation

Antoine Amarilli, Yael Amsterdamer, Tova Milo, Pierre Senellart. Top-k Querying of Unknown Values under Order Constraints. ICDT 2017 - International Conference on Database Theory, Mar 2017, Venice, Italy. ⟨10.4230/LIPIcs.ICDT.2017.5⟩. ⟨hal-01439295⟩

Share

Metrics

Record views

438

Files downloads

106