ACM Home Page
Please provide us with feedback. Feedback
Equivalences Among Relational Expressions with the Union and Difference Operators
Full text PdfPdf (1.42 MB)
Source Journal of the ACM (JACM) archive
Volume 27 ,  Issue 4  (October 1980) table of contents
Pages: 633 - 655  
Year of Publication: 1980
ISSN:0004-5411
Authors
Yehoshua Sagiv  Department of Computer Science, University of Illinois, Urhana, IL
Mihalis Yannakakis  Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ and Princeton University, Princeton, New Jersey
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 67,   Citation Count: 102
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/322217.322221
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.

1
 
2
 
3
AHO, A V, SAGIV, Y, SZVMANSKI, T G, AND ULI MAN, J D inferring a tree from lowest common ancestors with an apphcatlon to the optimlzatmn of relatmnal expressions Proc 16th Ann Allerton Conf on Commumcauon, Control and Computing, Monticello, I11,85Oct 1978, pp 54-63
 
4
AHO, A V, SAGIV, Y, AND ULLMAN, J D Equivalences among relational expressions SlAM J Comput 8, 2 (1979), 218-246
5
 
6
Aao, A V, SETHI, R, AND ULLMAN, J.D Code opumtzation and finite Church-Rosser systems In Design and Opnmlzatwn of Compders, R Rustm, Ed, Prentice Hall, Englewood Cliffs, N J, 1972, pp 89-105
 
7
ARMSTRONG, W W Dependency structures of data base relationship Proc IFIP 74, North Holland, New York, 1974, pp 580-583
8
9
10
 
11
CODD, E F Relational completeness of data base sublanguages. In Data Base Systems, R Rustm, Ed, Prentice Hall, Englewood Cliffs, N J, 1972, pp 65-98
 
12
EVEN, S,ITAI, A, AND SHAMIR, A On the complexRy of timetable and mulucommodlty flow problems SIA M J Comput 5, 4 (1976), pp 691-703
 
13
 
14
GAVRIL,F Testing for equahty between maximum matching and minimum node covenng, Inform Proc Left 6, 6 (1977), 199-202
 
15
HALL, PAV Optimization of a single relational expression m a relauonal database system IBM J Res Dev 20, 3 (1976), 244-257
 
16
KARP, R M Reduobdtty among combinatorial problems in Complexity of Computer Computatwns, R E Miller and J W Thatcher, Eds, Plenum Press, New York, 1972, pp 85-103
17
 
18
PALERMO, FP A database search problem In lnformatwn Systems COINS IV, J T Tou, Ed, Plenum Press, New York, 1974
 
19
PECHERER, R M Efficient evaluation of expressions m a relational algebra Proc. ACM Pacific Conf, San Francisco, Cahf, Aprd 1975, pp 44--49
 
20
21
 
22
STOCKMEYFR, L J The polynomlal-ttme hierarchy Theor Comput Sct 3, I (1976), 1-22
23
 
24
WRATHALL, C Complete sets and the polynomial-time hierarchy Theor Comp Sct 3, i (1976), 23-33
 
25
YANNAKAKIS, M Unpubhshed manuscript

CITED BY  102

Collaborative Colleagues:
Yehoshua Sagiv: colleagues
Mihalis Yannakakis: colleagues