A Systematic Overview of Caching Mechanisms to Improve Hadoop Performance
Bibliographic record
Abstract
ABSTRACT In today's distributed computing environments, the rapid generation of large‐scale data from diverse sources poses significant challenges in terms of storage, management, and processing, particularly for traditional relational databases. Hadoop has emerged as a widely adopted framework for handling such data through parallel processing across distributed clusters. Despite its advantages in scalability, flexibility, and fault tolerance, Hadoop suffers from inefficiencies related to high data access latency, redundant computations, and I/O overhead, which degrade overall system performance. To mitigate these issues, researchers have proposed various caching mechanisms aimed at improving data access time, enhancing data locality, minimizing duplicate computations, and optimizing resource utilization. This paper provides a comprehensive survey and novel classification of existing caching strategies for Hadoop, categorizing them based on the specific Hadoop performance bottlenecks they address. A detailed comparative analysis is provided based on critical caching characteristics such as cached item type, cache management policies, replacement strategies, and access patterns. To assess the effectiveness of these caching mechanisms, their impact on key Hadoop performance metrics is evaluated. Also, statistical insights are presented, highlighting the percentage of reviewed studies addressing specific Hadoop performance challenges and the frequency of performance metrics used for evaluation. Finally, this survey identifies hybrid caching as a promising future trend and proposes a novel approach termed Hybrid Intelligent Cache (HIC) as an example. HIC combines the strengths of two previously developed methods from distinct categories. The first method is the Hybrid Support Vector Machine–Least Recently Used (H‐SVM‐LRU) algorithm, which enhances the traditional LRU cache replacement strategy by employing a Support Vector Machine (SVM) to predict future data access patterns for intelligent eviction. The second is Cache Locality with Q‐Learning in MapReduce Scheduling (CLQLMRS), a reinforcement learning–based scheduling technique that optimizes task allocation by maximizing both cache locality and data locality. Experimental results demonstrate that HIC yields an average 31.2% improvement in job execution time, marking a significant advancement in intelligent caching for Hadoop ecosystems.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".