| Jarke, M. and Koch, J. Query optimisation in database systems, ACM Computing Surveys, 16(2), 1984, pp 111-152. |
....purposes. If, however, both s1 and s2 are known to be finite then the original definition can safely be used in its place. 3.2 Equivalences We now give some equivalences for the functions defined above. Some of these are generalisations of wellknown equivalences for relational databases [Jar84, Ull89]. The main class of equivalences which do not have counterparts in our language are the commutative laws for joins and products. However, if records [Oho89] are used instead of tuples, these equivalences also apply, subject to the provisos stated for join above regarding the termination of its ....
Jarke, M. and Koch, J. Query optimisation in database systems, ACM Computing Surveys, 16(2), 1984.
No context found.
Jarke, M. and Koch, J. Query optimisation in database systems, ACM Computing Surveys, 16(2), 1984, pp 111-152.
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