Computer Engineering / Bilgisayar Mühendisliği
Permanent URI for this collectionhttps://hdl.handle.net/11147/10
Browse
9 results
Search Results
Article Citation - WoS: 15Citation - Scopus: 18Achieving Query Performance in the Cloud Via a Cost-Effective Data Replication Strategy(Springer, 2021) Tos, Uras; Mokadem, Riad; Hameurlain, Abdelkader; Ayav, TolgaMeeting performance expectations of tenants without sacrificing economic benefit is a tough challenge for cloud providers. We propose a data replication strategy to simultaneously satisfy both the performance and provider profit. Response time of database queries is estimated with the consideration of parallel execution. If the estimated response time is not acceptable, bottlenecks are identified in the query plan. Data replication is realized to resolve the bottlenecks. Data placement is heuristically performed in a way to satisfy query response times at a minimal cost for the provider. We demonstrate the validity of our strategy in a performance evaluation study.Article Citation - WoS: 10Citation - Scopus: 26Mobile Join Operators for Restricted Sources(Hindawi Publishing Corporation, 2005) Özakar, Belgin; Morvan, Franck; Hameurlain, AbdelkaderWe consider the problem of query execution when there is limited access to the relations, i.e. when binding patterns require values to be specified in order to get data from the relation. This problem is common in virtual data integration systems where there are heterogeneous sources with various restricted access patterns and query capabilities. Another problem is the lack of the statistical information about the sources and occurrence of unpredictable events. We introduce two mobile join operators, MDJoin and SMDJoin which are designed for restricted sources and implemented using ‘mobile agents’ in order to benefit from their autonomous and reactive characteristics. Mobile operators of restricted sources are capable to deal with restricted sources and react to the variations between the compile-time estimations and run-time computations of data during query execution. The difference between the two new query operators lies in their level of adaptation ability to the execution environment. Performance results show that mobile agent-based approach at operator level can lead to a significant reduction in response time with restricted sources.Article Citation - WoS: 1Citation - Scopus: 1Extended Adaptive Join Operator With Bind-Bloom Join for Federated Sparql Queries(IGI Global Publishing, 2017) Oğuz, Damla; Yin, Shaoyi; Ergenç, Belgin; Hameurlain, Abdelkader; Dikenelli, OğuzThe goal of query optimization in query federation over linked data is to minimize the response time and the completion time. Communication time has the highest impact on them both. Static query optimization can end up with inefficient execution plans due to unpredictable data arrival rates and missing statistics. This study is an extension of adaptive join operator which always begins with symmetric hash join to minimize the response time, and can change the join method to bind join to minimize the completion time. The authors extend adaptive join operator with bind-bloom join to further reduce the communication time and, consequently, to minimize the completion time. They compare the new operator with symmetric hash join, bind join, bind-bloom join, and adaptive join operator with respect to the response time and the completion time. Performance evaluation shows that the extended operator provides optimal response time and further reduces the completion time. Moreover, it has the adaptation ability to different data arrival rates.Article Citation - WoS: 26Citation - Scopus: 30Ensuring Performance and Provider Profit Through Data Replication in Cloud Systems(Springer Verlag, 2017) Tos, Uras; Mokadem, Riad; Hameurlain, Abdelkader; Ayav, Tolga; Bora, ŞebnemCloud computing is a relatively recent computing paradigm that is often the answer for dealing with large amounts of data. Tenants expect the cloud providers to keep supplying an agreed upon quality of service, while cloud providers aim to increase profits as it is a key ingredient of any economic enterprise. In this paper, we propose a data replication strategy for cloud systems that satisfies the response time objective for executing queries while simultaneously enables the provider to return a profit from each execution. The proposed strategy estimates the response time of the queries and performs data replication in a way that the execution of any particular query is still estimated to be profitable for the provider. We show with simulations that how the proposed strategy fulfills these two criteria.Conference Object Citation - WoS: 17Citation - Scopus: 30A Performance and Profit Oriented Data Replication Strategy for Cloud Systems(Institute of Electrical and Electronics Engineers Inc., 2017) Tos, Uras; Mokadem, Riad; Hameurlain, Abdelkader; Ayav, Tolga; Bora, ŞebnemIn today's world, tenants of cloud systems expect timely responses to queries that process ever-increasing sizes of data. However, most cloud providers offer their services without any performance guarantees to their tenants. In this paper we propose a data replication strategy that aims to satisfy performance guarantees for the tenant while ensuring profitability of the cloud provider. Our strategy estimates the response time of the queries, as well as the expenditures that affect the profitability of the cloud provider. The decision of whether to perform replication is determined by the fulfillment of these two criteria. Validity of the proposed strategy is provided by means of a simulation study.Article Citation - WoS: 17Citation - Scopus: 26Federated Query Processing on Linked Data: a Qualitative Survey and Open Challenges(Cambridge University Press, 2015) Oğuz, Damla; Ergenç, Belgin; Yin, Shaoyi; Dikenelli, Oğuz; Hameurlain, AbdelkaderA large number of data providers publish and connect their structured data on the Web as linked data. Thus, the Web of data becomes a global data space. In this paper, we initially give an overview of query processing approaches used in this interlinked and distributed environment, and then focus on federated query processing on linked data. We provide a detailed and clear insight on data source selection, join methods and query optimization methods of existing query federation engines. Furthermore, we present a qualitative comparison of these engines and give a complementary comparison of the measured metrics of each engine with the idea of pointing out the major strengths of each one. Finally, we discuss the major challenges of federated query processing on linked data. © 2015 Cambridge University Press.Article Citation - WoS: 1Citation - Scopus: 7Resource Allocation for Query Processing in Grid Systems: a Survey(CRL Publishing, 2012) Çokuslu, Deniz; Hameurlain, Abdelkader; Erciyeş, KayhanGrid systems are very useful platforms for distributed databases, especially in some situations in which the scale of data sources and user requests is very high. However, the main characteristics of grid systems such as dynamicity, large size and heterogeneity, bring new problems to the query processing domain such as resource discovery and resource allocation. In this paper, we provide a survey related to resource allocation methods for query processing In data grid systems. We provide a classification for existing studies considering their approaches to the resource allocation problem. We provide a synthesis of the studies and propose evaluations and comparisons for the different classes of studies. ©2012 CRL Publishing Ltd.Article Citation - WoS: 24Citation - Scopus: 31Dynamic Replication Strategies in Data Grid Systems: A Survey(Springer Verlag, 2015) Tos, Uras; Mokadem, Riad; Hameurlain, Abdelkader; Ayav, Tolga; Bora, ŞebnemIn data grid systems, data replication aims to increase availability, fault tolerance, load balancing and scalability while reducing bandwidth consumption, and job execution time. Several classification schemes for data replication were proposed in the literature, (i) static vs. dynamic, (ii) centralized vs. decentralized, (iii) push vs. pull, and (iv) objective function based. Dynamic data replication is a form of data replication that is performed with respect to the changing conditions of the grid environment. In this paper, we present a survey of recent dynamic data replication strategies. We study and classify these strategies by taking the target data grid architecture as the sole classifier. We discuss the key points of the studied strategies and provide feature comparison of them according to important metrics. Furthermore, the impact of data grid architecture on dynamic replication performance is investigated in a simulation study. Finally, some important issues and open research problems in the area are pointed out.Conference Object Citation - WoS: 4Citation - Scopus: 6Robust Placement of Mobile Relational Operators for Large Scale Distributed Query Optimization(Institute of Electrical and Electronics Engineers Inc., 2007) Ergenç, Belgin; Morvan, Franck; Hameurlain, AbdelkaderThis paper presents a compile-time placement method of mobile relational operators MROs in a large scale environment. MROs are self adaptive to changing runtime conditions by deciding their execution place if they discover compile-time estimation errors. Proposed placement methods tend to have a main drawback with MROs running over a large scale environment: their focus is on finding optimal performance depending on single-point estimation at compile-time, instead of optimal performance over an estimation interval. We propose: (i) to determine the migration space of a MRO including the sites on which the MRO is allowed to migrate during its execution, and (ii) to find the robust site which will allow acceptable response time in an estimation interval. Performance study shows that, with a risk of loosing around 6% in response time, it is possible to gain up to 300% with the proposed robust placement.