The case for being lazy: how to leverage lazy evaluation in MapReduce
HPDC '11: The 20th International Symposium on High-Performance Parallel and Distributed Computing San Jose California USA June, 2011(2011)
摘要
In this paper, we study the benefits and overheads of lazy MapReduce processing, where the input data is partitioned and only the smallest subset of these partitions are processed to meet a user's need at any time. We also develop guidelines for successfully applying the lazy MapReduce computation technique to reduce processing times of analysis tasks.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络