{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:05:44Z","timestamp":1743077144537,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030260712"},{"type":"electronic","value":"9783030260729"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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-26072-9_16","type":"book-chapter","created":{"date-parts":[[2019,7,24]],"date-time":"2019-07-24T23:05:48Z","timestamp":1564009548000},"page":"223-239","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Distributed Landmark Selection for Lower Bound Estimation of Distances in Large Graphs"],"prefix":"10.1007","author":[{"given":"Mingdao","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Xia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zheng","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,18]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139177801","volume-title":"Tractability: Practical Approaches to Hard Problems","author":"L Bordeaux","year":"2014","unstructured":"Bordeaux, L., Hamadi, Y., Kohli, P.: Tractability: Practical Approaches to Hard Problems. Cambridge University Press, Cambridge (2014)"},{"issue":"1","key":"16_CR2","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.socnet.2004.11.008","volume":"27","author":"SP Borgatti","year":"2005","unstructured":"Borgatti, S.P.: Centrality and network flow. Soc. Netw. 27(1), 55\u201371 (2005)","journal-title":"Soc. Netw."},{"key":"16_CR3","unstructured":"Gonzalez, J.E., Low, Y., Gu, H., Bickson, D., Guestrin, C.: PowerGraph: distributed graph-parallel computation on natural graphs. In: OSDI, pp. 17\u201330 (2012)"},{"key":"16_CR4","unstructured":"Gonzalez, J.E., Xin, R.S., Dave, A., Crankshaw, D., Franklin, M.J., Stoica, I.: GraphX: graph processing in a distributed dataflow framework. In: OSDI, pp. 599\u2013613 (2014)"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Gubichev, A., Bedathur, S.J., Seufert, S., Weikum, G.: Fast and accurate estimation of shortest paths in large graphs. In: CIKM, pp. 499\u2013508 (2010)","DOI":"10.1145\/1871437.1871503"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Ko, S., Han, W.: TurboGraph++: a scalable and fast graph analytics system. In: SIGMOD, pp. 395\u2013410 (2018)","DOI":"10.1145\/3183713.3196915"},{"issue":"2","key":"16_CR7","doi-asserted-by":"crossref","first-page":"167","DOI":"10.3233\/SW-140134","volume":"6","author":"J Lehmann","year":"2015","unstructured":"Lehmann, J., et al.: DBpedia - a large-scale, multilingual knowledge base extracted from Wikipedia. Semant. Web 6(2), 167\u2013195 (2015)","journal-title":"Semant. Web"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J.M., Glance, N.S.: Cost-effective outbreak detection in networks, pp. 420\u2013429 (2007)","DOI":"10.1145\/1281192.1281239"},{"key":"16_CR9","unstructured":"Leskovec, J., Krevl, A.: SNAP datasets: stanford large network dataset collection, June 2014. http:\/\/snap.stanford.edu\/data"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Malewicz, G., et al.: Pregel: a system for large-scale graph processing. In: SIGMOD, pp. 135\u2013146 (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Potamias, M., Bonchi, F., Castillo, C., Gionis, A.: Fast shortest path distance estimation in large networks. In: CIKM, pp. 867\u2013876 (2009)","DOI":"10.1145\/1645953.1646063"},{"issue":"1","key":"16_CR12","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1109\/TKDE.2012.253","volume":"26","author":"M Qiao","year":"2014","unstructured":"Qiao, M., Cheng, H., Chang, L., Yu, J.X.: Approximate shortest distance computing: a query-dependent local landmark scheme. IEEE Trans. Knowl. Data Eng. 26(1), 55\u201368 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-642-22351-8_16","volume-title":"Scientific and Statistical Database Management","author":"M Qiao","year":"2011","unstructured":"Qiao, M., Cheng, H., Yu, J.X.: Querying shortest path distance with bounded errors in large graphs. In: Bayard Cushing, J., French, J., Bowers, S. (eds.) SSDBM 2011. LNCS, vol. 6809, pp. 255\u2013273. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22351-8_16"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-319-46547-0_19","volume-title":"The Semantic Web \u2013 ISWC 2016","author":"T Rebele","year":"2016","unstructured":"Rebele, T., Suchanek, F., Hoffart, J., Biega, J., Kuzey, E., Weikum, G.: YAGO: a multilingual knowledge base from Wikipedia, wordnet, and geonames. In: Groth, P., et al. (eds.) ISWC 2016. LNCS, vol. 9982, pp. 177\u2013185. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46547-0_19"},{"key":"16_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-47431-1","volume-title":"Large-Scale Graph Processing Using Apache Giraph","author":"S Sakr","year":"2016","unstructured":"Sakr, S., Orakzai, F.M., Abdelaziz, I., Khayyat, Z.: Large-Scale Graph Processing Using Apache Giraph. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-47431-1"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Tretyakov, K., Armas-Cervantes, A., Garc\u00eda-Ba\u00f1uelos, L., Vilo, J., Dumas, M.: Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs. In: CIKM, pp. 1785\u20131794 (2011)","DOI":"10.1145\/2063576.2063834"},{"issue":"14","key":"16_CR17","first-page":"1981","volume":"7","author":"D Yan","year":"2014","unstructured":"Yan, D., Cheng, J., Lu, Y., Ng, W.: Blogel: a block-centric framework for distributed computation on real-world graphs. PVLDB 7(14), 1981\u20131992 (2014)","journal-title":"PVLDB"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Yan, D., Cheng, J., Lu, Y., Ng, W.: Effective techniques for message reduction and load balancing in distributed graph computation. In: WWW, pp. 1307\u20131317 (2015)","DOI":"10.1145\/2736277.2741096"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Zhang, Q., Yan, D., Cheng, J.: Quegel: a general-purpose system for querying big graphs. In: SIGMOD, pp. 2189\u20132192 (2016)","DOI":"10.1145\/2882903.2899398"},{"issue":"1","key":"16_CR20","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s00778-011-0238-6","volume":"21","author":"L Zou","year":"2012","unstructured":"Zou, L., Chen, L., \u00d6zsu, M.T., Zhao, D.: Answering pattern match queries in large graph databases via graph embedding. VLDB J. 21(1), 97\u2013120 (2012)","journal-title":"VLDB J."}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26072-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:25:58Z","timestamp":1709810758000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-26072-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030260712","9783030260729"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26072-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"18 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cfm.uestc.edu.cn\/apwebwaim2019\/","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":"Research Microsoft","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"180","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":"42","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":"17","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":"23% - 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":"3","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":"5","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}