Designing cloud data warehouses using multiobjective evolutionary algorithms

Dökeroǧlu, Tansel
Sert, Seyyit Alper
Çinar, M. Serkan
Coşar, Ahmet
DataBase as a Service (DBaaS) providers need to improve their existing capabilities in data management and balance the efficient usage of virtual resources to multi-users with varying needs. However, there is still no existing method that concerns both with the optimization of the total ownership price and the performance of the queries of a Cloud data warehouse by taking into account the alternative virtual resource allocation and query execution plans. Our proposed method tunes the virtual resources of a Cloud to a data warehouse system, whereas most of the previous studies used to tune the database/queries to a given static resource setting. We solve this important problem with an exact Branch and Bound algorithm and a robust Multiobjective Genetic Algorithm. Finally, through several experiments we conclude remarkable findings of the algorithms we propose.
6th International Conference on Agents and Artificial Intelligence, ICAART 2014


An Evolutionary Genetic Algorithm for Optimization of Distributed Database Queries
Sevinc, Ender; Coşar, Ahmet (2011-05-01)
High-performance low-cost PC hardware and high-speed LAN/WAN technologies make distributed database (DDB) systems an attractive research area where query optimization and DDB design are the two important and related problems. Since dynamic programming is not feasible for optimizing queries in a DDB, we propose a new genetic algorithm (GA)-based query optimizer (new genetic algorithm (NGA)) and compare its performance with random and optimal (exhaustive) algorithms. We perform experiments on a synthetic data...
A simulation study of scheduling algorithms for packet switching networks
Babur, Özgür; Baykal, Buyurman; Department of Electrical and Electronics Engineering (2003)
A scheduling algorithm has the primary role in implementing the quality of service guaranteed to each flow by managing buffer space and selecting which packet to send next with a fair share of network. In this thesis, some scheduling algorithms for packet switching networks are studied. For evaluating their delay, jitter and throughput performances, a discrete event simulator has been developed. It has been seen that fair scheduling provides, fair allocation of bandwidth, lower delay for sources using less ...
Optimal dynamic resource allocation for heterogenous cloud data centers
Ekici, Nazım Umut; Güran Schmidt, Şenan.; Department of Electrical and Electronics Engineering (2019)
Today's data centers are mostly cloud-based with virtualized servers to provide on-demand scalability and flexibility of the available resources such as CPU, memory, data storage and network bandwidth. Heterogeneous cloud data centers (CDCs) offer hardware accelerators in addition to these standard cloud server resources. A cloud data center provider may provide Infrastructure as a Service and Platform as a Service (IPaaS), where the user gets a virtual machine (VM) with processing, memory, storage and netw...
A generalization of openstack for managing heterogeneous cloud resources Heterojen bulut kaynaklarinin yonetimi için openstack genelleştirimi
Erol, Ahmet; Yazar, Alper; Schmidt, Şenan Ece (2019-04-01)
This paper describes the generalization of OpenStack cloud resource management software to manage hardware resources other than the standard resources on the servers. To this end, OpenStack resource data structure is updated and the Nova project, which runs on the compute node, is rewritten so that it can run on different hardware platforms without depending on the operating system.
Robust heuristic algorithms for exploiting the common tasks of relational cloud database queries
Dokeroglu, Tansel; Bayir, Murat Ali; Coşar, Ahmet (2015-05-01)
Cloud computing enables a conventional relational database system's hardware to be adjusted dynamically according to query workload, performance and deadline constraints. One can rent a large amount of resources for a short duration in order to run complex queries efficiently on large-scale data with virtual machine clusters. Complex queries usually contain common subexpressions, either in a single query or among multiple queries that are submitted as a batch. The common subexpressions scan the same relatio...
Citation Formats
T. Dökeroǧlu, S. A. Sert, M. S. Çinar, and A. Coşar, “Designing cloud data warehouses using multiobjective evolutionary algorithms,” Angers, Fransa, 2014, vol. 1, Accessed: 00, 2022. [Online]. Available: