کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4955972 | 1444376 | 2017 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A green framework for DBMS based on energy-aware query optimization and energy-efficient query processing
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Traditional database systems result in high energy consumption and low energy efficiency due to the lack of consideration of energy issues and environmental adaptation in the design process. In this study, we report our recent efforts on this issue, with a focus on energy-aware query optimization and energy-efficient query processing. Firstly, a method of modeling energy cost of query plans during query processing based on their resource consumption patterns is proposed, which helps predict energy cost of queries before execution. Secondly, as the traditional query optimizer focuses on solely optimizing for performance and ignores energy-efficient query plans, a query-plan evaluation model is proposed after a comprehensive study of plan evaluation principles. Using the cost model as a basis, the evaluation model can utilizes the trade-offs between power and performance of plans, and helps the query optimizer select plans that meet performance requirements but result in lower energy cost. Finally, a green database framework integrated with the two above models is proposed to enhance a commercial DBMS. Experimental results reveal that, with reliable and accurate statistical data, the proposed framework in this study can achieve significant energy savings and improve energy efficiency.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Network and Computer Applications - Volume 84, 15 April 2017, Pages 118-130
Journal: Journal of Network and Computer Applications - Volume 84, 15 April 2017, Pages 118-130
نویسندگان
Binglei Guo, Jiong Yu, Bin Liao, Dexian Yang, Liang Lu,