Query Graphs, Implementing Trees, and Freely-Reorderable Outerjoins

ACM SIGMOD Record

Volumn 19, Issue 2, 1990, Pages 291-299

  Rosenthal, Arnon ^a   Galindo Legaria, Cesar ^b  

^a ETH Zurich and Xerox AIT ^*  (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES - TREES; OPTIMIZATION;

OUTERJOINS; QUERY GRAPHS;

DATABASE SYSTEMS;

EID: 0025447913     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/93605.98738     Document Type: Article

References (8)

1. C. J. Date, “The Outer Join,” Proceedings of the Second Internattonal Conference on Databases, Cambridge, England, September 1983
2. U. Dayal, “Processing queries with quantifiers,” PODS 1983, pp 125-136.
3. U. Dayal, “Of nests and trees A unified approach to processing queries that contain nested subqueries, aggregates, and quantifiers,” VLDB 1987, pp 197-208.
4. M. Muralikrishna, “Optimization and dataflow algorithms for nested tree queries,” VLDB 1989, pp 77-85
5. G. Ozsoyoglu, V Matos, Z M. Ozsoyoglu, “Query processing techniques in the Summary-Table-by-Example database query language,” ACM Transactions on Database Systems, Vol 14, No 4, December 1989, pp 526-573
6. A. Rosenthal, D Reiner, “Extending the algebraic framework of query processing to handle outerjoins,” VLDB 1984, pp. 334-343
7. A. Rosenthal, D Reiner, “Querying relational views of networks” in Kim et al, Query Processing, Springer-Verlag, New York, 1985
8. M. H. Scholl, H -B Paul, H -J Schek, “Supporting flat relations by a nested relational kernel,” VLDB 1987, pp 137-146.