Efficient Indexing for OLAP Query Processing with MapReduce

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 188
  • Download : 0
As in the conventional databases, an index can be used to improve performance in MapReduce when processing OLAP queries with it. Regarding this, Hadoop++ suggested Trojan index to reduce network I/O by storing a partitioned data and its index together into a same data block, which is a data storage unit in MapReduce. However, this approach requires complex computation to put the data and index into the same block, from which index generation time can significantly increase. In this paper, we propose a new indexing method to resolve this issue. The basic idea of the proposed method is to insert the data and index into separate blocks, and force them to be co-located in the same node. Our experimental results show that the proposed method provides better performance than the existing indexing scheme, including the Trojan index.
Publisher
Springer
Issue Date
2015
Language
English
Citation

Lecture Notes in Electrical Engineering, v.330, pp.783 - 788

ISSN
1876-1100
DOI
10.1007/978-3-662-45402-2_111
URI
http://hdl.handle.net/10203/204067
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0