Avoiding cartesian products for multiple joins

Journal of the ACM

Volumn 44, Issue 1, 1997, Pages 57-85

  Morishita, Shinichi ^a,b  

^a IBM RESEARCH   (United States)

^b IBM RESEARCH TOKYO   (Japan)

Author keywords

Algorithms; Cartesian product; Database scheme; Database Theory; Join expression tree; Join strategy; Languages Additional; Optimality; Semijoin

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; CONTROL SYSTEMS; DATA STRUCTURES; DATABASE SYSTEMS; OPTIMIZATION; PROBLEM SOLVING; QUERY LANGUAGES;

CARTESIAN PRODUCT; DATABASE SCHEME; JOIN EXPRESSION TREE; JOIN STRATEGY; OPTIMALITY; SEMIJOIN;

ALGORITHMS;

EID: 0030677626     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/256292.256296     Document Type: Article

References (13)

1. BEERI, C. R., FAGIN, R., MAIER, D., AND VANNAKAKIS, M. 1983. On the desirability of acyclic database schemas. J. ACM 30, 3 (July), 479-513.
2. BERNSTEIN, P. A., AND GOODMAN, N. 1981. The power of natural semijoins. SIAM J. Comput. 10, 4 (Nov.) 751-771.
3. CHANDRA, A. K., AND MERLIN, P. M. 1977. Optimal implementation of conjunctive queries in relational data bases. In Proceedings of the 9th ACM Symposium on the Theory of Computing, (Boulder, Colo., May 2-4). ACM, New York, pp. 77-90.
4. GOODMAN, N., AND SHMUELI, O. 1984. The tree projection theorem and relational query processing. J. Comput. Syst. Sci. 28, 1 (Feb.), 60-79.
5. SAGIV, Y., AND SHMUELI, O. 1993. Solving queries by tree projections. ACM Trans. Database Syst. 18, 3 (Sept.), 487-511.
6. SELINGER, P. G., ASTRAHAN, M. M., CHAMBERLIN, D. D., LORIE, P. A., AND PRICE, T. G. 1979. Access path selection in a relational database system. In Proceedings of the 1979 ACM-SIGMOD International Conference on Management of Data (Boston, Mass., May 30-June 1). ACM, New York, pp. 23-34.
7. SMITH, D. E., AND GENESERETH, M. R. 1985. Ordering conjunctive queries. Artif. Intell. 26, 171-215.
8. SWAMI, A., AND GUPTA, A. 1988. Optimization of large join queries. In Proceedings of the 1988 ACM-SIGMOD International Conference on Management of Data (Chicago, Ill., June 1-3). ACM, New York, 1988, pp. 8-17.
9. SWAMI, A. 1989. Optimization of large join queries: Combining heuristics and combinatorial techniques. In Proceedings of the 1989 ACM-SIGMOD International Conference on Management of Data (Portland, Ore., May 31-June 2). ACM, New York, 367-376.
10. TAY, Y. C. 1993. On the optimality of strategies for multiple joins. J. ACM 40, 5 (Nov.), 1067-1086.
11. ULLMAN, J. D. 1989. Principles of Database and Knowledge-Base Systems, vol. 2. Computer Science Press, New York.
12. WONG, E., AND YOUSEFFI, K. 1976. Decomposition-A strategy for query processing. ACM Trans. Database Syst. 1, 3, (Sept.), 223-241.
13. YANNAKAKIS, M. 1981. Algorithms for acyclic database schemes. In Proceedings of the International Conference on Very Large Data Bases (Cannes, France, Sept. 9-11). ACM, New York, pp. 82-94.