Open AccessScheduling Optimization For Extract, Transform, Load (ETL) Process On Data Warehouse Using Round Robin Method (Case Study: University Of XYZ)
Author(s) -
Agung Yudha Berliantara,
Satrio Agung Wicaksono,
Aryo Pinandito
Publication year - 2017
Publication title -
jitecs (journal of information technology and computer science)
Language(s) - English
Resource type - Journals
eISSN - 2540-9824
pISSN - 2540-9433
DOI - 10.25126/jitecs.20172232
Subject(s) - computer science , scheduling (production processes) , data warehouse , parallel computing , distributed computing , mathematical optimization , database , mathematics
ETL scheduling is a challenging and exciting issue to solve. The ETL scheduling problem has many facets, one of which is the cost of time. If it is not handled correctly, it may take a very long time to execute and inconsistent data in very large data. In this study using Round-robin algorithm method that proved able to produce efficient results and in accordance with conventional methods. After doing the research, the difference between these two methods is about execution time. Through this experiment, the Round-robin scheduling method gives a more efficient execution time of up to 61% depending on the amount of data and the number of partitions used.