Skyline Queries with Noisy Comparisons

Benoit Groz 1, 2, 3 Tova Milo 3
1 OAK - Database optimizations and architectures for complex large data
CNRS - Centre National de la Recherche Scientifique : UMR8623, Inria Saclay - Ile de France, UP11 - Université Paris-Sud - Paris 11, LRI - Laboratoire de Recherche en Informatique
Abstract : We study in this paper the computation of skyline queries-a popular tool for multicriteria data analysis-in the presence of noisy input. Motivated by crowdsourcing applications, we present the first algorithms for skyline evaluation in a computation model where the input data items can only be compared through noisy comparisons. In this model comparisons may return wrong answers with some probability, and confidence can be increased through independent repetitions of a comparison. Our goal is to minimize the number of comparisons required for computing or verifying a candidate skyline, while returning the correct answer with high probability. We design output-sensitive algorithms, namely algorithms that take advantage of the potentially small size of the skyline, and analyze the number of comparison rounds of our solutions. We also consider the problem of predicting the most likely skyline given some partial information in the form of noisy comparisons, and show that optimal prediction is computationally intractable.
Complete list of metadatas

Cited literature [46 references]  Display  Hide  Download

https://hal.inria.fr/hal-01146568
Contributor : Benoit Groz <>
Submitted on : Tuesday, April 28, 2015 - 3:15:49 PM
Last modification on : Tuesday, January 1, 2019 - 6:46:02 AM
Long-term archiving on : Wednesday, April 19, 2017 - 9:13:48 AM

File

groz-milo-skylines-hal.pdf
Files produced by the author(s)

Identifiers

Citation

Benoit Groz, Tova Milo. Skyline Queries with Noisy Comparisons. ACM SIGMOD/PODS, May 2015, Melbourne, Australia. ⟨10.1145/2745754.2745775⟩. ⟨hal-01146568⟩

Share

Metrics

Record views

401

Files downloads

774