UCSY's Research Repository

Local Aggregation with Modified B+ tree in Map Reduce Data Processing

Show simple item record

dc.contributor.author Aung, Ohnmar
dc.date.accessioned 2019-07-04T03:10:01Z
dc.date.available 2019-07-04T03:10:01Z
dc.date.issued 2012-02-28
dc.identifier.uri http://onlineresource.ucsy.edu.mm/handle/123456789/370
dc.description.abstract MapReduce is well-applied in high performance computing for large scale data processing. However, as long as the clusters grow, handling with huge amount of intermediate data produced in the shuffle and reduce phases (middle step of Map Reduce) have impacts heavily upon the performance. With local aggregation (either combiners or in-mapper), shuffling large amounts of data can be reduced which alleviates the reduce straggler problem. The proposed modified B+ tree based indexing algorithm is applied to reduce intermediate data amount for output retrieval fast as well as scalable data storage en_US
dc.language.iso en en_US
dc.publisher Tenth International Conference On Computer Applications (ICCA 2012) en_US
dc.title Local Aggregation with Modified B+ tree in Map Reduce Data Processing en_US
dc.type Article en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Repository



Browse

My Account