David Maier
- 1 AHO, A V., BEERI, C, AND ULLMAN, J.D The theory of joins in relational databases ACM Trans Database Syst. 4, 3 (Sept 1979), 297-314. Google Scholar
- 2 AHO, A V, SAGIV, Y, AND ULLMAN, J D Eqmvalences among relational expressaons SlAM J Comput 8, 2 (May 1979), 218-246Google Scholar
- 3 ARMSTRONG, W W Dependency structures of database relauonshaps Proc IFIP 74, North Halland, Amsterdam, 1974, pp. 580-583Google Scholar
- 4 BEERI, RI, C On the membership problem for functional and multivalued dependencies in relational databases. ACM Trans Database Syst 5, 3 (Sept 1980), 241-259 Google Scholar
- 5 BEERI, C, AND BERNSTEIN, P A Computational problems related to the design of normal form relational schemas A CM Trans. Database Syst 4, 1 (March 1979), 30--59. Google Scholar
- 6 BEERI, C, FAGIN, R, AND HOWARD, J H A complete axlomaUzat~on for functional and multivalued dependencies in database relauons Proc ACM-SIGMOD Int Conf on Management of Data, Toronto, Aug 1977, pp 47-61 Google Scholar
- 7 BEERI, C, AND VARDI, M Y On the properues of joan dependenoes. In Advances m Data Base Theory, Vol 1, H Gallmre, J Mlnker, and J.M. Nicolas, Eds, Plenum Press, New York, 1981, pp 25-71.Google Scholar
- 7a BEERI, C., AND VARDI, M Y On the complexaty of testing lmphcauons of data dependenoes Res Rep, Dep. of Computer Science, The Hebrew Umv. of Jerusalem, Jerusalem, Israel, Dec 1980.Google Scholar
- 8 CODD, E.F. A relational model for large shared data banks. Commun ACM 13, 6 (June 1970), 377-387. Google Scholar
- 9 COOK, S A The complexity of theorem proving procedures Proc 3rd Ann ACM Symp on Theory of Computmg, Shaker Heights, Ohao, May 1971, pp 151-158 Google Scholar
- 10 FAGIN, R Multlvalued dependencaes and a new normal form for relational databases A CM Trans Database Syst 2, 3 (Sept. 1977), 262-278 Google Scholar
- 11 GALIL, Z An almost hnear time algorithm for computing the dependency bas~s m a relauonal database J A CM (to appear) Google Scholar
- 12 GAREY, M.R., AND JOHNSON, D S Computers and lntractabthty. A Crutde to the Theory of NP- Completeness. Freeman, San Franosco, 1979 Google Scholar
- 13 HAGIHARA, K, ITO, M, TANIGUCHI, K, AND KASAMI, T Decision problems for multlvalued dependencies m relational databases SlAM ~ Comput. 8, 2 (May 1979), 247-264.Google Scholar
- 14 HONEYMAN, P., LADNER, R.E., AND YANNAKAKIS, M Testing the umversal instance assumption. Inf. Proc Lett 10, 1 (Feb 1980), 14-19.Google Scholar
- 15 KARP, R M Reduobdity among combinatorial problems In Complemty of Computer Computations, R E Mdler and J W Thatcher, Eds, Plenum Press, New York, 1972, pp 85-104.Google Scholar
- 16 MAIER, D, MENDELZON, A O, AND SAGIV, Y Testing implicataons of data dependencms A CM Trans Database Syst 4, 4 (Dec 1979), 455--469. Google Scholar
- 17 RISSANEN, J Theory of relations for databases--a tutorial survey Proc 7th Symp on Mathematical Foundattons of Computer Science, Lecture Notes m Computer Soence 64, Sprmger-Verlag, Berlin, Headelberg, 1978, pp. 536-551Google Scholar
- 18 SAGIV, Y. An algorithm for mfemng multwalued dependencies with an application to propositional logic. J. ACM 27, 2 (April 1980), 250-262 Google Scholar
- 19 SAGIV, Y., DFJ.OBEL, C., PARKER, D.S, AND FAGIN, R. An equivalence between relational database dependencies and a subclass of propositional logic. J ACM 28, 3 (July 1981), 435-453. Google Scholar
- 20 VARDI, M.Y Inferrmg multlvalued dependencies from functional and join dependencies. Res. Rep., Dep. of Applied Mathematics, Wemmann Institute of Science, Rehovot, Israel, March 1980.Google Scholar
- 21 ZANIOLO, C. Analysis and destgn of relational schemata for database systems. Tech. Rep. UCLA- ENG-7669, Dep. of Computer Science, Umversity of Califonua, Los Angeles, Calif., July 1976.Google Scholar
Index Terms
- On the Complexity of Testing Implications of Functional and Join Dependencies
Recommendations
Testing implications of data dependencies
Presented is a computation method—the chase—for testing implication of data dependencies by a set of data dependencies. The chase operates on tableaux similar to those of Aho, Sagiv, and Ullman. The chase includes previous tableau computation methods as ...
Testing containment of conjunctive queries under functional and inclusion dependencies
PODS '82: Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systemsWe consider the problem of optimizing conjunctive queries in the presence of inclusion and functional dependencies. We show that the problem of containment (and hence those of equivalence and non-minimality) is in NP when either (a) there are no ...
A polynomial time algorithm for testing implications of a join dependency and embodied functional dependencies
SIGMOD '88: Proceedings of the 1988 ACM SIGMOD international conference on Management of dataThe problem of deciding whether a full join dependency (JD) ⋈ [R] and a set of functional dependencies (FDs) F imply an embedded join dependency (EJD) ⋈ [S] is known to be NP-complete. We show that the problem can be decided in polynomial time if S ⊆ R ...
Comments