메뉴 건너뛰기




Volumn 2736, Issue , 2003, Pages 747-759

Exploiting similarity of subqueries for complex query optimization

Author keywords

[No Author keywords available]

Indexed keywords

QUERY LANGUAGES;

EID: 35248863056     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45227-0_73     Document Type: Article
Times cited : (2)

References (12)
  • 2
    • 0031624833 scopus 로고    scopus 로고
    • An overview of query optimization in relational systems
    • Chaudhuri, S. An overview of query optimization in relational systems. In Proc. of ACM PODS, pp. 34-43, 1998.
    • (1998) Proc. of ACM PODS , pp. 34-43
    • Chaudhuri, S.1
  • 3
    • 0027608375 scopus 로고
    • Query Evaluation Techniques for Large Databases
    • Graefe, G. Query Evaluation Techniques for Large Databases. In ACM Comp. Surveys, 25(2) 111-152, 1993.
    • (1993) ACM Comp. Surveys , vol.25 , Issue.2 , pp. 111-152
    • Graefe, G.1
  • 4
    • 0021497828 scopus 로고
    • On the optimal nesting order for computing N-relational joins
    • Ibaraki, T., Kameda, T. On the optimal nesting order for computing N-relational joins. In ACM Trans. on DB Syst., 9(3) 482-502, 1984.
    • (1984) ACM Trans. on DB Syst. , vol.9 , Issue.3 , pp. 482-502
    • Ibaraki, T.1    Kameda, T.2
  • 5
    • 84976754569 scopus 로고
    • Query Optimization by Simulated Annealing
    • Ioannidis, Y. E., Wong, E. Query Optimization by Simulated Annealing. In Proc. of ACM SIGMOD, pp. 9-22, 1987.
    • (1987) Proc. of ACM SIGMOD , pp. 9-22
    • Ioannidis, Y.E.1    Wong, E.2
  • 6
    • 0021437481 scopus 로고
    • Query Optimization in Database Systems
    • Jarke, M., Koch, J. Query Optimization in Database Systems. In ACM Comp. Surveys, 16(2) 111-52, 1984.
    • (1984) ACM Comp. Surveys , vol.16 , Issue.2 , pp. 111-152
    • Jarke, M.1    Koch, J.2
  • 7
    • 0029274610 scopus 로고
    • Efficient Optimization of Large Join Queries Using Tabu Search
    • Matysiak, M. Efficient Optimization of Large Join Queries Using Tabu Search. In Infor. Sci., v83, n1-2, 1995.
    • (1995) Infor. Sci. , vol.83 , Issue.1-2
    • Matysiak, M.1
  • 8
    • 85051567368 scopus 로고
    • Access Path Selection in a Relational Database Management System
    • Selinger P. G., et al. Access Path Selection in a Relational Database Management System. In Proc. of ACM SIGMOD, pp. 23-34, 1979.
    • (1979) Proc. of ACM SIGMOD , pp. 23-34
    • Selinger, P.G.1
  • 9
    • 0027228912 scopus 로고
    • A polynomial time algorithm for optimizing join queries
    • Swami, A., Iyer, B. R. A polynomial time algorithm for optimizing join queries. In Proc. of IEEE ICDE, pp. 345-54, 1993.
    • (1993) Proc. of IEEE ICDE , pp. 345-354
    • Swami, A.1    Iyer, B.R.2
  • 10
    • 84944051300 scopus 로고
    • Optimization of Large Join Queries
    • Swami, A., Gupta, A. Optimization of Large Join Queries. In Proc. of ACM SIGMOD, pp. 8-17, 1988.
    • (1988) Proc. of ACM SIGMOD , pp. 8-17
    • Swami, A.1    Gupta, A.2
  • 11
    • 24944490241 scopus 로고    scopus 로고
    • Exploiting Common Subqueries for Complex Query Optimization
    • Tao, Y., Zhu, Q., Zuzarte, C. Exploiting Common Subqueries for Complex Query Optimization. In Proc. of GASCON, pp. 21-34, 2002.
    • (2002) Proc. of GASCON , pp. 21-34
    • Tao, Y.1    Zhu, Q.2    Zuzarte, C.3


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