Database Paper Browser

Back to papers

Supporting Hard Queries over Probabilistic Preferences

Summary: Evaluates hard CQ unions over probabilistic preferences by instantiating item variables and rewriting into unions. Develops exact solvers for hard CQ patterns and efficient approximate solvers via importance sampling, plus count and top-k queries. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
12032
Venue
VLDB
Year
2020
Pagerank
-
Overall Rank
13,281 | 7.61%
DOI
10.14778/3384345.3384359

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
13,180 Most Expected Winner: An Interpretation of Winners over Uncertain Voter Preferences 2023 SIGMOD -
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
8,538 A Query Engine for Probabilistic Preferences 2018 SIGMOD 4.4937074e-05
8,541 Querying Probabilistic Preferences in Databases 2017 PODS 4.4937074e-05
Previous Page 1 / 1 Next

Semantically Similar Papers