Wang Shan
Computer Engineering College, Shenzhen Polytechnic College, Shenzhen, 518055, China
Li Yue-Ping
Computer Engineering College, Shenzhen Polytechnic College, Shenzhen, 518055, China
ABSTRACT
Facing massive data processing of off-site auditing systems in commercial bank, an optimal task scheduling method of ETL based on greedy algorithm is proposed. The shortest total task processing time can be achieved by this task scheduling method. Through the actual test, the high efficiency and stability of our task scheduling method based on greedy algorithm is proven.
PDF References Citation
How to cite this article
Wang Shan and Li Yue-Ping, 2013. Task Scheduling Strategies of Etl for Banking Off-site Audits. Information Technology Journal, 12: 6273-6276.
DOI: 10.3923/itj.2013.6273.6276
URL: https://scialert.net/abstract/?doi=itj.2013.6273.6276
DOI: 10.3923/itj.2013.6273.6276
URL: https://scialert.net/abstract/?doi=itj.2013.6273.6276
REFERENCES
- Karagiannis, A., P. Vassiliadis and A. Simitsis, 2013. Scheduling strategies for efficient ETL execution. Inform. Syst., 38: 927-945.
CrossRef - El Akkaoui, Z., E. Zimanyi, J.N. Mazon and J. Trujillo, 2013. A BPMN-based design and maintenance framework for ETL processes. Int. J. Data Warehousing Mining, 9: 46-72.
CrossRef - Luo, H., W. Zhou, D. Ye and J. Yu, 2012. A buffer-based parallel ETL data flow processing framework. Comput. Appl. Software, 1: 88-91.
Direct Link - Song, X.D., X.Z. Zuo, X.B. Liu and X.L. Yan, 2010. Design ETL meta-model in data warehouses. Comput. Simul., 9: 106-108, 119.
Direct Link - Jorg, T. and S. Deβloch, 2008. Towards generating ETL processes for incremental loading. Proceedings of the International Symposium on Database Engineering and Applications, September 3-5, 2008, Munster, Germany, pp: 101-110.
CrossRef - Zhang, T., 2003. Sequential greedy approximation for certain convex optimization problems. IEEE Trans. Inform. Theory, 49: 682-691.
CrossRef