STRUCTURE MODIFIED APPLICATION BACKGROUND THROUGH BIG DATA AND HADOOP MAPREDUCE

  • PRABHU GM

Abstract

Recommender frameworks are found in numerous e- information can be prepared with insignificant blunder rate. Assortment commerce applications today. Recommender frameworks typically alludes to all sorts of information beginning from unorganized crude give the client with a list of proposals that they information to semi-organized and organized information which can be might prefer, or supply predictions on how much the client might prefer each item. Two basic approaches for giving proposals are Community sifting and content based filtering. By combining these two approaches, hybrid proposal frameworks can be made that considers both the appraisals of the client and the item’s highlight to prescribe the things to the user. The highlights of limited sum of information can be dissected with the existing information investigation instruments but when considering an e-book dataset of size in Terabytes, a Big Data investigation instrument such as Hadoop is used. Hadoop is a software framework for dispersed preparing of vast information sets. Hadoop employments MapReduce paradigm to perstructure dispersed preparing over bunches of computers to reduce the time included in dissecting the item’s highlight (watchwords of a book). The proposed framework is reliable and fault tolerant when compared to the existing proposal frameworks as it gathers the appraisals from the client to foresee the interest and analyses the thing to find the features. The framework is moreover versatile as it updates the rating list frequently and finds the updated interest of the user. Experimental results show that the proposed framework is more exact than the existing recommender systems.

References

Candan,K.S, J.W. Kim, P. Nagarkar, M. Nagendra and R.Yu,
RanKloud: Scalable multimedia data processing in server
clusters. IEEE MultiMed, 18: 64-77, 2010.
[2] Chang.F, J.Dean, S.Ghemawat, W.C.Hsieh and D.A. Wallach et
al., BigTable: A distributed storage system for structured data.
ACM Trans. Comput. Syst., 2008.
[3] Dean.J. and S.Ghemawat, MapReduce: Simplified data
processing on large clusters. ACM Commun., 51: 107-113.
2008.
[4] Fadika.Z. and M.Govindaraju, DELMA: Dynamically ELastic
MapReduce framework for CPU-intensive applications.
Proceedings of the 11th IEEE/ACM Cloud and Grid Computing,
May 23-26, 2011.
[5] Ghemawat.S., H.Gobioff and S.T.Leung, The Google file
system. Proceedings of the 19th ACM Symposium on
Operating Systems Principles, (OSP’ 03), New York, USA, pp:
29-43, 2003.
[6] Groot.S. and M.Kitsuregawa, Jumbo: Beyond mapReduce for
workload balancing. Proceedings of the VLDB PhD Workshop,
(PPW’ 10), Singapore, pp: 7-12, 2010.
[7] H.Köhler, J.Yang, X.Zhou, Efficient parallel skyline processing
using hyperplane projections, in: Proceedings of
SIGMOD'2011, 2011.
[8] F.N.Afrati, P.Koutris, D.Suciu, J.D.Ullman, Parallel skyline
queries, in: Proceedings of ICDT'2012, 2012.
[9] S.Liknes, A.Vlachou, C.Doulkeridis, K.Nørvåg, APSkyline:
improved skyline computation for multicore architectures, in:
Proceedings of DASFAA'2014, 2014.
[10] S.Park, T.Kim, J.Park, J.Kim, H.Im, Parallel skyline
computation on multicore architectures, in: Proceedings of
ICDE'2009, 2009.
[11] J.Selke, C.Lofi, W.T.Balke, Highly scalable multiprocessing
algorithms for preference-based database retrieval, in:
Proceedings of DASFAA'2010, 2010.
[12] R.Torlone, P.Ciaccia, Finding the best when it's a matter of
preference, in: Proceedings of SEBD'2002, 2002.
[13] Y.Park, J.K.Min, K.Shim, Parallel computation of skyline and
reverse skyline queries using MapReduce, Proc. VLDB 6 (14)
(2013) 2002–2013.
[14] A.Vlachou, C.Doulkeridis, Y.Kotidis, Angle-based space
partitioning for efficientparallel skyline computation, in:
Proceedings of SIGMOD'2008,
[15] A.Eldawy, M.F.Mokbel, A demonstration of Spatial Hadoop:
an efficient MapReduce framework for spatial data, Proc.
VLDB 6 (12) (2013) 1230–1233.
[16] A.Eldawy, Y.Li, M.F.Mokbel, R.Janardan, CG_Hadoop:
computational geometry in MapReduce, in: SIGSPATIAL/GIS,
2013, pp. 284– 293.
[17] J.Selke, C.Lofi, W.T.Balke, Highly scalable multi-processing
algorithms for preference-based database retrieval, in:
Proceedings of DASFAA'2010, 2010.
[18] R.Torlone, P.Ciaccia, Finding the best when it's a matter of
preference, in: Proceedings of SEBD'2002, 2002.
[19] Y.Park, J.K.Min, K.Shim, Parallel computation of skyline and
reverse skyline queries using MapReduce, Proc. VLDB6(14)
(2013), 2002–2013.
[20] Y.Tao, W.Lin, X.Xiao, Minimal MapReduce algorithms, in:
Proceedings of SIGMOD'2013, 2013,pp. 529–540.
[21] B.Zhang, S.Zhou, J.Guan, Adapting skyline computation to the
MapReduce framework: algorithms and experiments, in:
DASFAA Workshops, 2011, pp.403–414.
Published
2017-10-04
How to Cite
GM, PRABHU. STRUCTURE MODIFIED APPLICATION BACKGROUND THROUGH BIG DATA AND HADOOP MAPREDUCE. International Journal of Applied Engineering and Technical Research- IJAETR, [S.l.], v. 1, n. 3, p. 1, oct. 2017. ISSN 0000-0000. Available at: <http://asianpublication.com/index.php/IJAETR/article/view/15>. Date accessed: 20 aug. 2018.