ABSTRACT
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.
- S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995. Google Scholar
Digital Library
- A. V. Aho, Y. Sagiv, and J. D. Ullman. Efficient optimization of a class of relational expressions. ACM TODS, 4(4), 1979. Google Scholar
Digital Library
- S. Amer-Yahia, S. Cho, and D. Srivastava. Tree Pattern Relaxation. In EDBT, 2002. Google Scholar
Digital Library
- J. Avigad. Eliminating Definitions and Skolem Functions in First-order Logic. ACM TOCL, 4(3):402--415, 2003. Google Scholar
Digital Library
- F. Bancilhon. On the completeness of query languages for relational data bases. In MFCS, 1978.Google Scholar
Cross Ref
- A. Beckmann. Exact Bounds for Lengths of Reductions in Typed λ-Calculus. J. Symb. Log., 66(3):1277--1285, 2001.Google Scholar
Cross Ref
- M. Benedikt and G. Gottlob. The Impact of Views on Containment, 2010. Manuscript in preparation.Google Scholar
- M. Benedikt and C. Koch. From XQuery to Relational Logics. ACM TODS, 2009. Google Scholar
Digital Library
- P. Buneman and R. Frankel. FQL: a Functional Query Language. In SIGMOD, 1979. Google Scholar
Digital Library
- M. Casanova, R. Fagin, and C. Papadimitriou. Inclusion Dependencies and Their Interaction with Functional Dependencies. JCSS, 28(1):29--59, 1984.Google Scholar
- B. Cautis, A. Deutsch, and N. Onose. Querying Data Sources that Export Infinite sets of Views. In ICDT, 2009. Google Scholar
Digital Library
- A. Chandra and P. Merlin. Optimal Implementation of Conjunctive Queries in Relational Data Bases. In STOC, 1977. Google Scholar
Digital Library
- E. Dantsin, T. Eiter, G. Gottlob, and A. Voronkov. Complexity and Expressive Power of Logic Programming. ACM Comp. Surv., 33(3):374--425, 2001. Google Scholar
Digital Library
- G. H. L. Fletcher, M. Gyssens, J. Paredaens, and D. V. Gucht. On the expressive power of the relational algebra on finite sets of relation pairs. IEEE Trans. Knowl. Data Eng., 21(6):939--942, 2009. Google Scholar
Digital Library
- G. Gottlob, N. Leone, and F. Scarcello. Hypertree Decompositions and Tractable Queries. JCSS, 64(3):579--627, 2002.Google Scholar
- G. Gottlob and C. Papadimitriou. On the Complexity of Single-rule Datalog Queries. Inf. Comput., 183(1), 2003. Google Scholar
Digital Library
- G. Hillebrand and P. Kanellakis. Functional Database Query Languages as Typed Lambda Calculi of Fixed Order. In PODS, 1994. Google Scholar
Digital Library
- G. Hillebrand, P. Kanellakis, and H. Mairson. Database Query Languages Embedded in the Typed Lambda Calculus. In LICS, 1993.Google Scholar
Cross Ref
- D. S. Johnson and A. C. Klug. Testing Containment of Conjunctive Queries under Functional and Inclusion Dependencies. JCSS, 28(1), 1984.Google Scholar
- C. Koch. On the Complexity of Nonrecursive XQuery and Functional Query Languages on Complex Values. ACM TODS, 31(4):1215--1256, 2006 Google Scholar
Digital Library
- N. Koudas, C. Li, A. Tung, and R. Vernica. Relaxing Join and Selection Queries. In VLDB, 2006. Google Scholar
Digital Library
- D. Kozen. Lower Bounds for Natural Proof Systems. In FOCS, 1977. Google Scholar
Digital Library
- L. V. S. Lakshmanan, F. Sadri, and I. N. Subramanian. On the logical foundations of schema integration and evolution in heterogeneous database systems. In DOOD, 1993.Google Scholar
Cross Ref
- A. Levy, A. Rajaraman, and J. Ullman. Answering Queries using Limited External Query Processors. In PODS, 1996. Google Scholar
Digital Library
- A. Levy and D. Suciu. Deciding Containment for Queries with Complex Objects. In PODS, 1997. Google Scholar
Digital Library
- F. Neven, D. Van Gucht, J. Van den Bussche, and G. Vossen. Typed query languages for databases containing queries. In PODS, 1998. Google Scholar
Digital Library
- A. Ohori, P. Buneman, and V. Breazu-Tannen. Database programming in Machiavelli|a polymorphic language with static type inference. In SIGMOD, 1989. Google Scholar
Digital Library
- J. Paredaens. On the expressive power of the relational algebra. Inf. Process. Lett., 7(2):107--111, 1978.Google Scholar
- J. Paredaens and D. Van Gucht. Converting Nested Algebra Expressions into Flat Algebra Expressions. ACM TODS, 17(1):65--93, 1992. Google Scholar
Digital Library
- K. A. Ross. Relations with relation names as arguments: algebra and calculus. In PODS, 1992. Google Scholar
Digital Library
- K. A. Ross. On negation in HiLog. In J. Log. Program., 1994.Google Scholar
Cross Ref
- Y. Sagiv and M. Yannakakis. Equivalences among relational expressions with the union and difference operators. J. ACM, 27(4):633--655, 1980. Google Scholar
Digital Library
- V. Tannen, P. Buneman, and L. Wong. Naturally Embedded Query Languages. In ICDT, 1992. Google Scholar
Digital Library
- M. Y. Vardi. The Complexity of Relational Query Languages. In STOC, 1982. Google Scholar
Digital Library
- V. Vassalos and Y. Papakonstantinou. Expressive Capabilities Description Languages and Query Rewriting Algorithms. The Journal of Logic Programming, 43(1):75 -- 122, 2000.Google Scholar
- S. Vorobyov and A. Voronkov. Complexity of nonrecursive logic programs with complex values. Technical Report MPI-I-97-2-010, Max-Planck Institut fir Informatik, Saarbriicken, November 1997.Google Scholar
- L. Wong. Kleisli, a functional query system. J. Funct. Program., 10(1):19--56, 2000. Google Scholar
Digital Library
- M. Yannakakis. Algorithms for acyclic database schemes. In VLDB, 1981. Google Scholar
Digital Library
Index Terms
Positive higher-order queries
Recommendations
Containment and minimization of positive conjunctive queries in OODB's
PODS '92: Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systemsWith the availability of high-level declarative query languages in an object-oriented database system (OODB), the burden of choosing an efficient execution plan for a query is transferred from the user to the database system. A natural first step is to ...
Counting Answers to Existential Positive Queries: A Complexity Classification
PODS '16: Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database SystemsExistential positive formulas form a fragment of first-order logic that includes and is semantically equivalent to unions of conjunctive queries, one of the most important and well-studied classes of queries in database theory. We consider the ...
Determinacy and query rewriting for conjunctive queries and views
Answering queries using views is the problem which examines how to derive the answers to a query when we only have the answers to a set of views. Constructing rewritings is a widely studied technique to derive those answers. In this paper we consider ...








Comments