The complexity of higher-order queries
From MaRDI portal
Publication:498405
DOI10.1016/j.ic.2015.07.003zbMath1329.68092OpenAlexW1041893548MaRDI QIDQ498405
Michael Benedikt, Huy Vu, Gabriele Puppis
Publication date: 28 September 2015
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2015.07.003
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conjunctive query containment over trees
- Querying data sources that export infinite sets of views
- Polymorphic type inference for the relational algebra
- Well-definedness and semantic type-checking for the nested relational calculus
- Testing containment of conjunctive queries under functional and inclusion dependencies
- Inclusion dependencies and their interaction with functional dependencies
- A simple proof of a theorem of Statman
- On the expressive power of the relational algebra
- A theory of type polymorphism in programming
- The typed lambda-calculus is not elementary recursive
- Answering queries using limited external query processors
- On the complexity of single-rule datalog queries.
- Database query languages embedded in the typed lambda calculus
- Typed query languages for databases containing queries
- Relational queries computable in polynomial time
- Equivalences Among Relational Expressions with the Union and Difference Operators
- HiLog: A foundation for higher-order logic programming
- On negation in Hilog
- Expressive capabilities description languages and query rewriting algorithms
- Eliminating definitions and Skolem functions in first-order logic
- Database Theory - ICDT 2005
This page was built for publication: The complexity of higher-order queries
