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
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 13,140 | 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.00043653232 |
| 5,384 | A System for Management and Analysis of Preference Data | 2014 | VLDB | 6.309525e-05 |
| 8,627 | A Query Engine for Probabilistic Preferences | 2018 | SIGMOD | 5.4598872e-05 |
| 8,629 | Querying Probabilistic Preferences in Databases | 2017 | PODS | 5.4598872e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,462 | The Complexity of Evaluating Relational Queries | 1983 | PODS | 0.00010781614 |
| 8,883 | Efficient Approximations of Conjunctive Queries | 2012 | PODS | 5.4156287e-05 |
| 773 | Querying Graph Databases | 2013 | PODS | 0.00014183695 |
| 5,463 | Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries | 2021 | PODS | 6.2775582e-05 |
| 8,629 | Querying Probabilistic Preferences in Databases | 2017 | PODS | 5.4598872e-05 |
| 4,273 | Read-Once Functions and Query Evaluation in Probabilistic Databases | 2010 | VLDB | 6.8587835e-05 |
| 12,364 | Query Evaluation with Soft-Key Constraints | 2008 | PODS | 5.1725247e-05 |
| 4,430 | Queries with Incomplete Answers over Semistructured Data | 1999 | PODS | 6.7651355e-05 |
| 50 | Efficient Query Evaluation on Probabilistic Databases | 2004 | VLDB | 0.00043653232 |
| 13,294 | Supporting Hard Queries over Probabilistic Preferences | 2020 | VLDB | - |