Sürdürülebilir Yeşil Kampüs Koleksiyonu / Sustainable Green Campus Collection
Permanent URI for this collectionhttps://hdl.handle.net/11147/7755
Browse
Search Results
Conference Object Citation - Scopus: 2Resource Allocation Algorithm for a Relational Join Operator in Grid Systems(Association for Computing Machinery (ACM), 2012) Çokuslu, Deniz; Hameurlain, Abdelkader; Erciyeş, Kayhan; Morvan, FranckGrid 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. Copyright © 2012 ACM.Conference Object Citation - Scopus: 7Orderbased Labeling Scheme for Dynamic Xml Query Processing(Springer Verlag, 2012) Assefa, Beakal Gizachew; Ergenç, BelginNeed for robust and high performance XML database systems increased due to growing XML data produced by today's applications. Like indexes in relational databases, XML labeling is the key to XML querying. Assigning unique labels to nodes of a dynamic XML tree in which the labels encode all structural relationships between the nodes is a challenging problem. Early labeling schemes designed for static XML document generate short labels; however, their performance degrades in update intensive environments due to the need for relabeling. On the other hand, dynamic labeling schemes achieve dynamicity at the cost of large label size or complexity which results in poor query performance. This paper presents OrderBased labeling scheme which is dynamic, simple and compact yet able to identify structural relationships among nodes. A set of performance tests show promising labeling, querying, update performance and optimum label size. © 2012 IFIP International Federation for Information Processing.
