메뉴 건너뛰기




Volumn 20, Issue 2, 2009, Pages 187-220

Exploiting maximal redundancy to optimize SQL queries

Author keywords

Intra query redundancy; Nested queries; Query optimization

Indexed keywords

INFORMATION SYSTEMS;

EID: 68349131921     PISSN: 02191377     EISSN: 02193116     Source Type: Journal    
DOI: 10.1007/s10115-008-0156-0     Document Type: Article
Times cited : (4)

References (30)
  • 5
    • 0002275623 scopus 로고
    • Of nests and trees: A unified approach to processing queries that contain nested subqueries, aggregates, and quantifiers
    • Dayal U (1987) Of nests and trees: A unified approach to processing queries that contain nested subqueries, aggregates, and quantifiers. In: Proceedings of the VLDB Conference, pp 197-208
    • (1987) Proceedings of the VLDB Conference , pp. 197-208
    • Dayal, U.1
  • 8
    • 0030157122 scopus 로고    scopus 로고
    • Sql query optimization: Reordering for a general class of queries
    • Goel P, Iyer B (1996) Sql query optimization: Reordering for a general class of queries. In: Proceedings of the SIGMOD Conference, pp 47-56
    • (1996) Proceedings of the SIGMOD Conference , pp. 47-56
    • Goel, P.1    Iyer, B.2
  • 9
    • 0040746926 scopus 로고    scopus 로고
    • Optimizing queries using materialized views: A practical, scalable solution
    • Goldstein J, Larson P-A (2001) Optimizing queries using materialized views: A practical, scalable solution. In: Proceedings of the SIGMOD Conference, pp 331-342
    • (2001) Proceedings of the SIGMOD Conference , pp. 331-342
    • Goldstein, J.1    Larson, P.-A.2
  • 11
    • 0035658039 scopus 로고    scopus 로고
    • Answering queries using views: A survey
    • Halevy A (2001) Answering queries using views: A survey. VLDB J 10(4): 270-294
    • (2001) VLDB J , vol.10 , Issue.4 , pp. 270-294
    • Halevy, A.1
  • 12
    • 0032083881 scopus 로고    scopus 로고
    • Optimization techniques for queries with expensive methods
    • Hellerstein J (1998) Optimization techniques for queries with expensive methods. ACM Trans Database Syst 23(2): 113-157
    • (1998) ACM Trans Database Syst , vol.23 , Issue.2 , pp. 113-157
    • Hellerstein, J.1
  • 13
    • 0020182801 scopus 로고
    • On optimizing an sql-like nested query
    • Kim W (1982) On optimizing an sql-like nested query. ACM Trans Database Syst 7(3): 443-469
    • (1982) ACM Trans Database Syst , vol.7 , Issue.3 , pp. 443-469
    • Kim, W.1
  • 14
    • 0000500922 scopus 로고    scopus 로고
    • The state of the art in distributed query processing
    • Kossmann D (2000) The state of the art in distributed query processing. ACM Comput Surv 32(4): 422-469
    • (2000) ACM Comput Surv , vol.32 , Issue.4 , pp. 422-469
    • Kossmann, D.1
  • 15
    • 28044431810 scopus 로고    scopus 로고
    • Web data extraction based on structural similarity
    • Li Z, Ng WK, Sun A (2005) Web data extraction based on structural similarity. Knowl Inf Syst 8(4): 438-461
    • (2005) Knowl Inf Syst , vol.8 , Issue.4 , pp. 438-461
    • Li, Z.1    Ng, W.K.2    Sun, A.3
  • 17
    • 0038266970 scopus 로고    scopus 로고
    • Query containment for data integration systems
    • Millstein T, Halevy A, Friedman M (2003) Query containment for data integration systems. J Comp Syst Sci 66(1): 10-39
    • (2003) J Comp Syst Sci , vol.66 , Issue.1 , pp. 10-39
    • Millstein, T.1    Halevy, A.2    Friedman, M.3
  • 18
    • 0024719831 scopus 로고
    • Optimization and dataflow algorithms for nested tree queries
    • Muralikrishna M (1989) Optimization and dataflow algorithms for nested tree queries. In: Proceedings of the VLDB conference, pp 77-85
    • (1989) Proceedings of the VLDB Conference , pp. 77-85
    • Muralikrishna, M.1
  • 19
    • 0002448463 scopus 로고
    • Improved unnesting algorithms for join aggregate sql queries
    • Muralikrishna M (1992) Improved unnesting algorithms for join aggregate sql queries. In: Proceedings of the VLDB conference, pp 91-102
    • (1992) Proceedings of the VLDB Conference , pp. 91-102
    • Muralikrishna, M.1
  • 20
    • 0023843463 scopus 로고
    • Using common subexpressions to optimize multiple queries
    • Park J, Segev A (1988) Using common subexpressions to optimize multiple queries. In: Proceedings of the ICDE Conference, pp 311-319
    • (1988) Proceedings of the ICDE Conference , pp. 311-319
    • Park, J.1    Segev, A.2
  • 21
    • 0032094512 scopus 로고    scopus 로고
    • Reusing invariants: A new strategy for correlated queries
    • Rao J, Ross KA (1998) Reusing invariants: A new strategy for correlated queries. In: Proceedings of the SIGMOD conference, pp 37-48
    • (1998) Proceedings of the SIGMOD Conference , pp. 37-48
    • Rao, J.1    Ross, K.A.2
  • 23
    • 0023977778 scopus 로고
    • Multiple-query optimization
    • Sellis TK (1988) Multiple-query optimization. ACM Trans Database Syst 13(1): 23-52
    • (1988) ACM Trans Database Syst , vol.13 , Issue.1 , pp. 23-52
    • Sellis, T.K.1
  • 25
    • 0003666350 scopus 로고    scopus 로고
    • Information integration using logical views
    • Ullman J (2000) Information integration using logical views. Theor Comp Sci 239(2): 189-210
    • (2000) Theor Comp Sci , vol.239 , Issue.2 , pp. 189-210
    • Ullman, J.1
  • 26
    • 41549108964 scopus 로고    scopus 로고
    • Beyond topical similarity: A structural similarity measure for retrieving highly similar documents
    • Wan X (2008) Beyond topical similarity: A structural similarity measure for retrieving highly similar documents. Knowl Inf Syst 15(1): 55-73
    • (2008) Knowl Inf Syst , vol.15 , Issue.1 , pp. 55-73
    • Wan, X.1
  • 29
    • 24944557294 scopus 로고    scopus 로고
    • Optimizing complex queries based on similarities of subqueries
    • Zhu Q, Tao Y, Zuzarte C (2005) Optimizing complex queries based on similarities of subqueries. Knowl Inf Syst 8(3): 350-373
    • (2005) Knowl Inf Syst , vol.8 , Issue.3 , pp. 350-373
    • Zhu, Q.1    Tao, Y.2    Zuzarte, C.3


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