A. K. Chandra and P. Merlin.'"Optimal implementation of conjunerive queries in relational databases," in Proc. 9th ACM S?np. Theory, of Computing, Boulder. CO. 1977. pp. 77-90.  Home/Search   Document Not in Database   Summary   Related Articles

....have an attribute named responsibility of whose value is Jim Brown. Then one might ask for all activities that are started within any of those states, and so on. This query language, on the face of it, might appear to be bounded in its expressive power by that of the conjunctive queries of [2]. However, since it actually supports certain kinds of transitive closures (such as the ancestor and descendent relationships between states or activities) it is not directly comparable with the conjunc tive queries, and can be shown to be a subset of the more general fixpoint queries (see ....

A. K. Chandra and P. Merlin.'"Optimal implementation of conjunerive queries in relational databases," in Proc. 9th ACM S?np. Theory, of Computing, Boulder. CO. 1977. pp. 77-90.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC