Top-k Querying of Unknown Values under Order Constraints (Extended Version)
arXiv: Databases, Volume abs/1701.02634, 2017.
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
PPT (Upload PPT)