Database programming in Machiavelli—a polymorphic language with static type inference
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Converting nested algebra expressions into flat algebra expressions
ACM Transactions on Database Systems (TODS)
Relations with relation names as arguments: algebra and calculus
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Functional database query languages as typed lambda calculi of fixed order (extended abstract)
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Answering queries using limited external query processors (extended abstract)
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Deciding containment for queries with complex objects (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Typed query languages for databases containing queries
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient optimization of a class of relational expressions
ACM Transactions on Database Systems (TODS)
Equivalences Among Relational Expressions with the Union and Difference Operators
Journal of the ACM (JACM)
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
FQL: a functional query language
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Naturally Embedded Query Languages
ICDT '92 Proceedings of the 4th International Conference on Database Theory
Eliminating definitions and Skolem functions in first-order logic
ACM Transactions on Computational Logic (TOCL)
On the complexity of single-rule datalog queries
Information and Computation - Special issue: ICC '99
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Kleisli, a functional query system
Journal of Functional Programming
Relaxing join and selection queries
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
On the complexity of nonrecursive XQuery and functional query languages on complex values
ACM Transactions on Database Systems (TODS)
Algorithms for acyclic database schemes
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Lower bounds for natural proof systems
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Querying data sources that export infinite sets of views
Proceedings of the 12th International Conference on Database Theory
On the Expressive Power of the Relational Algebra on Finite Sets of Relation Pairs
IEEE Transactions on Knowledge and Data Engineering
From XQuery to relational logics
ACM Transactions on Database Systems (TODS)
The impact of virtual views on containment
Proceedings of the VLDB Endowment
Complexity of higher-order queries
Proceedings of the 14th International Conference on Database Theory
Hi-index | 0.00 |
We investigate a higher-order query language that embeds operators of the positive relational algebra within the simply-typed λ-calculus. Our language allows one to succinctly define ordinary positive relational algebra queries (conjunctive queries and unions of conjunctive queries) and, in addition, second-order query functionals, which allow the transformation of CQs and UCQs in a generic (i.e., syntax-independent) way. We investigate the equivalence and containment problems for this calculus, which subsumes traditional CQ/UCQ containment. Query functionals are said to be equivalent if the output queries are equivalent, for each possible input query, and similarly for containment. These notions of containment and equivalence depend on the class of (ordinary relational algebra) queries considered. We show that containment and equivalence are decidable when query variables are restricted to positive relational algebra and we identify the precise complexity of the problem. We also identify classes of functionals where containment is tractable. Finally, we provide upper bounds to the complexity of the containment problem when functionals act over other classes.