{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T12:32:40Z","timestamp":1744288360685,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030875701"},{"type":"electronic","value":"9783030875718"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-87571-8_55","type":"book-chapter","created":{"date-parts":[[2021,9,16]],"date-time":"2021-09-16T09:02:47Z","timestamp":1631782967000},"page":"635-646","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Adaptive Sharing Framework for Efficient Multi-source Shortest Path Computation"],"prefix":"10.1007","author":[{"given":"Xinyi","family":"Liu","sequence":"first","affiliation":[]},{"given":"Zhigang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Ning","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xiangtan","family":"Li","sequence":"additional","affiliation":[]},{"given":"Bo","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Qiao","sequence":"additional","affiliation":[]},{"given":"Zhiqiang","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Jie","family":"Nie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,17]]},"reference":[{"issue":"4","key":"55_CR1","doi-asserted-by":"publisher","first-page":"449","DOI":"10.14778\/2735496.2735507","volume":"8","author":"M Then","year":"2014","unstructured":"Then, M., et al.: The more the merrier: efficient multi-source graph traversal. Proc. VLDB Endow. 8(4), 449\u2013460 (2014)","journal-title":"Proc. VLDB Endow."},{"issue":"2","key":"55_CR2","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s13222-017-0261-x","volume":"17","author":"M Then","year":"2017","unstructured":"Then, M., G\u00fcnnemann, S., Kemper, A., Neumann, T.: Efficient batched distance, closeness and betweenness centrality computation in unweighted and weighted graphs. Datenbank-Spektrum 17(2), 169\u2013182 (2017)","journal-title":"Datenbank-Spektrum"},{"key":"55_CR3","unstructured":"Kaufmann, M., Then, M., Kemper, A., Neumann, T.: Parallel array-based single-and multi-source breadth first searches on large dense graphs. In: EDBT, pp. 1\u201312 (2017)"},{"key":"55_CR4","unstructured":"Shen, D.: Lower bounds on rate of convergence of matrix products in all pairs shortest path of social network. arXiv preprint arXiv:2006.13412 (2020)"},{"key":"55_CR5","doi-asserted-by":"crossref","unstructured":"Kang, S.J., Lee, S.Y., Lee, K.M.: Performance comparison of OpenMP, MPI, and MapReduce in practical problems. In: Advances in Multimedia 2015 (2015)","DOI":"10.1155\/2015\/575687"},{"issue":"3","key":"55_CR6","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1061\/(ASCE)CP.1943-5487.0000220","volume":"27","author":"A Pradhan","year":"2013","unstructured":"Pradhan, A., Mahinthakumar, G.: Finding all-pairs shortest path for a large-scale transportation network using parallel Floyd-Warshall and parallel Dijkstra algorithms. J. Comput. Civil Eng. 27(3), 263\u2013273 (2013)","journal-title":"J. Comput. Civil Eng."},{"key":"55_CR7","unstructured":"Yang, L., Li, R., Tang, Z.: Research on the single source shortest path algorithm using MapReduce. Microcomput. Inf. 27(12), 97\u201399 (2011). (in Chinese)"},{"issue":"1","key":"55_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40537-018-0125-8","volume":"5","author":"WYH Adoni","year":"2018","unstructured":"Adoni, W.Y.H., Nahhal, T., Aghezzaf, B., Elbyed, A.: The MapReduce-based approach to improve the shortest path computation in large-scale road networks: the case of A* algorithm. J. Big Data 5(1), 1\u201324 (2018)","journal-title":"J. Big Data"},{"key":"55_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-030-30952-7_20","volume-title":"Web Information Systems and Applications","author":"Y Gao","year":"2019","unstructured":"Gao, Y., Yao, L., Yu, J.: Research of query verification algorithm on body sensing data in cloud computing environment. In: Ni, W., Wang, X., Song, W., Li, Y. (eds.) WISA 2019. LNCS, vol. 11817, pp. 176\u2013188. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30952-7_20"},{"key":"55_CR10","series-title":"EAI\/Springer Innovations in Communication and Computing","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-030-13705-2_8","volume-title":"Smart Infrastructure and Applications","author":"Y Arfat","year":"2020","unstructured":"Arfat, Y., Suma, S., Mehmood, R., Albeshri, A.: Parallel shortest path big data graph computations of US road network using apache spark: survey, architecture, and evaluation. In: Mehmood, R., See, S., Katib, I., Chlamtac, I. (eds.) Smart Infrastructure and Applications. EICC, pp. 185\u2013214. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-13705-2_8"},{"key":"55_CR11","doi-asserted-by":"crossref","unstructured":"Malewicz, G., et al.: Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD, pp. 135\u2013146 (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"55_CR12","doi-asserted-by":"crossref","unstructured":"Liu, H., Huang, H.H., Hu, Y.: IBFS: concurrent breadth-first search on GPUs. In: the 2016 International Conference on Management of Data, pp. 403\u2013416 (2016)","DOI":"10.1145\/2882903.2882959"},{"key":"55_CR13","unstructured":"Zhang, Y., et al.: CGraph: a correlations-aware approach for efficient concurrent iterative graph processing. In: 2018 Annual Technical Conference, pp. 441\u2013452 (2018)"},{"key":"55_CR14","unstructured":"https:\/\/spark.apache.org\/"},{"key":"55_CR15","unstructured":"https:\/\/flink.apache.org\/"},{"key":"55_CR16","unstructured":"http:\/\/giraph.apache.org\/"},{"key":"55_CR17","unstructured":"https:\/\/hama.apache.org\/"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87571-8_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:56:25Z","timestamp":1709834185000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87571-8_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030875701","9783030875718"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87571-8_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kaifeng","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wisa22021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wisa.org.cn\/wisa2021\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"206","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6,5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}