메뉴 건너뛰기




Volumn 31, Issue 2, 2006, Pages 672-715

Rewriting queries with arbitrary aggregation functions using views

Author keywords

Query equivalence; Query rewriting; View usability

Indexed keywords

QUERY EQUIVALENCE; QUERY REWRITING; VIEW USABILITY;

EID: 33745247381     PISSN: 03625915     EISSN: 03625915     Source Type: Journal    
DOI: 10.1145/1138394.1138400     Document Type: Review
Times cited : (35)

References (38)
  • 1
    • 34250738653 scopus 로고    scopus 로고
    • Selecting and using views to compute aggregate queries
    • (Edinburgh, UK). Lecture Notes in Computer Science. Springer-Verlag, New York
    • AFRATI, F. AND CHIRKOVA, R. 2005. Selecting and using views to compute aggregate queries. In Proceedings of the 10th International Conference on Database Theory (Edinburgh, UK). Lecture Notes in Computer Science. Springer-Verlag, New York.
    • (2005) Proceedings of the 10th International Conference on Database Theory
    • Afrati, F.1    Chirkova, R.2
  • 2
    • 84897697590 scopus 로고    scopus 로고
    • Optimizing queries with aggregate views
    • (Avignon, France). Lecture Notes in Computer Science. Springer-Verlag, New York
    • CHAUDHURI, S. AND SHIM, K. 1996. Optimizing queries with aggregate views. In Proceedings of the 5th International Conference on Extending Database Technology (Avignon, France). Lecture Notes in Computer Science, vol. 1057. Springer-Verlag, New York, 167-182.
    • (1996) Proceedings of the 5th International Conference on Extending Database Technology , vol.1057 , pp. 167-182
    • Chaudhuri, S.1    Shim, K.2
  • 4
    • 19944389785 scopus 로고    scopus 로고
    • Ph.D. dissertation, The Hebrew University of Jerusalem, Edmond J. Safra Campus, Jerusalem 91904, Israel
    • COHEN, S. 2004. Equivalence, containment and rewriting of aggregate queries. Ph.D. dissertation, The Hebrew University of Jerusalem, Edmond J. Safra Campus, Jerusalem 91904, Israel. Available at http://iew3.technion.ac.il/~sarac.
    • (2004) Equivalence, Containment and Rewriting of Aggregate Queries
    • Cohen, S.1
  • 5
    • 19944387967 scopus 로고    scopus 로고
    • Containment of aggregate queries
    • COHEN, S. 2005. Containment of aggregate queries. SIGMOD Rec. 34, 1, 77-85.
    • (2005) SIGMOD Rec. , vol.34 , Issue.1 , pp. 77-85
    • Cohen, S.1
  • 7
    • 16644396544 scopus 로고    scopus 로고
    • Equivalences among aggregate queries with negation
    • COHEN, S., NUTT, W., AND SAGIV, Y. 2005. Equivalences among aggregate queries with negation. ACM Trans. Comput. Logic 6, 2, 328-360.
    • (2005) ACM Trans. Comput. Logic , vol.6 , Issue.2 , pp. 328-360
    • Cohen, S.1    Nutt, W.2    Sagiv, Y.3
  • 10
    • 84858897316 scopus 로고    scopus 로고
    • Algorithms for rewriting aggregate queries using views
    • Departement Computerwetenschappen, K.U. Leuven, Leuven, Belgium
    • COHEN, S., NUTT, W., AND SEREBRENIK, A. 2000b. Algorithms for rewriting aggregate queries using views. Tech. Rep. CW292, Departement Computerwetenschappen, K.U. Leuven, Leuven, Belgium. Available at http://www.cs.kuleuvan.ac.be/publicaties/rapporten/cw/CV292.abs.html.
    • (2000) Tech. Rep. , vol.CW292
    • Cohen, S.1    Nutt, W.2    Serebrenik, A.3
  • 16
    • 3242669661 scopus 로고    scopus 로고
    • On the equivalence and rewriting of aggregate queries
    • GRUMBACH, S., RAFANELLI, M., AND TINININI, L. 2004. On the equivalence and rewriting of aggregate queries. Acta Inf. 40, 8, 529-584.
    • (2004) Acta Inf. , vol.40 , Issue.8 , pp. 529-584
    • Grumbach, S.1    Rafanelli, M.2    Tininini, L.3
  • 17
    • 0038266956 scopus 로고    scopus 로고
    • On the content of materialized aggregate views
    • GRUMBACH, S. AND TINININI, L. 2003. On the content of materialized aggregate views. J. Comput. Syst. Sci. 66, 1, 133-168.
    • (2003) J. Comput. Syst. Sci. , vol.66 , Issue.1 , pp. 133-168
    • Grumbach, S.1    Tininini, L.2
  • 20
    • 0035658039 scopus 로고    scopus 로고
    • Answering queries using views: A survey
    • HALEVY, A. 2001. Answering queries using views: A survey. The VLDB J. 10, 4, 270-294.
    • (2001) The VLDB J. , vol.10 , Issue.4 , pp. 270-294
    • Halevy, A.1
  • 22
    • 0003037529 scopus 로고
    • Reducibility among combinatorial problems
    • Plenum Press, New York
    • KARP, R. 1972. Reducibility among combinatorial problems. In Complexity of Computer Computations. Plenum Press, New York.
    • (1972) Complexity of Computer Computations
    • Karp, R.1
  • 23
    • 0001086861 scopus 로고
    • Computing queries from derived relations
    • (Stockholm, Sweden), A. Pirotte and Y. Vassiliou, Eds. Morgan-Kaufmann, San Francisco, CA
    • LARSON, P.-A. AND YANG, H. 1985. Computing queries from derived relations. In Proceedings of the 11th International Conference on Very Large Data Bases (Stockholm, Sweden), A. Pirotte and Y. Vassiliou, Eds. Morgan-Kaufmann, San Francisco, CA, 259-269.
    • (1985) Proceedings of the 11th International Conference on Very Large Data Bases , pp. 259-269
    • Larson, P.-A.1    Yang, H.2
  • 26
    • 0029369642 scopus 로고
    • Data model and query evaluation in global information systems
    • LEVY, A., SRIVASTAVA, D., AND KIRK, T. 1995b. Data model and query evaluation in global information systems. J. Intell. Inf. Syst. 5, 2, 121-143.
    • (1995) J. Intell. Inf. Syst. , vol.5 , Issue.2 , pp. 121-143
    • Levy, A.1    Srivastava, D.2    Kirk, T.3
  • 27
    • 0031632472 scopus 로고    scopus 로고
    • Deciding equivalences among aggregate queries
    • (Seattle, WA), J. Paredaens, Ed. ACM, New York. Long version as Report of Esprit LTR DWQ
    • NUTT, W., SAGIV, Y., AND SHURIN, S. 1998. Deciding equivalences among aggregate queries. In Proceedings of the 17th Symposium on Principles of Database Systems (Seattle, WA), J. Paredaens, Ed. ACM, New York, 214-223. (Long version as Report of Esprit LTR DWQ, available at http://iew3.tachnion.ac.il/~sarac).
    • (1998) Proceedings of the 17th Symposium on Principles of Database Systems , pp. 214-223
    • Nutt, W.1    Sagiv, Y.2    Shurin, S.3
  • 28
    • 0035486497 scopus 로고    scopus 로고
    • MiniCon: A scalable algorithm for answering queries using views
    • POTTINGER, R. AND HALEVY, A. 2001. MiniCon: a scalable algorithm for answering queries using views. The VLDB J. 10, 2-3, 20-26.
    • (2001) The VLDB J. , vol.10 , Issue.2-3 , pp. 20-26
    • Pottinger, R.1    Halevy, A.2
  • 29
    • 0029733086 scopus 로고    scopus 로고
    • Query folding
    • (New Orleans, LA), S. Y. W. Su, Ed. IEEE Computer Society Press, Los Alamitos, CA
    • QIAN, X. 1996. Query folding. In Proceedings of the 12th International Conference on Data Engineering (New Orleans, LA), S. Y. W. Su, Ed. IEEE Computer Society Press, Los Alamitos, CA, 48-55.
    • (1996) Proceedings of the 12th International Conference on Data Engineering , pp. 48-55
    • Qian, X.1
  • 33
    • 0001535839 scopus 로고    scopus 로고
    • The GMAP: A versatile tool for physical data independence
    • TSATALOS, O., SOLOMON, M., AND IOANNIDIS, Y. 1996. The GMAP: A versatile tool for physical data independence. The VLDB J. 5, 2, 101-118.
    • (1996) The VLDB J. , vol.5 , Issue.2 , pp. 101-118
    • Tsatalos, O.1    Solomon, M.2    Ioannidis, Y.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.