IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Optimizing Semi-Stream CACHEJOIN for Near-Real- Time Data Warehousing

Optimizing Semi-Stream CACHEJOIN for Near-Real- Time Data Warehousing
View Sample PDF
Author(s): M. Asif Naeem (School of Engineering, Computer and Mathematical Sciences, Auckland University of Technology, Auckland, New Zealand), Erum Mehmood (School of Science and Technology, University of Management and Technology, Lahore, Pakistan), M. G. Abbas Malik (Universal College of Learning, Palmerston North, New Zealand)and Noreen Jamil (National University FAST, Islamabad, Pakistan)
Copyright: 2020
Volume: 31
Issue: 1
Pages: 18
Source title: Journal of Database Management (JDM)
Editor(s)-in-Chief: Keng Siau (Singapore Management University, Singapore)
DOI: 10.4018/JDM.2020010102

Purchase

View Optimizing Semi-Stream CACHEJOIN for Near-Real- Time Data Warehousing on the publisher's website for pricing and purchasing information.

Abstract

Streaming data join is a critical process in the field of near-real-time data warehousing. For this purpose, an adaptive semi-stream join algorithm called CACHEJOIN (Cache Join) focusing non-uniform stream data is provided in the literature. However, this algorithm cannot exploit the memory and CPU resources optimally and consequently it leaves its service rate suboptimal due to sequential execution of both of its phases, called stream-probing (SP) phase and disk-probing (DP) phase. By integrating the advantages of CACHEJOIN, this article presents two modifications for it. The first is called P-CACHEJOIN (Parallel Cache Join) that enables the parallel processing of two phases in CACHEJOIN. This increases number of joined stream records and therefore improves throughput considerably. The second is called OP-CACHEJOIN (Optimized Parallel Cache Join) that implements a parallel loading of stored data into memory while the DP phase is executing. This research presents the performance analysis of both of the approaches defined within the paper existing CACHEJOIN empirically using synthetic skewed dataset.

Related Content

Keshav Kaushik, Akashdeep Bhardwaj, Xiaochun Cheng, Susheela Dahiya, Achyut Shankar, Manoj Kumar, Tushar Mehrotra. © 2025. 21 pages.
Jianyu Li, Peizhong Yang, Kun Yue, Liang Duan, Zehao Huang. © 2025. 24 pages.
Omar Al-Shamali, James Miller, Shaikh Quader. © 2025. 26 pages.
Pasi Raatikainen, Samuli Pekkola, Maria Mäkelä. © 2024. 30 pages.
Ruizhe Ma, Weiwei Zhou, Zongmin Ma. © 2024. 21 pages.
Shijo Joy, Deepak Kumar Panda, Prabin Kumar Panigrahi, Razaz Waheeb Attar, Brij B. Gupta. © 2024. 25 pages.
Lavlin Agrawal, Pavankumar Mulgund, Raj Sharman. © 2024. 37 pages.
Body Bottom