Top-k Querying of Unknown Values under Order Constraints

ICDT, pp. 5:1-5:18, 2017.

Cited by: 2|Bibtex|Views32|Links
EI

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...More

Code:

Data:

Your rating :
0

 

Tags
Comments