{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T21:20:47Z","timestamp":1775251247047,"version":"3.50.1"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030026066","type":"print"},{"value":"9783030026073","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,10,17]],"date-time":"2018-10-17T00:00:00Z","timestamp":1539734400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-02607-3_1","type":"book-chapter","created":{"date-parts":[[2018,10,16]],"date-time":"2018-10-16T04:53:30Z","timestamp":1539665610000},"page":"3-13","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["iDBP: A Distributed Min-Cut Density-Balanced Algorithm for Incremental Web-Pages Ranking"],"prefix":"10.1007","author":[{"given":"Sumalee","family":"Sangamuang","sequence":"first","affiliation":[]},{"given":"Pruet","family":"Boonma","sequence":"additional","affiliation":[]},{"given":"Juggapong","family":"Natwichai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,17]]},"reference":[{"issue":"1","key":"1_CR1","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1137\/S0895480102412856","volume":"17","author":"Ronald Fagin","year":"2003","unstructured":"Fagin, R., Kumar, R., Sivakumar, D.: Comparing top k lists. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pp. 28\u201336 (2003)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"1_CR2","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York (1990)"},{"key":"1_CR3","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection (2014). http:\/\/snap.stanford.edu\/data"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Montresor, A., Jelasity, M.: PeerSim: a scalable P2P simulator. In: Proceedings of the 9th International Conference on Peer-to-Peer (P2P 2009), pp. 99\u2013100. Seattle (2009)","DOI":"10.1109\/P2P.2009.5284506"},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"Parreira, J.X., Donato, D., Castillo, C., Weikum, G.: Computing trusted authority scores in peer-to-peer web search networks. In: Proceedings of the 3rd International Workshop on Adversarial Information Retrieval on the Web, AIRWeb 2007, pp. 73\u201380. ACM, New York (2007). https:\/\/doi.org\/10.1145\/1244408.1244422","DOI":"10.1145\/1244408.1244422"},{"key":"1_CR6","unstructured":"Parreira, J.X., Weikum, G.: JXP global authority scores in a P2P network. In: Proceedings of the Eight International Work-shop on the Web and Databases (WebDB 2005), pp. 31\u201336. Baltimore (2005)"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"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\u2013127 (2011)","DOI":"10.1109\/3PGCIC.2011.28"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Sangamuang, S., Boonma, P., Natwichai, J.: An efficient algorithm for density-balanced partitioning in distributed pagerank. In: Proceedings of the 2014 9th International Conference on Digital Information Management, ICDIM 2014, pp. 118\u2013123 (2014)","DOI":"10.1109\/ICDIM.2014.6991418"},{"key":"1_CR9","first-page":"257","volume-title":"An Algorithm for Min-Cut Density-Balanced Partitioning in P2P Web Ranking","author":"S Sangamuang","year":"2015","unstructured":"Sangamuang, S., Boonma, P., Natwichai, J.: An Algorithm for Min-Cut Density-Balanced Partitioning in P2P Web Ranking, pp. 257\u2013266. Springer International Publishing, Cham (2015)"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Sangamuang, S., Natwichai, J., Boonma, P.: Incremental web ranking on p2p networks. In: Proceedings of the 2011 3rd International Conference on Computer Research and Development, vol. 4, pp. 519\u2013523 (2011)","DOI":"10.1109\/ICCRD.2011.5763901"},{"key":"1_CR11","unstructured":"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, p. 58. IEEE Computer Society (2003)"},{"key":"1_CR12","unstructured":"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 (2003)"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Steinbauer, M., Anderst-Kotsis, G.: Dynamograph: a distributed system for large-scale, temporal graph processing, its implementation and first observations. In: Proceedings of the 25th International Conference Companion on World Wide Web, pp. 861\u2013866 (2016)","DOI":"10.1145\/2872518.2889293"},{"issue":"1","key":"1_CR14","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/TNET.2002.808407","volume":"11","author":"I Stoica","year":"2003","unstructured":"Stoica, I., et al.: Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE\/ACM Trans. Netw. 11(1), 17\u201332 (2003)","journal-title":"IEEE\/ACM Trans. Netw."}],"container-title":["Lecture Notes on Data Engineering and Communications Technologies","Advances on P2P, Parallel, Grid, Cloud and Internet Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-02607-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T20:10:14Z","timestamp":1775247014000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-02607-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,17]]},"ISBN":["9783030026066","9783030026073"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-02607-3_1","relation":{},"ISSN":["2367-4512","2367-4520"],"issn-type":[{"value":"2367-4512","type":"print"},{"value":"2367-4520","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,17]]},"assertion":[{"value":"17 October 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"3PGCIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taichung","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pgcic2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}