Premium
MR‐tree: an efficient index for MapReduce
Author(s) -
Li Chunsheng,
Chen Jie,
Jin Cheqing,
Zhang Rong,
Zhou Aoying
Publication year - 2014
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.2619
Subject(s) - computer science , search engine indexing , field (mathematics) , index (typography) , big data , process (computing) , tree (set theory) , data mining , information retrieval , world wide web , operating system , mathematical analysis , mathematics , pure mathematics
SUMMARY Nowadays, big data becomes more and more popular, because it widely exists in many applications, such as social network and astronomy. Although building indexes to improve the query processing performance is common in DBMS field, it is infeasible to apply traditional indexing techniques to the MapReduce framework efficiently. Thus, how to process such data efficiently is challenging. In this paper, we study the problem of how to build an index for multidimensional data in MapReduce platform. The experimental results show that the proposed method can run efficiently. Copyright © 2013 John Wiley & Sons, Ltd.