A novel approach to resource scheduling for parallel query processing on computational grids

Gounaris, Anastasios; Sakellariou, Rizos; Paton, Norman W.; Fernandes, Alvaro A. A.

doi:10.1007/s10619-006-8490-2

Cited by 29 publications

(17 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Although these studies have common objectives, they provide different solutions for different types of parallelism for query processing. The studies [2,16,17,20,22] consider three types of parallelism, independent, pipelined and partitioned parallelism in allocating resources; whereas, the studies [10][11][12][13] propose resource allocation algorithms addressing only the partitioned parallelism.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Resource allocation algorithm for a relational join operator in grid systems

Çokuslu

Hameurlain

Erciyes

et al. 2012

Proceedings of the 16th International Database Engineering &Amp; Applications Sysmposium on - IDEAS '12

View full text Add to dashboard Cite

Grid systems become very popular during the last decade because of their rapidly increasing computational capabilities. On the other hand, the advances on different domains cause enormous increase in the scale of the manipulated data. This issue augments the importance of distributed query processing and causes researchers to port their underlying environment onto the grid systems. However the dynamicity, heterogeneity and large scale characteristics of grid systems pose new problems for the distributed query processing domain. Resource allocation for query processing in grid systems is one of these problems, which attracts many researchers' attention. In this paper, we propose a new resource allocation algorithm for one relational join operator in a query considering characteristics of the grid systems. We provide theoretical analyses of the proposed algorithm and we consolidate analyses with the simulations.

show abstract

Section: Related Workmentioning

confidence: 99%

“…For instance, Gounaris et al [10,12] proposed a resource scheduling method for parallel query processing in computational grids examining the partitioned parallelism problem. In their algorithm, they assumed the existence of a parallel query plan.…”

Section: Related Workmentioning

confidence: 99%

Resource allocation algorithm for a relational join operator in grid systems

Çokuslu

Hameurlain

Erciyes

et al. 2012

Proceedings of the 16th International Database Engineering &Amp; Applications Sysmposium on - IDEAS '12

View full text Add to dashboard Cite

show abstract

“…The former is the root operator of the upstream fragment, and the latter, a leaf operator of the downstream one. This approach has been successful in DQP engines for the Grid that we developed in previous work [24,25].…”

Section: Phase 2: Multi-site Optimizationmentioning

confidence: 99%

Comprehensive Optimization of Declarative Sensor Network Queries

Galpin

Brenninkmeijer

Jabeen

et al. 2009

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. We present a sensor network query processing architecture that covers all the query optimization phases that are required to map a declarative query to executable code. The architecture is founded on the view that a sensor network truly is a distributed computing infrastructure, albeit a very constrained one. As such, we address the problem of how to develop a comprehensive optimizer for an expressive declarative continuous query language over acquisitional streams as one of finding extensions to classical distributed query processing techniques that contend with the peculiarities of sensor networks as an environment for distributed computing.

show abstract

“…• Establishing whether the various costs and overheads still allow query evaluation to benefit from parallelism as it is the case with stand-alone OGSA-DQP [43].…”

Section: Complete Systemmentioning

confidence: 99%

A service-oriented system for distributed data querying and integration on Grids

Comito

Gounaris

Sakellariou

et al. 2009

Future Generation Computer Systems

Self Cite

View full text Add to dashboard Cite

a b s t r a c tData Grids rely on the coordinated sharing of and interaction across multiple autonomous database management systems. They provide transparent access to heterogeneous and autonomous data resources stored on Grid nodes. Data sharing tools for Grids must include both distributed query processing and data integration functionality. This paper presents the implementation of a data sharing system that (i) is tailored to data Grids, (ii) supports well established and widely spread relational DBMSs, and (iii) adopts a hybrid architecture by relying on a peer model for query reformulation to retrieve semantically equivalent expressions, and on a wrapper-mediator integration model for accessing and querying distributed data sources. The system builds upon the infrastructure provided by the OGSA-DQP distributed query processor and the XMAP query reformulation algorithm. The paper discusses the implementation methodology, and presents empirical evaluation results.

show abstract

A novel approach to resource scheduling for parallel query processing on computational grids

Cited by 29 publications

References 34 publications

Resource allocation algorithm for a relational join operator in grid systems

Resource allocation algorithm for a relational join operator in grid systems

Comprehensive Optimization of Declarative Sensor Network Queries

A service-oriented system for distributed data querying and integration on Grids

Contact Info

Product

Resources

About