Enumerating Answers to First-Order Queries over Databases of Low Degree
Summary: Generalizes pseudo-linear-time FO model checking on low-degree database classes to full query evaluation: tuple counting in time n^{1+ε} for all ε. Also achieves constant-delay enumeration after n^{1+ε} preprocessing. (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. Arnaud Durand (National Centre for Scientific Research; École Normale Supérieure de Cachan)
- 2. Nicole Schweikardt (Goethe University Frankfurt)
- 3. Luc Segoufin (INRIA; École Normale Supérieure de Cachan)
BibTeX Citation
@inproceedings{durand_pods14,
address = {New York, NY, USA},
series = {{PODS} '14},
title = {{Enumerating Answers to First-Order Queries over Databases of Low Degree}},
url = {https://dl.acm.org/doi/10.1145/2594538.2594539},
doi = {10.1145/2594538.2594539},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Durand, Arnaud and Schweikardt, Nicole and Segoufin, Luc},
year = {2014}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,063 | Enumeration for FO Queries over Nowhere Dense Graphs | 2018 | PODS | 6.9307541e-05 |
| 4,097 | Enumeration of MSO Queries on Strings with Constant Delay and Logarithmic Updates | 2018 | PODS | 6.9038261e-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 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 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 | 2,777 | Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration | 2020 | PODS |
| 2 | 9,009 | Efficient Approximations of Conjunctive Queries | 2012 | PODS |
| 3 | 9,819 | Probabilistic Databases under Updates: Boolean Query Evaluation and Ranked Enumeration | 2021 | PODS |
| 4 | 1,467 | The Complexity of Evaluating Relational Queries | 1983 | PODS |
| 5 | 6,412 | Ranked Enumeration of Join Queries with Projections | 2022 | VLDB |
| 6 | 2,745 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB |
| 7 | 8,528 | Aggregate Queries on Sparse Databases | 2020 | PODS |
| 8 | 636 | Answering Conjunctive Queries under Updates | 2017 | PODS |
| 9 | 4,063 | Enumeration for FO Queries over Nowhere Dense Graphs | 2018 | PODS |
| 10 | 5,041 | Enumeration of First-Order Queries on Classes of Structures With Bounded Expansion | 2013 | PODS |