J. Tillquist and F. Y. Kuo. An approach to the recursive retrieval problem in relational databases. CACM, 32(2):239--245, Feb 1989.  Home/Search   Document Not in Database   Summary   ACM   TOC   Related Articles   Check

.... 5) The fact that the transitive closure operation can be defined in SPL is important since transitive closure is one of the basic operations to manipulate hierarchical objects which are not supported in conventional database systems and which frequently appear in new database applications [8] [13]. Database manipulation form The special forms introduced thus far do not include update operations such as the destructive substitution operation, appearing in almost all procedural languages. Only database data can be changed by database manipulation forms insert, delete and update. Note that ....

J. Tillquist and F. Y. Kuo. An approach to the recursive retrieval problem in relational databases. CACM, 32(2):239--245, Feb 1989.

....name = E4 ) union( student.ext. select( E4 in id Gamma courses. apply( id Gamma instructor Gamma dept Gamma dept name ) 3.3. 4 Close The operation close(f) is defined in order to provide the end user with a simple tool for the manipulation of recursive data structures [52]. Its semantics is defined as follows. Given an argument set s that contains instances of type T, the closure of this set is computed using the parameter function expression f. The result of the evaluation of the function f must be instances of type T. The operation is formally defined as ....

J. Tillquist, F.-Y. Kuo, An approach to the recursive retrieval problem in the relational databases, Communications of the ACM, 32(2), Feb. 1989, pp. 239-245.

No context found.

J. Tillquist, F.Y. Kuo, An approach to the recursive retrieval problem in the relational databases, Comm. of the ACM, Feb. 1989, Vol.32, No.2

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