Query Evaluation in Election Databases
Summary: Complexity-theoretic study of query evaluation over election databases combining voters' partial orders with relational context, using possible/necessary answer semantics for unions of conjunctive queries under positional scoring rules. Delineates tractability/intractability for various scoring rules and UCQ classes, and proves fixed-parameter tractability parameterized by number of candidates. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Benny Kimelfeld (Technion)
- 2. Phokion G. Kolaitis (IBM Research — Almaden; University of California Santa Cruz)
- 3. Muhammad Tibi (Technion)
BibTeX Citation
@inproceedings{kimelfeld_pods19,
address = {New York, NY, USA},
series = {{PODS} '19},
title = {{Query Evaluation in Election Databases}},
url = {https://dl.acm.org/doi/10.1145/3294052.3319692},
doi = {10.1145/3294052.3319692},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Kimelfeld, Benny and Kolaitis, Phokion G. and Tibi, Muhammad},
year = {2019}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 13,331 | DVote: Constraining Committee Voting with Database Dependencies | 2025 | VLDB | - |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 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 |
| 7,642 | A System for Management and Analysis of Preference Data | 2014 | VLDB | 5.5765908e-05 |
| 8,743 | A Query Engine for Probabilistic Preferences | 2018 | SIGMOD | 5.3766157e-05 |
| 8,745 | Querying Probabilistic Preferences in Databases | 2017 | PODS | 5.3766157e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,467 | The Complexity of Evaluating Relational Queries | 1983 | PODS |
| 2 | 9,009 | Efficient Approximations of Conjunctive Queries | 2012 | PODS |
| 3 | 747 | Querying Graph Databases | 2013 | PODS |
| 4 | 4,781 | Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries | 2021 | PODS |
| 5 | 8,745 | Querying Probabilistic Preferences in Databases | 2017 | PODS |
| 6 | 4,301 | Read-Once Functions and Query Evaluation in Probabilistic Databases | 2010 | VLDB |
| 7 | 12,549 | Query Evaluation with Soft-Key Constraints | 2008 | PODS |
| 8 | 4,495 | Queries with Incomplete Answers over Semistructured Data | 1999 | PODS |
| 9 | 50 | Efficient Query Evaluation on Probabilistic Databases | 2004 | VLDB |
| 10 | 13,483 | Supporting Hard Queries over Probabilistic Preferences | 2020 | VLDB |