메뉴 건너뛰기




Volumn 29, Issue 2, 2000, Pages 499-509

Counting, enumerating, and sampling of execution plans in a cost-based query optimizer

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0039253730     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/335191.335451     Document Type: Article
Times cited : (21)

References (11)
  • 3
    • 0001890225 scopus 로고
    • The cascades framework for query optimization
    • September
    • G. Graefe. The Cascades Framework for Query Optimization. IEEE Data Engineering Bulletin, 18(3):19-29, September 1995.
    • (1995) IEEE Data Engineering Bulletin , vol.18 , Issue.3 , pp. 19-29
    • Graefe, G.1
  • 5
    • 0027221223 scopus 로고
    • The volcano optimizer generator: Extensibility and efficient search
    • Vienna, Austria, April
    • G. Graefe and W. J. McKenna. The Volcano Optimizer Generator: Extensibility and Efficient Search. In Proc. of the IEEE Int'l. Conf. on Data Engineering, pages 209-218, Vienna, Austria, April 1993.
    • (1993) Proc. of the IEEE Int'l. Conf. on Data Engineering , pp. 209-218
    • Graefe, G.1    McKenna, W.J.2
  • 6
    • 84976665903 scopus 로고
    • Left-deep vs. Bushy trees: An analysis of strategy spaces and its implications for query optimization
    • Denver, CO, USA, May
    • Y. E. Ioannidis and Y. C. Kang. Left-Deep vs. Bushy Trees: An Analysis of Strategy Spaces and its Implications for Query Optimization. In Proc. of the ACM SIGMOD Int'l. Conf. on Management of Data, pages 168-177, Denver, CO, USA, May 1991.
    • (1991) Proc. of the ACM SIGMOD Int'l. Conf. on Management of Data , pp. 168-177
    • Ioannidis, Y.E.1    Kang, Y.C.2
  • 8
    • 0002704090 scopus 로고
    • Measuring the complexity of join enumaration in query optimization
    • Brisbane, Australia, August
    • K. Ono and G. M. Lohman. Measuring the Complexity of Join Enumaration in Query Optimization. In Proc. of the Int'l. Conf. on Very Large Data Bases, pages 314-325, Brisbane, Australia, August 1990.
    • (1990) Proc. of the Int'l. Conf. on Very Large Data Bases , pp. 314-325
    • Ono, K.1    Lohman, G.M.2
  • 10
    • 0008942026 scopus 로고
    • Generating binary tree lexicographically
    • December
    • R. Ruskey and T. C. Hu. Generating Binary Tree Lexicographically. SIAM Journal of Computation, 6(4):745-758, December 1977.
    • (1977) SIAM Journal of Computation , vol.6 , Issue.4 , pp. 745-758
    • Ruskey, R.1    Hu, T.C.2
  • 11
    • 0002540707 scopus 로고    scopus 로고
    • Massive stochastic testing of SQL
    • New York, NY, USA, September
    • D. Slutz. Massive Stochastic Testing of SQL. In Proc. of the Int'l. Conf. on Very Large Data Bases, pages 618-622, New York, NY, USA, September 1998.
    • (1998) Proc. of the Int'l. Conf. on Very Large Data Bases , pp. 618-622
    • Slutz, D.1


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