Placing big graph into cloud for parallel processing with a two-phase community-aware approach

Hu, Kekun; Zeng, Guosun

doi:10.1016/j.future.2019.07.014

Cited by 4 publications

(2 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The experimental data we used are: wiki-Vote [37], amazon0302 [38], Slashdot0811 [39], and 2 synthetic datasets. The first three are real-world graphs in application fields, while the last two are synthetic graphs generated by the tool P-MAT [40]. This experimental data is shown in Table 1.…”

Section: A Experimental Environmentmentioning

confidence: 99%

Towards PageRank Update in a Streaming Graph by Incremental Random Walk

2022

Self Cite

View full text Add to dashboard Cite

As the internet and the Internet of Things (IoT) have been widely applied in many application fields, a large number of graphs are continuously produced and change over time, which leads to difficulties in graph analysis and utilization. This paper studies a PageRank update algorithm for a streaming graph using incremental random walk. We focus on the information about the local changes of nodes and edges in the current graph, analyze the impact of such local changes on this current graph, and then use the idea behind wave propagation theory to seek and determine all affected nodes that need to be updated their PageRank in the new graph. For new nodes, the existing nodes in the current graph that are connected with these new nodes are aggregated into a supernode, and the PageRank of the new nodes is solved in the new graph with the supernode. Finally, we conduct a series of experiments on real-world and synthetic graph datasets. Compared with the state-of-the-art incremental computing algorithm, our algorithm not only ensures the accuracy of calculating the PageRank in a large streaming graph, but also speeds up the computational process by avoiding many redundant computations.

show abstract

Section: A Experimental Environmentmentioning

confidence: 99%

Towards PageRank Update in a Streaming Graph by Incremental Random Walk

2022

Self Cite

View full text Add to dashboard Cite

show abstract

“…Energy consuming, necessary memories, operating time, essential storage are some of the perspectives that have to be considered during the optimization process [20]. The key in query processing in cloud is the parallel processing [21]. In service level agreement concept deals with the multi-tenant data process unit [22].…”

Section: Problem Statementmentioning

confidence: 99%

Securing Cloud Data Against Cyber-Attacks Using Hybrid Aes With MHT Algorithm

Jayapandian¹

2020

IJC

View full text Add to dashboard Cite

Cloud computing is dealing with large amount of data during data communication. This data processing is named as big data. The big data is growth of the demand in accessing the storage, computation and communication. This big data has the major defects. A raising issue in emerging big data is cost minimization. The architecture of big data ranges over multiple machines and cluster which have sub system. The major challenge of this big data is pre-processing and analysing the data patterns. This research article is dealing with different data pre-processing and secure data storage. There are many research challenges during this data process. The possible gap and drawbacks in the technology are identified through this survey and the efficient big data service is provided through MHT and AES algorithm. The main aim of this proposed method is to provide better data security during larger data process. The proposed hybrid MHT with AES algorithm is to minimize the encryption and decryption time apart from that it reduces the attacker ratio. All these parameters automatically increase the Quality of Service.

show abstract

Contributions of modularity to the circular economy: A systematic review of literature

Machado

Morioka

2021

Journal of Building Engineering

View full text Add to dashboard Cite

Placing big graph into cloud for parallel processing with a two-phase community-aware approach

Cited by 4 publications

References 32 publications

Towards PageRank Update in a Streaming Graph by Incremental Random Walk

Towards PageRank Update in a Streaming Graph by Incremental Random Walk

Securing Cloud Data Against Cyber-Attacks Using Hybrid Aes With MHT Algorithm

Contributions of modularity to the circular economy: A systematic review of literature

Contact Info

Product

Resources

About