The complexity of higher-order queries
From MaRDI portal
Publication:498405
DOI10.1016/J.IC.2015.07.003zbMATH Open1329.68092OpenAlexW1041893548MaRDI QIDQ498405FDOQ498405
Authors: Michael Benedikt, Gabriele Puppis, Huy Vu 
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
Recommendations
Cites Work
- A theory of type polymorphism in programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Testing containment of conjunctive queries under functional and inclusion dependencies
- Inclusion dependencies and their interaction with functional dependencies
- The typed lambda-calculus is not elementary recursive
- Title not available (Why is that?)
- Equivalences Among Relational Expressions with the Union and Difference Operators
- Conjunctive query containment over trees
- On the complexity of single-rule datalog queries.
- Polymorphic type inference for the relational algebra
- Title not available (Why is that?)
- Title not available (Why is that?)
- Relational queries computable in polynomial time
- Typed query languages for databases containing queries
- A simple proof of a theorem of Statman
- On the expressive power of the relational algebra
- Answering queries using limited external query processors
- Database query languages embedded in the typed lambda calculus
- HiLog: A foundation for higher-order logic programming
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Querying data sources that export infinite sets of views
- Well-definedness and semantic type-checking for the nested relational calculus
Cited In (9)
- On the Computational Power of Querying the History
- The query complexity of order-finding
- Title not available (Why is that?)
- Query order in the polynomial hierarchy
- Approximate Query Complexity
- Strongly-Normalizing Higher-Order Relational Queries
- Nesting Depth of Operators in Graph Database Queries: Expressiveness Vs. Evaluation Complexity
- The query complexity of certification
- Title not available (Why is that?)
Uses Software
This page was built for publication: The complexity of higher-order queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q498405)
