Non-Linear Prefixes in Query Languages
Summary: Introduce non-linear quantifier prefixes (branching and cumulation) for query languages, focusing on monadic quantifiers to control complexity; show branching adds no power over finite models and cumulation none over bounded models. Both give succinct encodings, embed into Libkin's infinitary logic over infinite models, and the paper discusses algorithmic consequences. (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
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 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,948 | Groupwise Processing of Relational Queries | 1997 | VLDB | 9.989482e-05 |
| 3,676 | Providing Better Support for a Class of Decision Support Queries | 1996 | SIGMOD | 6.8547125e-05 |
Previous
Page 1 / 1
Next