Abstract
In P2P-based PageRank computing, each computational peer contains a partitioned local web-link graph and its PageRank is computed locally. Then, collaborative web ranking between any two peers will be proceeded iteratively to adjust the web ranking until converge. In this paper, the problem of partitioning web-link graph for web ranking in P2P is formulated as a minimal cut-set with density-balanced partitioning. Then, an efficient algorithm called DBP-dRanking is proposed to address such problem. The algorithm can solve the problem with computational complexity of a polynomial function to the web-link graph size. The results also confirm that the proposed algorithm can reduce the ranking error by partitioning web-link graph and perform faster than two other algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andreev, K., Racke, H.: Balanced graph partitioning. Theory of Computing Systems 39(6), 929–939 (2006)
Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Computer Networks and ISDN Systems 30(1-7), 107–117 (1998)
Desikan, P.K., Srivastava, J., Kumar, V., Tan, P.N.: Hyperlink analysis - techniques and applications. Technical report, Army High Performance Computing Center (2002)
Even, G., Naor, J.S., Rao, S., Schieber, B.: Fast approximate graph partitioning algorithms. In: Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 639–648. Society for Industrial and Applied Mathematics, Philadelphia (1997)
Fagin, R., Kumar, R., Sivakumar, D.: Comparing top k lists. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pp. 28–36 (2003)
Feige, U., Krauthgamer, R.: A polylogarithmic approximation of the minimum bisection. SIAM J. Comput. 31(4), 1090–1118 (2002)
Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. Journal of the ACM 46(5), 604–632 (1999)
Langville, A.N., Meyer, C.D.: Deeper inside PageRank. Internet Mathematics 1(1), 1–42 (2004)
Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical report, Stanford University (1998)
Parreira, J.X., Weikum, G.: JXP global authority scores in a P2P network. In: Proceedings of the Eight International Workshop on the Web and Databases (WebDB 2005), Baltimore, Maryland, USA, pp. 31–36 (2005)
Sangamuang, S., Boonma, P., Natwichai, J.: A P2P-based incremental web ranking algorithm. In: Proceedings of the 2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing, pp. 123–127 (October 2011)
Sanjeev Arora, S.R., Vazirani, U.: Expander flows, geometric embeddings, and graph partitionings. In: Proceedings of the 36th ACM Symposium on Theory of Computing (STOC), Chicago, IL, USA, pp. 222–231 (2004)
Sankaralingam, K., Sethumadhavan, S., Browne, J.C.: Distributed pagerank for p2p systems. In: Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing, pp. 58–68. IEEE Computer Society (2003)
Shi, S., Yu, J., Yang, G., Wang, D.: Distributed page ranking in structured p2p networks. In: Proceedings of the 2003 International Conference on Parallel Processing, pp. 179–186 (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Sangamuang, S., Boonma, P., Natwichai, J. (2015). An Algorithm for Min-Cut Density-Balanced Partitioning in P2P Web Ranking. In: Unger, H., Meesad, P., Boonkrong, S. (eds) Recent Advances in Information and Communication Technology 2015. Advances in Intelligent Systems and Computing, vol 361. Springer, Cham. https://doi.org/10.1007/978-3-319-19024-2_26
Download citation
DOI: https://doi.org/10.1007/978-3-319-19024-2_26
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-19023-5
Online ISBN: 978-3-319-19024-2
eBook Packages: EngineeringEngineering (R0)