On the optimality of strategies for multiple joins

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On the optimality of strategies for multiple joins

Full text

Pdf (707 KB)

Source

Symposium on Principles of Database Systems archive
Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems table of contents

Nashville, Tennessee, United States

Pages: 124 - 131

Year of Publication: 1990

ISBN:0-89791-352-3

Author

Y. C. Tay

Department of Mathematics, National University of Singapore, Kent Ridge 0511, Republic of Singapore

Sponsors

SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 19, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/298514.298550 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	ABU	A. V. Aho , C. Beeri , J. D. Ullman, The theory of joins in relational databases, ACM Transactions on Database Systems (TODS), v.4 n.3, p.297-314, Sept. 1979 [doi>10.1145/320083.320091]
	C	S. Christodoulakis, Implications of certain assumptions in database performance evauation, ACM Transactions on Database Systems (TODS), v.9 n.2, p.163-186, June 1984 [doi>10.1145/329.318578]
	CF	Stavros Christodoulakis , Daniel Alexander Ford, Retrieval performance versus disc space utilization on WORM optical discs, Proceedings of the 1989 ACM SIGMOD international conference on Management of data, p.306-314, June 1989, Portland, Oregon, United States
	D	David J DeWitt , Randy H Katz , Frank Olken , Leonard D Shapiro , Michael R Stonebraker , David Wood, Implementation techniques for main memory database systems, Proceedings of the 1984 ACM SIGMOD international conference on Management of data, June 18-21, 1984, Boston, Massachusetts
	G	Goetz Graefe, Rule-based query optimization in extensible database systems, 1987
	IK	Toshihide Ibaraki , Tiko Kameda, On the optimal nesting order for computing N-relational joins, ACM Transactions on Database Systems (TODS), v.9 n.3, p.482-502, Sept. 1984 [doi>10.1145/1270.1498]
	KBZ	Ravi Krishnamurthy , Haran Boral , Carlo Zaniolo, Optimization of Nonrecursive Queries, Proceedings of the 12th International Conference on Very Large Data Bases, p.128-137, August 25-28, 1986
	OL	K. Ono and G.M. Lohman, Extensible enumeration of feasible joins for relational query optimization, IBM Research Report RJ 6625 (Dec. 1988).
	R	J. Rissanen, Theory of joins for relational databases -- a tutorial survey, Proc. Symposium on Mathematical Foundations of Computer Science, Springer-Verlag, Berlin (1979), 537-551.
	RLM	James P. Richardson , Hongjun Lu , Krishna Mikkilineni, Design and evaluation of parallel pipelined join algorithms, Proceedings of the 1987 ACM SIGMOD international conference on Management of data, p.399-409, May 27-29, 1987, San Francisco, California, United States
	S	A. Swami, Optimization of large join queries: combining heuristics and combinatorial techniques, Proceedings of the 1989 ACM SIGMOD international conference on Management of data, p.367-376, June 1989, Portland, Oregon, United States
	SACLP	P. Griffiths Selinger , M. M. Astrahan , D. D. Chamberlin , R. A. Lorie , T. G. Price, Access path selection in a relational database management system, Proceedings of the 1979 ACM SIGMOD international conference on Management of data, May 30-June 01, 1979, Boston, Massachusetts [doi>10.1145/582095.582099]
	SG	Arun Swami , Anoop Gupta, Optimization of large join queries, Proceedings of the 1988 ACM SIGMOD international conference on Management of data, p.8-17, June 01-03, 1988, Chicago, Illinois, United States
	V	Jeffrey D. Ullman, Principles of database and knowledge-base systems, Vol. I, Computer Science Press, Inc., New York, NY, 1988
	W	K.Y. Whang, Query optimization in Office.by-Example, IBM Research Report RCl1571 (1985).
	WY	Eugene Wong , Karel Youssefi, Decomposition—a strategy for query processing, ACM Transactions on Database Systems (TODS), v.1 n.3, p.223-241, Sept. 1976 [doi>10.1145/320473.320479]
	Y	S. Bing Yao, Optimization of query evaluation algorithms, ACM Transactions on Database Systems (TODS), v.4 n.2, p.133-155, June 1979 [doi>10.1145/320071.320072]

CITED BY 2

	Shinichi Morishita, Avoiding Cartesian products in programs for multiple joins (extended abstract), Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.368-379, June 02-05, 1992, San Diego, California, United States
	César Galindo-Legaria , Arnon Rosenthal, Outerjoin simplification and reordering for query optimization, ACM Transactions on Database Systems (TODS), v.22 n.1, p.43-74, March 1997