Yehoshua Sagiv
- 1 AHO, A V, BEERI, C, AND ULLMAN, J D The theory of joins m relational databases A CM Trans Database Syst 4, 3 (Sept 1979), 297-314 Google Scholar
- 2 AHO A,V, HOPCROFT, J.E, AND ULLMAN, J D The Destgn and Analysts of Computer Algorahms Addison- Wesley, Reading, Mass, 1974 Google Scholar
- 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-63Google Scholar
- 4 AHO, A V, SAGIV, Y, AND ULLMAN, J D Equivalences among relational expressions SlAM J Comput 8, 2 (1979), 218-246Google Scholar
- 5 AHO, A V, SAOW, Y, ANt) ULLMAN, J D Efficient optimization of a class of relational expressions A CM Trans Database Syst 4, 4 (Dec 1979), 435-454 Google Scholar
- 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-105Google Scholar
- 7 ARMSTRONG, W W Dependency structures of data base relationship Proc IFIP 74, North Holland, New York, 1974, pp 580-583Google Scholar
- 8 BEERI, C, FAGIN, R, AND HOWARD, J H A complete axlomaUzaUon for functional and multwalued dependencies. Proc ACM-SIGMOD Intern. Conf on the Management of Data, Toronto, Ontario, Canada, August 1977, pp 47-61. Google Scholar
- 9 CHANDRA, A K, AND MERLIN, P M Optimal implementation of conjunctive queries in relational data bases Proc 9th Ann ACM Syrup on Theory of Computing, Boulder, Colo, May 1977, pp 77-90 Google Scholar
- 10 CODD, E F A relational model of data for large shared data banks, Commun A CM 13, 6 (June 1970), 377- 387 Google Scholar
- 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-98Google Scholar
- 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-703Google Scholar
- 13 GARE~, M R, AND JOHNSON, D S Computers and lntractabdtty A Grade to the Theory of NP-Completeness Freeman, San Francisco, 1978 Google Scholar
- 14 GAVRIL,F Testing for equahty between maximum matching and minimum node covenng, Inform Proc Left 6, 6 (1977), 199-202Google Scholar
- 15 HALL, PAV Optimization of a single relational expression m a relauonal database system IBM J Res Dev 20, 3 (1976), 244-257Google Scholar
- 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-103Google Scholar
- 17 MINKER, J Performing inferences over relational databases Pro~. ACM-SIGMOD Intern Conf on the Management of Data, San Jose, Cahf, May 1975, pp 79-91 Google Scholar
- 18 PALERMO, FP A database search problem In lnformatwn Systems COINS IV, J T Tou, Ed, Plenum Press, New York, 1974Google Scholar
- 19 PECHERER, R M Efficient evaluation of expressions m a relational algebra Proc. ACM Pacific Conf, San Francisco, Cahf, Aprd 1975, pp 44--49Google Scholar
- 20 SAGIV, Y Optimization of queries m relauonal databases Ph D Thes~s, Dept of Electrical Engineering and Computer Science, Prmceton Umvers~ty, Princeton. N J, August 1978 Google Scholar
- 21 SMITH, J M, AND CHANG, P Y-T OpUmtzmg the performance of a relational algebra database interface Commun ACM 18, 10 (Oct 1975), 568-579 Google Scholar
- 22 STOCKMEYFR, L J The polynomlal-ttme hierarchy Theor Comput Sct 3, I (1976), 1-22Google Scholar
- 23 WONG, E, AND YOUSSEFI, K Decomposmon--a strategy for query processing A CM Trans Database Syst 1, 3 (Sept 1976), 223-241 Google Scholar
- 24 WRATHALL, C Complete sets and the polynomial-time hierarchy Theor Comp Sct 3, i (1976), 23-33Google Scholar
- 25 YANNAKAKIS, M Unpubhshed manuscriptGoogle Scholar
Index Terms
- Equivalences Among Relational Expressions with the Union and Difference Operators
Recommendations
Equivalence among relational expressions with the union and difference operation
VLDB '78: Proceedings of the fourth international conference on Very Large Data Bases - Volume 4A generalization of tableaux as a method for representing queries in relational databases, called sets of tableaux, is proposed. Every relational expression with the operators select, project, join and union can be represented by a set of tableaux. This ...
Equivalences among Relational Expressions
Many database queries can be formulated in terms of expressions whose operands represent tables of information (relations) and whose operators are the relational operations select, project, and join. This paper studies the equivalence problem for these ...
SUOWA operators
SUOWA operators are a new family of aggregation functions that simultaneously generalize weighted means and OWA operators. Semi-uninorms, which are an extension of uninorms by dispensing with the symmetry and associativity properties, play a fundamental ...
Comments