Positive Higher-Order Queries
Summary: Embeds positive relational algebra into a simply-typed lambda-calculus to express CQs/UCQs and higher-order, syntax-independent query functionals. Shows decidability and gives exact complexity for equivalence/containment when variables range over positive RA, identifies tractable fragments and provides upper bounds for other target classes. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Michael Benedikt
- 2. Gabriele Puppis
- 3. Huy Vu
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,375 | Query Shredding: Efficient Relational Evaluation of Queries over Nested Multisets | 2014 | SIGMOD | 7.1633324e-05 |
| 7,275 | The Impact of Virtual Views on Containment | 2010 | VLDB | 4.7806552e-05 |
| 12,195 | HOMES: A Higher-Order Mapping Evaluation System | 2011 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 12 of 12 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next