Querying Probabilistic Preferences in Databases
Summary: Embed probabilistic preference symbols in relational schemas, representing each preference as distributions like RIM/Mallows to model uncertain binary preferences in PDBs. Reduce CQ evaluation to a new inference problem over RIM, prove complexity bounds and give a polynomial‑data solver. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Batya Kenig (Technion)
- 2. Benny Kimelfeld (Technion)
- 3. Haoyue Ping (Drexel University)
- 4. Julia Stoyanovich (Drexel University)
BibTeX Citation
@inproceedings{kenig_pods17,
address = {New York, NY, USA},
series = {{PODS} '17},
title = {{Querying Probabilistic Preferences in Databases}},
url = {https://dl.acm.org/doi/10.1145/3034786.3056111},
doi = {10.1145/3034786.3056111},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Kenig, Batya and Kimelfeld, Benny and Ping, Haoyue and Stoyanovich, Julia},
year = {2017}
}Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,743 | A Query Engine for Probabilistic Preferences | 2018 | SIGMOD | 5.3766157e-05 |
| 11,530 | The Gibbs–Rand Model | 2022 | PODS | 5.093636e-05 |
| 11,837 | Query Evaluation in Election Databases | 2019 | PODS | 5.093636e-05 |
| 13,383 | Most Expected Winner: An Interpretation of Winners over Uncertain Voter Preferences | 2023 | SIGMOD | - |
| 13,483 | Supporting Hard Queries over Probabilistic Preferences | 2020 | VLDB | - |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 50 | Efficient Query Evaluation on Probabilistic Databases | 2004 | VLDB | 0.00043596705 |
| 656 | Foundations of Preferences in Database Systems | 2002 | VLDB | 0.00015258172 |
| 7,642 | A System for Management and Analysis of Preference Data | 2014 | VLDB | 5.5765908e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,041 | The Dichotomy of Conjunctive Queries on Probabilistic Structures | 2007 | PODS |
| 2 | 644 | The Complexity of Query Reliability | 1998 | PODS |
| 3 | 4,301 | Read-Once Functions and Query Evaluation in Probabilistic Databases | 2010 | VLDB |
| 4 | 3,698 | Optimizing MPF Queries: Decision Support and Probabilistic Inference | 2007 | SIGMOD |
| 5 | 2,088 | The reliability of queries (Extended Abstract) | 1995 | PODS |
| 6 | 7,317 | Probabilistic Query Evaluation: The Combined FPRAS Landscape | 2023 | PODS |
| 7 | 7,706 | Conjunctive Queries on Probabilistic Graphs: Combined Complexity | 2017 | PODS |
| 8 | 50 | Efficient Query Evaluation on Probabilistic Databases | 2004 | VLDB |
| 9 | 13,483 | Supporting Hard Queries over Probabilistic Preferences | 2020 | VLDB |
| 10 | 8,743 | A Query Engine for Probabilistic Preferences | 2018 | SIGMOD |