INDEXING SCHEME USING PARTITIONED B+-TREE (ISPB) FOR IMPROVING THE EFFICIENCY OF THE HADOOP MAPREDUCE QUERY PROCESSING

ABDULLAHI, ALI USMAN (2018) INDEXING SCHEME USING PARTITIONED B+-TREE (ISPB) FOR IMPROVING THE EFFICIENCY OF THE HADOOP MAPREDUCE QUERY PROCESSING. PhD. thesis, Universiti Teknologi PETRONAS.

[thumbnail of ThesisV01.pdf] PDF
ThesisV01.pdf
Restricted to Registered users only
Download (9MB)

Abstract

The rapid generation and accumulation of data in recent time have led to the concept
of big data which requires emergent and development of tools, techniques and systems
with significant performance improvement when handling such datasets. Hadoop is
one of such systems, that processes 1TB of data in 2 min on a 100 nodes cluster. In an
attempt to improve the Hadoop performance indexing was introduced into it.

Item Type: Thesis (PhD.)
Subjects: T Technology > T Technology (General)
Departments / MOR / COE: Sciences and Information Technology > Computer and Information Sciences
Depositing User: Mr Ahmad Suhairi Mohamed Lazim
Date Deposited: 14 May 2019 10:26
Last Modified: 14 May 2019 10:26
URI: http://utpedia.utp.edu.my/id/eprint/19005

Actions (login required)

View Item
View Item