First-Order Query Evaluation with Cardinality Conditions
Summary: FOC(P) loses fixed-parameter tractability even on unranked trees and ordered strings. A restricted fragment, FOC₁(P), retains practical COUNT expressiveness and is fixed-parameter tractable on nowhere-dense classes, including FO query counting. (summarized by gpt-5.6-luna on Jul 26 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Martin Grohe (Rheinisch-Westphalian Technical University Aachen)
- 2. Nicole Schweikardt (Humboldt University of Berlin)
BibTeX Citation
@inproceedings{grohe_pods18,
address = {New York, NY, USA},
series = {{PODS} '18},
title = {{First-Order Query Evaluation with Cardinality Conditions}},
url = {https://dl.acm.org/doi/10.1145/3196959.3196970},
doi = {10.1145/3196959.3196970},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Grohe, Martin and Schweikardt, Nicole},
year = {2018}
}
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,063 | Enumeration for FO Queries over Nowhere Dense Graphs | 2018 | PODS | 6.9307541e-05 |
| 8,528 | Aggregate Queries on Sparse Databases | 2020 | PODS | 5.4119882e-05 |
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 |
|---|---|---|---|---|
| 414 | On the Complexity of Database Queries (Extended Abstract) | 1997 | PODS | 0.00018893507 |
| 4,063 | Enumeration for FO Queries over Nowhere Dense Graphs | 2018 | PODS | 6.9307541e-05 |
| 5,041 | Enumeration of First-Order Queries on Classes of Structures With Bounded Expansion | 2013 | PODS | 6.3897022e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,528 | Aggregate Queries on Sparse Databases | 2020 | PODS |
| 2 | 8,084 | Symmetric Weighted First-Order Model Counting | 2015 | PODS |
| 3 | 14,423 | Expressibility of Bounded-Arity Fixed-Point Query Hierarchies | 1989 | PODS |
| 4 | 7,088 | On the First-order Expressibility of Computing Certain Answers to Conjunctive Queries over Uncertain Databases | 2010 | PODS |
| 5 | 12,229 | The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space Complexity | 2013 | PODS |
| 6 | 11,522 | On the Parameterized Complexity of Learning First-Order Logic | 2022 | PODS |
| 7 | 5,041 | Enumeration of First-Order Queries on Classes of Structures With Bounded Expansion | 2013 | PODS |
| 8 | 4,063 | Enumeration for FO Queries over Nowhere Dense Graphs | 2018 | PODS |
| 9 | 4,266 | Counting Answers to Existential Positive Queries: A Complexity Classification | 2016 | PODS |
| 10 | 13,596 | Enumerating Answers to First-Order Queries over Databases of Low Degree | 2014 | PODS |