Database Paper Browser

Back to papers

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)

Paper ID
1615
Venue
PODS
Year
2014
Pagerank
-
Overall Rank
13,395 | 6.82%
DOI
10.1145/2594538.2594539

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
8,652 Fine-Grained Complexity Analysis of Queries: From Decision to Counting and Enumeration 2020 PODS 4.4753042e-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
6,167 Enumeration of First-Order Queries on Classes of Structures With Bounded Expansion 2013 PODS 5.1717635e-05
Previous Page 1 / 1 Next

Semantically Similar Papers