Database Paper Browser

Back to papers

Conjunctive Queries with Negation and Aggregation: A Linear Time Characterization

Summary: Shows CQs with negation admit linear preprocessing + constant-delay enumeration exactly when they are free‑connex signed‑acyclic, with conditional lower bounds excluding other cases. Extends to FAQ with negation over semirings (adds inverse‑Ackermann preprocessing term) and applies to query difference. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1906
Venue
PODS
Year
2024
Pagerank
4.1945683e-05
Overall Rank
10,898 | 24.19%
DOI
10.1145/3651138

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 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 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