Skip to main content

Positive Higher−Order Queries

Michael Benedikt‚ Gabriele Puppis and Huy Vu


We investigate a higher-order query language that embeds operators of the positive relational algebra within the simply-typed Lambda-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.

Oxford University
PODS: The 29th ACM SIGMOD−SIGACT−SIGART Symposium on Principles of Database Systems
Indianapolis‚ Indiana‚ USA