We consider the class of path-conjunctive queries and constraints (dependencies) defined over complex values with dictionaries. This class includes the relational conjunctive queries and embedded dependencies, as well as many interesting examples of complex value and oodb queries and integrity constraints. We show that some important classical results on containment, dependency implication, and chasing extend and generalize to this class.
CITATION STYLE
Popa, L., & Tannen, V. (1998). An equational chase for path-conjunctive queries, constraints, and views. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1540, pp. 39–57). Springer Verlag. https://doi.org/10.1007/3-540-49257-7_4
Mendeley helps you to discover research relevant for your work.