Tối ưu hóa truy vấn trong hệ cơ sở dữ liệu phân tán

Tài liệu tham khảo

Loại

Chi tiết

[21]. Farnoush Banaei-Kashani (April 2008), “Distributed Databases”, excerpt from “Principles of Distributed Database Systems” by M. Tamer ệzsu and Patrick Valduriez

Sách, tạp chí

Tiêu đề:	Distributed Databases”, excerpt from “Principles of Distributed Database Systems

[13]. C.S.Mullins (2003), Tuning DB2 SQL access paths. IBM, from:< http://www.ibm.com/developerworks/data/library/techarticle/0301mullins/0301mullins.html&gt

Link

[22]. Magda Balazinska - CSE 444 (Spring 2013), Lecture 10 Query Optimization (part 1), from:< https://courses.cs.washington.edu/courses/cse444/13sp/&gt

Link

[1]. TS.Nguyễn Đình Thuân (2013), Bài giảng Distributed Database, Chương 4,5,7, Trường Đại học Công nghệ Thông tin ĐHQG-HCM

Khác

[2]. Robert Taylor (2010), Query Optimization for Distributed Database Systems, Master Thesis, University of Oxford

Khác

[3]. G. Ramakrishnan (2003), Database Management Systems, Third Edition, McGrawHill

Khác

[4]. D. Kossmann (2000), The state of the art in distributed query processing, pages 422–469, ACM Computing Surveys

Khác

[5]. M. Steinbrunn, G. Moerkotte, and A. Kemper (1997). Heuristic and randomized optimization for the join ordering problem, pages 191–208, VLDB Journal

Khác

[6]. Y. E. Ioannidis (1996), Query optimization, pages 103–114, ACM Computing Surveys

Khác

[7]. L. Angrave (2009), Completing Physical Query Plan Finale, from: <http://www.cs.uiuc.edu/class/fa06/cs411/slides/&gt

Khác

[8]. Graham - Knuth – Patashnik (1990), Concrete Mathematics, Addison Wesley Publishing Company

Khác

[9]. Benjamin Nevarez (2010), Optimizing Join Orders, from: <http://www.benjaminnevarez.com/2010/06/optimizing-join-orders/&gt

Khác

[10]. D. Kossmann and K. Stocker (2000), Iterative dynamic programming: A new class of query optimization algorithms. ACM Transactions on Database Systems

Khác

[11]. A. Swami (1989), Optimization of large join queries: Combining heuristics andcombinatorial techniques, pages 367–376, ACM SIGMOD Conference on Management of Data, Portland

Khác

[12]. K. W. R. James F. Kurose (2009), Computer Networking: A Top-Down Approach Featuring the Internet. Addison Wesley

Khác

[14]. K. Ono and G. M. Lohman (1990), Measuring the complexity of join enumeration in query optimization. IRM Almaden Research Center

Khác

[15]. B. Vance and D. Maier (1996), Rapid bushy join-order optimization with cartesian products, pages 35–46, Proc. of the ACM SIGMOD Conf. on Management of Data

Khác

[16]. S. Ganguly, W. Hasan, and R. Krishnamurthy (1992), Query optimization for parallel execution, pages 9–18, SIGMOD Conference

Khác

[17]. P. G. Selinger, M. M. Astrahan, D. D. Chamberlin, I. A. Lorie, and T. G. Price (1979), Access path selection in a relational database management system.ACM SIGMOD International Conference on Management of Data

Khác

[18]. G. M. Thomas Neumann (2006), Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees without cross products, pages 930–941, VLDB Endowment

Khác

Tiêu đề	Tối Ưu Hóa Truy Vấn Trong Hệ Cơ Sở Dữ Liệu Phân Tán
Tác giả	Nguyễn Trần Bảo Long
Người hướng dẫn	TS. Nguyễn Đình Thuân
Trường học	Trường Đại Học Công Nghệ TP. HCM
Chuyên ngành	Công Nghệ Thông Tin
Thể loại	Luận Văn Thạc Sĩ
Năm xuất bản	2015
Thành phố	TP. HỒ CHÍ MINH

Định dạng
Số trang	75
Dung lượng	1,49 MB