DBScholar

Back to papers

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)

Paper ID
1749
Venue
PODS
Year
2018
Pagerank
5.4802066e-05
Overall Rank
8,141 | 44.15%
DOI
10.1145/3196959.3196970

Incoming Non-self Citations Over Time

Authors

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.

Previous Page 1 / 1 Next

Semantically Similar Papers