An Optimal Data Placement Strategy for Improving System Performance of Massive Data Applications Using Graph Clustering

Publisher： IGI Global_journal

E-ISSN： 1941-6245|9|3|15-30

ISSN： 1941-6237

Source： International Journal of Ambient Computing and Intelligence (IJACI), Vol.9, Iss.3, 2018-07, pp. : 15-30

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On clustering massive text and categorical data streams

By Aggarwal Charu   Yu Philip  

Knowledge and Information Systems, Vol. 24, Iss. 2, 2010-08 ,pp. : 171-196

Springer Publishing Company

Access to resources Recommend Favorite

On the power-law random graph model of massive data networks

By Reittu H.   Norros I.  

Performance Evaluation, Vol. 55, Iss. 1, 2004-01 ,pp. : 3-23

Elsevier

Access to resources Recommend Favorite

DATA CLUSTERING USING A REORGANIZING NEURAL NETWORK

By Kukolj Dragan   Atlagic Branislav   Petrov Milovan  

Cybernetics and Systems, Vol. 37, Iss. 7, 2006-10 ,pp. : 779-790

Taylor & Francis Ltd

Access to resources Recommend Favorite

Hybrid entity clustering using crowds and data

By Lee Jongwuk   Cho Hyunsouk   Park Jin-Woo   Cha Young-rok   Hwang Seung-won   Nie Zaiqing   Wen Ji-Rong  

The VLDB Journal, Vol. 22, Iss. 5, 2013-10 ,pp. : 711-726

Springer Publishing Company

Access to resources Recommend Favorite

Optimal placement of data replicas in distributed database with majority voting protocol

By Shekhar S.   Wu W.  

Theoretical Computer Science, Vol. 258, Iss. 1, 2001-05 ,pp. : 555-571

Elsevier

Access to resources Recommend Favorite