Enumeration for FO Queries over Nowhere Dense Graphs
Summary: For FO queries of arbitrary arity on nowhere-dense databases, solutions can be enumerated with constant delay after pseudo-linear preprocessing. The same preprocessing enables constant-time membership testing for candidate tuples. (summarized by gpt-5.6-luna on Jul 26 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Nicole Schweikardt (Humboldt University of Berlin)
- 2. Luc Segoufin (INRIA; École Normale Supérieure)
- 3. Alexandre Vigny (Paris Diderot University)
BibTeX Citation
@inproceedings{schweikardt_pods18,
address = {New York, NY, USA},
series = {{PODS} '18},
title = {{Enumeration for FO Queries over Nowhere Dense Graphs}},
url = {https://dl.acm.org/doi/10.1145/3196959.3196971},
doi = {10.1145/3196959.3196971},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Schweikardt, Nicole and Segoufin, Luc and Vigny, Alexandre},
year = {2018}
}Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,468 | On the Enumeration Complexity of Unions of Conjunctive Queries | 2019 | PODS | 8.5358494e-05 |
| 5,579 | Enumeration on Trees with Tractable Combined Complexity and Efficient Updates | 2019 | PODS | 6.1637419e-05 |
| 8,141 | First-Order Query Evaluation with Cardinality Conditions | 2018 | PODS | 5.4802066e-05 |
| 8,528 | Aggregate Queries on Sparse Databases | 2020 | PODS | 5.4119882e-05 |
| 8,673 | Fine-Grained Complexity Analysis of Queries: From Decision to Counting and Enumeration | 2020 | PODS | 5.3872753e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 636 | Answering Conjunctive Queries under Updates | 2017 | PODS | 0.0001551856 |
| 4,097 | Enumeration of MSO Queries on Strings with Constant Delay and Logarithmic Updates | 2018 | PODS | 6.9038261e-05 |
| 5,041 | Enumeration of First-Order Queries on Classes of Structures With Bounded Expansion | 2013 | PODS | 6.3897022e-05 |
| 8,141 | First-Order Query Evaluation with Cardinality Conditions | 2018 | PODS | 5.4802066e-05 |
| 13,596 | Enumerating Answers to First-Order Queries over Databases of Low Degree | 2014 | PODS | - |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,154 | Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum | 2026 | PODS |
| 2 | 6,412 | Ranked Enumeration of Join Queries with Projections | 2022 | VLDB |
| 3 | 636 | Answering Conjunctive Queries under Updates | 2017 | PODS |
| 4 | 8,047 | Tight Fine-Grained Bounds for Direct Access on Join Queries | 2022 | PODS |
| 5 | 8,141 | First-Order Query Evaluation with Cardinality Conditions | 2018 | PODS |
| 6 | 5,523 | Dense-Order Constraint Databases (Extended Abstract) | 1995 | PODS |
| 7 | 2,745 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB |
| 8 | 8,528 | Aggregate Queries on Sparse Databases | 2020 | PODS |
| 9 | 13,596 | Enumerating Answers to First-Order Queries over Databases of Low Degree | 2014 | PODS |
| 10 | 5,041 | Enumeration of First-Order Queries on Classes of Structures With Bounded Expansion | 2013 | PODS |