Werner Nutt
- ASU79.A.V. Aho, Y. Sagiv, and J.D. Ullman. Efficient optimization of a class of relational expressions, A CM Transactions on Database Systems, 4(4):435-454, 1979. Google Scholar
Digital Library
- CKPS95.S, Chaudhuri, S. Krishnamurthy, S. Potarnianos, and K. Shim. Optimizing queries with materialized views. In P.S.Yu and A.L.P. Chen, editors, Proe, 11th International Conference on Data Engineering, Taipei, March 1995. IEEE Computer Society, Google ScholarDigital Library
- CM77.A.K. Chandra and P.M. Merlin. Optimal implementation of conjunctive queries in relational databases. In Proc. 9th Annual A CM Symposium on Theory of Computing, 1977. Google ScholarDigital Library
- CV93.S. Chaudhuri and M. Verdi. Optimization of real conjunctive queries. In Proe. 12th Symposium on Principles of Database Systems, Washington (D.C., USA), May 1993. ACM Press. Google ScholarDigital Library
- DJLS96.Sh. Dar, H.V. Jagadish, A.Y. Levy, and D. Srivastava. Answering queries with aggregation using views. In Prve. 22nd International Oonlerence on Very Large Data Bases, Bombay (India), September 1996. Morgan Kaufmann Publishers. Google ScholarDigital Library
- GHQ95.A. Gupta, V. Harinarayan, and D. Quass. Aggregate query processing in data warehouses. In Proc. 21st International Oonferenee on Very Large Data Bases. Morgan Kaufmann Publishera, August 1995. Google ScholarDigital Library
- IR95.Y.E. Ioannidis and R. Ramakrishnan. Beyond rdations as sets. A CM ~ansaetions on Database Systems, 20(3):288-324, 1995. Google ScholarDigital Library
- JK83.D.S. Johnson and A. Klug. Optimizing conjunctive queries that contain untyped variables. SIAM Journal on Computing, 12(4):616-640, 1983.Google ScholarDigital Library
- LMSS93.A.Y. Levy, I. Singh Mumick, Y. Sagiv, and O. Shmueli. Equivalence, query-reachability, and satisfiability in datalog extensions. In Proc. 12th Symposium on Principles of Database Systems, pages 109--192, Washington (D.C., USA), May 1993. ACM Press. Google ScholarDigital Library
- LS95.A.Y. Levy and Y. Sagiv. Semantic query optimization in datalog programs, in Proc. 1~th Symposium on Principles of Database Systems, pages 163-173, San Jose (California, USA), Proc. 14th Symposium on Principles of Database Systems 1995. ACM Press. Google ScholarDigital Library
- RSSS98.K.A. Ross, D. Srivastava, P.J. Stuekey, and S. Sudarshan. Foundations of aggregation constraints. Theoretical Computer Science, 190, 1998. (to appear). Google ScholarDigital Library
- SS92.Y. Sagiv and Y. Saraiya. Minimizing restrictedfanout queries. Discrete Applied Mathematics, 40:245-264, 1992. Google ScholarDigital Library
- SY81.Y. Sagiv and M. Yannakakis. Equivalence among relational expressions with the union and difference operators. J. A OM, 27(4):633-655, 1981. Google ScholarDigital Library
- vdM92.tL van der Meyden. The complxity of querying indefinite data about linearly ordered domains. In Proc. 11th Symposium on Principles of Database Systems, pages 331-345, San Diego (California, USA), May 1992. ACM Press. Google ScholarDigital Library
Index Terms
- Deciding equivalences among aggregate queries
Recommendations
Deciding equivalences among conjunctive aggregate queries
Equivalence of aggregate queries is investigated for the class of conjunctive queries with comparisons and the aggregate operators count, count-distinct, min, max, and sum. Essentially, this class contains unnested SQL queries with the above aggregate ...
Equivalences among aggregate queries with negation
Query equivalence is investigated for disjunctive aggregate queries with negated subgoals, constants and comparisons. A full characterization of equivalence is given for the aggregation functions count, max, sum, prod, top2 and parity. A related problem ...
On Deciding Readiness and Failure Equivalences for Processes
In this paper, we study the complexity of deciding readiness and failure equivalences for finite state processes and recursively defined processes specified by normed context-free grammars (CFGs) in Greibach normal form (GNF). The results are as follows:...
Comments