Yannis E. Ioannidis
Raghu Ramakrishnan
- AHO, A., SAGIV, Y., AND ULLMAN, J. 1979. Equivalence among relational expressions. SIAM J. Comput. 8, 2 (May), 218-246.Google Scholar
Cross Ref
- BLAKELEY, J. A., LARSON, P. A., AND TOMPA, F. W. 1986. Efficiently updating materialized views. In Proceedings of the 1986 ACM-SIGMOD Conference on the Management of Data (Washington, D.C., May). ACM, New York, 61-71. Google ScholarDigital Library
- CHANDRA, A. K., AND MERLIN, P.M. 1977. Optimal imp}ementation of conjunctive queries in relational data bases. In Proceedings of the 9th Annual ACM Symposium on Theory of Computing (Boulder, Colo., May) ACM, New York, 77-90 Google ScholarDigital Library
- CHAUDHURI, S., AND VARDI, M. 1993. Optimization of real conjunctive queries. In Proceedings of the 12th ACM-PODS Conference (Washington, D.C., June). ACM, New York, 59-70. Google ScholarDigital Library
- CHAUDHURI, S., KRiSHNAMURTHY, R., POTAMIANOS, S., AND SHIM, K. 1995. Optimizing queries with materialized views. In Proceedings of the IEEE International Conference on Data Engineering (Taipei, Taiwan, Mar.). IEEE, New York, 190 200. Google ScholarDigital Library
- DAws, M. 1982. Computability and Unsolvabddy. Dover Publications, New York.Google Scholar
- DAYAL, U., GOODMAN, N., AND KATZ, R.H. 1982. An extended relational algebra with control over duplicate elimination. In Proceedings of the 1st ACM-PODS Conference (Los Angeles, Calif., Mar.). ACM, New York, 117-123. Google ScholarDigital Library
- GRAEFE, G. 1995. Personal communication, May.Google Scholar
- GRANT, J., AND MINKER, J. 1981. Optimization in deductive and conventional relational database systems. In Advances zn Data Base Theory, Vol. 1, J. Minker, H. Gallalre, and J. M. Nicolas, Eds., Plenum Press, New York, 195-234.Google Scholar
- IOANMDIS, Y. E., AND WONG, E. 1991. Towards and algebraic theory of recursion. J. ACM 38, 2 (Apr,), 329-381. Google ScholarDigital Library
- JOHNSON, D. S., AND KLUG, A. 1982. Testing containment of conjunctive queries under functional and inclusion dependencies. In Proceedings of the 1st ACM-PODS Conference (Los Angeles, Calif., Mar.). ACM, New York, pp. 164-169. Google ScholarDigital Library
- KING, J.J. 1981. Quist: A system for semantic query optimization in relational databases. In Proceedings of the 7th International VLDB Conference (Cannes, France, Aug ). Pp. 510-517Google Scholar
- MAHER, M. J., AND RAMAKRISHNAN, R. 1989. D~jfi vu in fixpoints of logic programs. In Proceedlngs of the ALP Symposium on Logic Programming (Cleveland, Ohio, Oct. 1), 963-980.Google Scholar
- MUMICK, I. S., PmAHESH, H., AND RAMAKmSHNAN, R. 1990. Duplicates and aggregates in deductive databases. In Proceedings of the 16th International VLDB Conl'~Jrence (Brisbane, Australia, Aug.). 264 277. Google ScholarDigital Library
- NEGRI, M., PELAGATTI, G., AND SBATTELLA, L. 1991. Formal semantics of SQL queries. ACM Trans. Database Syst. 16, 3 (Sept.), 513-534. Google ScholarDigital Library
- PARSAYE, K., AND CHIGNELL, M. 1988. Expert Systems for Experts. Wfiey, New York. Google ScholarDigital Library
- SAGIV, Y., AND YANNAKAKIS, M. 1980. Equivalences among relational expressions with the union and difference operators. J. ACM 27, 4 (Oct.), 633-655. Google ScholarDigital Library
- SELLIS, T.K. 1986. Global query optimization. In Proceedings of the 1986 ACM-SIGMOD Conference on the Management of Data (Washington, D.C., May). ACM, New York, 191-205. Google ScholarDigital Library
- SHENOY, S., AND OZSOYOGLU, Z. M. 1987. A system for semantic query optimization. In Proeeedzngs of the 1987 ACM-SIGMOD Conference on the Management of Data (San Francisco, Calif., May). ACM, New York, 181-195. Google ScholarDigital Library
- TSATALOS, O., SOLOMON, M., AND IOANNIDIS, Y. 1994. The gmap: A versatile tool for physmal data independence. In Proceedings ~f the 20th International ~%DB Conference (Santiago, Chile, Sept ), 367-378 Google ScholarDigital Library
- VAN EMD~N, M.H. 1986. Quantitative deduction and its fixpoint theory d. Logtc Program 3, 1 (Jan.), 37-53. Google ScholarDigital Library
- ZABEH, L. 1965. Fuzzy sets Inf. Control 8, 3 (June), 338-353.Google Scholar
Index Terms
- Containment of conjunctive queries: beyond relations as sets
Recommendations
The containment problem for <bi>Real</bi> conjunctive queries with inequalities
PODS '06: Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systemsQuery containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries has long been known to be NP-complete. In real database systems, however, ...
Containment and Optimization of Object-Preserving Conjunctive Queries
In the optimization of queries in an object-oriented database (OODB) system, a natural first step is to use the typing constraints imposed by the schema to transform a query into an equivalent one that logically accesses a minimal set of objects. We ...
Equivalence and minimization of conjunctive queries under combined semantics
ICDT '12: Proceedings of the 15th International Conference on Database TheoryThe problems of query containment, equivalence, and minimization are fundamental problems in the context of query processing and optimization. In their classic work [2] published in 1977, Chandra and Merlin solved the three problems for the language of ...
Comments