A high-performance scheduler for join queries execution over grid

被引:0
作者
机构
[1] Department of Informatics Engineering, Technological Institute of Crete
[2] Foundation for Research and Technology - Hellas (FORTH), Institute of Computer Science, GR-700 13 Heraklion, Crete
来源
| 1600年 / Acta Press卷 / 33期
关键词
Distributed architectures; Grid resource allocation; Join queries; Query plan;
D O I
10.2316/Journal.205.2013.4.205-5614
中图分类号
学科分类号
摘要
A Grid is a collection of computing resources that share and perform tasks. Performance optimization can be achieved by exploiting the Grid power utilities, i.e., multi-processing, multi-programming and abstract task execution. This paper explores the management of distributed relational databases over Grid infrastructures for the execution of join queries. Our goal is to present an efficient resource allocation model concerning both computation and communication cost to be used for highly performing dynamic scheduling. We propose the Query Plan Graph Constructor algorithm for the query plan graph construction and the Heuristic Query Path Selection (HQuPaS) algorithm for the query plan selection. In addition, we present refined heuristic query path selection, a refined algorithm based on HQuPaS that reduces the number of states the algorithm has to visit. Finally, we present some experimental results from a scheduling simulator we implemented to evaluate these algorithms.
引用
收藏
页码:203 / 211
页数:8
相关论文
共 8 条
[1]  
Foster I., Kesselman C., The Grid: Blueprint for A New Computing Infrastructure, 2nd Ed., (2003)
[2]  
Elmasri R., Navathe S.B., Fundamentals of Database Systems, 2nd Ed., (1994)
[3]  
Foster I., Kesselman C., The Globus project: A status report, Proc. Heterogeneous Computing Workshop, IEEE Press, pp. 4-18, (1998)
[4]  
Misargopoulos A., A Framework for High Performance Relational Join Queries Scheduling in Distributed Database Systems over Grid Architectures, (2005)
[5]  
Jang M., Chang J.-W., A grid-based approximate K-NN query processing algorithm for privacy protection in locationbased services, Grid and Pervasive Computing, pp. 526-535, (2013)
[6]  
Mishra P., Eich M.H., Join processing in relational databases, ACM Computing Surveys (CSUR), 24, 1, pp. 63-113, (1992)
[7]  
Schneider D., Dewitt D.J., A performance evaluation of four parallel join algorithms in a shared-nothing multiprocessor environment, Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 110-121, (1989)
[8]  
Cormen T.H., Leiserson C.E., Rivest R.L., Stein C., Introduction to Algorithms, 2nd Ed., (2001)