In this sectlon, we sketch how Restrlctlon operations can be added to the theory presented In general, these opera- tions cannot be freely reordered m the ...
Our main theorem is that a join/outerjoin query is freely reorderable if the query graph derived from it falls within a particular class, every tree that “ ...
In this sectlon, we sketch how Restrlctlon operations can be added to the theory presented In general, these opera- tions cannot be freely reordered m the ...
Our main theorem is that a join/outerjoin query is freely reorderable if the query graph derived from it falls within a particular class, every tree that “ ...
Jun 6, 1990 · Query graphs, implementing trees, and freely-reorderable outerjoins. Arnon Rosenthal, Cesar Galindo-Legaria. Available in: PDF.
Arnon Rosenthal, César A. Galindo-Legaria: Query Graphs, Implementing Trees, and Freely-Reorderable Outerjoins. SIGMOD Conference 1990: 291-299.
Query graphs represent nonnested Select/Project/Join queries unambiguously, but are generally insufficient to express queries involving outerjoins (or even ...
We determine when a join/outerjoin query can be expressed unambiguously as a query graph, without an explicit specification of the order of evaluation.
Query graphs, implementing trees, and freely- reorderable outerjoins. In Proceedings of the ACM SIGMOD Conference, pages 291-299, 1990. [SAC+79] Patricia G ...
People also ask
What is the difference between trees and graphs?
What is the characterization of a tree in graph theory?
What is a tree in graphs?
Query graphs, implementing trees, and freely-reorderable outerjoins · A ... The main theorem is that a join/outerjoin query is freely reorderable if the ...