{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T11:01:45Z","timestamp":1758279705674},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2020,6,18]],"date-time":"2020-06-18T00:00:00Z","timestamp":1592438400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,18]],"date-time":"2020-06-18T00:00:00Z","timestamp":1592438400000},"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":["World Wide Web"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s11280-020-00819-6","type":"journal-article","created":{"date-parts":[[2020,6,18]],"date-time":"2020-06-18T15:03:52Z","timestamp":1592492632000},"page":"3025-3053","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Towards distributed node similarity search on graphs"],"prefix":"10.1007","volume":"23","author":[{"given":"Tianming","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunjun","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baihua","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiting","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,18]]},"reference":[{"issue":"3","key":"819_CR1","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1007\/s10586-015-0472-6","volume":"18","author":"O Batarfi","year":"2015","unstructured":"Batarfi, O., Shawi, R.E., Fayoumi, A.G., Nouri, R., Beheshti, S., Barnawi, A., Sakr, S.: Large scale graph processing systems: Survey and an experimental evaluation. Clust. Comput. 18(3), 1189\u20131213 (2015)","journal-title":"Clust. Comput."},{"key":"819_CR2","doi-asserted-by":"crossref","unstructured":"Batko, M., Kohoutkov\u00e1, P., Novak, D.: Cophir image collection under the microscope. In: SISAP , pp 47\u201354 (2009)","DOI":"10.1109\/SISAP.2009.25"},{"key":"819_CR3","doi-asserted-by":"crossref","unstructured":"Boutet, A., Kermarrec, A., Mittal, N., Ta\u00efani, F.: Being prepared in a sparse world: The case of K NN graph construction. In: ICDE, pp. 241\u2013252 (2016)","DOI":"10.1109\/ICDE.2016.7498244"},{"key":"819_CR4","doi-asserted-by":"crossref","unstructured":"Chen, L., Gao, Y., Li, X., Jensen, C.S., Chen, G.: Efficient metric indexing for similarity search. In: ICDE, pp. 591\u2013602 (2015)","DOI":"10.1109\/ICDE.2015.7113317"},{"issue":"1","key":"819_CR5","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1109\/TKDE.2015.2453954","volume":"28","author":"L Chen","year":"2016","unstructured":"Chen, L., Gao, Y., Chen, G., Zhang, H.: Metric all-k-nearest-neighbor search. IEEE Trans. Knowl. Data Eng. 28(1), 98\u2013112 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"819_CR6","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1109\/TKDE.2016.2631599","volume":"29","author":"G Chen","year":"2017","unstructured":"Chen, G., Yang, K., Chen, L., Gao, Y., Zheng, B., Chen, C.: Metric similarity joins using mapreduce. IEEE Trans. Knowl. Data Eng. 29(3), 656\u2013669 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"819_CR7","doi-asserted-by":"publisher","first-page":"12:1","DOI":"10.1145\/1921632.1921638","volume":"5","author":"H Cheng","year":"2011","unstructured":"Cheng, H., Zhou, Y., Yu, J.X.: Clustering large attributed graphs: A balance between structural and attribute similarities. TKDD 5(2), 12:1\u201312:33 (2011)","journal-title":"TKDD"},{"key":"819_CR8","doi-asserted-by":"crossref","unstructured":"Cohen, S., Kimelfeld, B., Koutrika, G.: A survey on proximity measures for social networks. In: Search Computing - Broadening Web Search, pp. 191\u2013206 (2012)","DOI":"10.1007\/978-3-642-34213-4_13"},{"issue":"1","key":"819_CR9","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: Mapreduce: Simplified data processing on large clusters. Commun. ACM 51(1), 107\u2013113 (2008)","journal-title":"Commun. ACM"},{"key":"819_CR10","doi-asserted-by":"crossref","unstructured":"Dong, W., Charikar, M., Li, K.: Efficient k-nearest neighbor graph construction for generic similarity measures. In: WWW, pp. 577\u2013586 (2011)","DOI":"10.1145\/1963405.1963487"},{"key":"819_CR11","doi-asserted-by":"crossref","unstructured":"Dong, Y., Zhang, J., Tang, J., Chawla, N.V., Wang, B.: Coupledlp: Link prediction in coupled networks. In: SIGKDD, pp. 199\u2013208 (2015)","DOI":"10.1145\/2783258.2783329"},{"issue":"5","key":"819_CR12","first-page":"442","volume":"5","author":"Y Fujiwara","year":"2012","unstructured":"Fujiwara, Y., Nakatsuji, M., Onizuka, M., Kitsuregawa, M.: Fast and exact top-k search for random walk with restart. PVLDB 5(5), 442\u2013453 (2012)","journal-title":"PVLDB"},{"key":"819_CR13","doi-asserted-by":"crossref","unstructured":"Fujiwara, Y., Nakatsuji, M., Shiokawa, H., Mishima, T., Onizuka, M.: Efficient ad-hoc search for personalized pagerank. In: SIGMOD, pp. 445\u2013456 (2013)","DOI":"10.1145\/2463676.2463717"},{"key":"819_CR14","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":"819_CR15","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Simrank: A measure of structural-context similarity. In: SIGKDD, pp. 538\u2013543 (2002)","DOI":"10.1145\/775047.775126"},{"issue":"5","key":"819_CR16","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1109\/TKDE.2015.2509973","volume":"28","author":"S Khemmarat","year":"2016","unstructured":"Khemmarat, S., Gao, L.: Fast top-k path-based relevance query on massive graphs. IEEE Trans. Knowl. Data Eng. 28(5), 1189\u20131202 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"8","key":"819_CR17","first-page":"716","volume":"5","author":"Y Low","year":"2012","unstructured":"Low, Y., Gonzalez, J., Kyrola, A., Bickson, D., Guestrin, C., Hellerstein, J.M.: Distributed graphlab: A framework for machine learning in the cloud. PVLDB 5(8), 716\u2013727 (2012)","journal-title":"PVLDB"},{"issue":"5","key":"819_CR18","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/TMM.2010.2051360","volume":"12","author":"H Ma","year":"2010","unstructured":"Ma, H., Zhu, J., Lyu, M.R., King, I.: Bridging the semantic gap between image contents and tags. IEEE Trans. Multimedia 12(5), 462\u2013473 (2010)","journal-title":"IEEE Trans. Multimedia"},{"issue":"12","key":"819_CR19","first-page":"1023","volume":"7","author":"T Maehara","year":"2014","unstructured":"Maehara, T., Akiba, T., Iwata, Y., Kawarabayashi, K.: Computing personalized pagerank quickly by exploiting graph structures. PVLDB 7(12), 1023\u20131034 (2014)","journal-title":"PVLDB"},{"key":"819_CR20","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J.C., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: A system for large-scale graph processing. In: SIGMOD, pp. 135\u2013146 (2010)","DOI":"10.1145\/1807167.1807184"},{"issue":"6","key":"819_CR21","doi-asserted-by":"publisher","first-page":"471","DOI":"10.3390\/e20060471","volume":"20","author":"F Meng","year":"2018","unstructured":"Meng, F., Rui, X., Wang, Z., Xing, Y., Cao, L.: Coupled node similarity learning for community detection in attributed networks. Entropy 20(6), 471 (2018)","journal-title":"Entropy"},{"key":"819_CR22","doi-asserted-by":"crossref","unstructured":"Pan, J., Yang, H., Faloutsos, C., Duygulu, P.: Automatic multimedia cross-modal correlation discovery. In: SIGKDD, pp. 653\u2013658 (2004)","DOI":"10.1145\/1014052.1014135"},{"issue":"3","key":"819_CR23","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1016\/j.jpdc.2006.10.004","volume":"67","author":"E Plaku","year":"2007","unstructured":"Plaku, E., Kavraki, L.E.: Distributed computation of the k nn graph for large high-dimensional point sets. J. Parallel Distrib. Comput. 67(3), 346\u2013359 (2007)","journal-title":"J. Parallel Distrib. Comput."},{"key":"819_CR24","doi-asserted-by":"crossref","unstructured":"Sarkar, P., Moore, A.W.: Fast nearest-neighbor search in disk-resident graphs. In: SIGKDD, pp. 513\u2013522 (2010)","DOI":"10.1145\/1835804.1835871"},{"key":"819_CR25","unstructured":"Sarkar, P., Moore, A.W.: A tractable approach to finding closest truncated-commute-time neighbors in large graphs. arXiv:1206.5259(2012)"},{"key":"819_CR26","doi-asserted-by":"crossref","unstructured":"Shao, B., Wang, H., Li, Y.: Trinity: A distributed graph engine on a memory cloud. In: SIGMOD, pp. 505\u2013516 (2013)","DOI":"10.1145\/2463676.2467799"},{"key":"819_CR27","doi-asserted-by":"crossref","unstructured":"Shin, K., Jung, J., Sael, L., Kang, U.: Bear: Block elimination approach for random walk with restart on large graphs. In: SIGMOD, pp. 1571\u20131585 (2015)","DOI":"10.1145\/2723372.2723716"},{"issue":"3","key":"819_CR28","first-page":"193","volume":"7","author":"Y Tian","year":"2013","unstructured":"Tian, Y., Balmin, A., Corsten, S.A., Tatikonda, S., McPherson, J.: From \u201cthink like a vertex\u201d to \u201cthink like a graph\u201d. PVLDB 7(3), 193\u2013204 (2013)","journal-title":"PVLDB"},{"key":"819_CR29","doi-asserted-by":"crossref","unstructured":"Trad, M.R., Joly, A., Boujemaa, N.: Distributed k NN-graph approximation via hashing. In: ICMR, p. 43 (2012)","DOI":"10.1145\/2324796.2324847"},{"key":"819_CR30","doi-asserted-by":"crossref","unstructured":"Wu, Y., Jin, R., Zhang, X.: Fast and unified local search for random walk based k-nearest-neighbor query in large graphs. In: SIGMOD, pp. 1139\u20131150 (2014)","DOI":"10.1145\/2588555.2610500"},{"issue":"1","key":"819_CR31","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1109\/MIS.2016.4","volume":"31","author":"G Xu","year":"2016","unstructured":"Xu, G., Fu, B., Gu, Y.: Point-of-interest recommendations via a supervised random walk algorithm. IEEE Intell. Syst. 31(1), 15\u201323 (2016)","journal-title":"IEEE Intell. Syst."},{"issue":"3","key":"819_CR32","first-page":"30","volume":"7","author":"D Yang","year":"2016","unstructured":"Yang, D., Zhang, D., Qu, B.: Participatory cultural mapping based on collective behavior data in location-based social networks. ACM TIST 7(3), 30 (2016)","journal-title":"ACM TIST"},{"key":"819_CR33","unstructured":"Zaharia, M., Chowdhury, M., Das, T., Dave, A., Ma, J., McCauly, M., Franklin, M.J., Shenker, S., Stoica, I.: Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing. In: NSDI, pp. 15\u201328 (2012)"},{"key":"819_CR34","doi-asserted-by":"crossref","unstructured":"Zhang, C., Shou, L., Chen, K., Chen, G., Bei, Y.: Evaluating geo-social influence in location-based social networks. In: CIKM, pp. 1442\u20131451 (2012)","DOI":"10.1145\/2396761.2398450"},{"key":"819_CR35","unstructured":"Zhang, Q., Li, M., Deng, Y., Mahadevan, S.: Measure the similarity of nodes in the complex networks. arXiv:1502.00780 (2015)"},{"key":"819_CR36","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Huang, K., Geng, G., Liu, C.: Fast k NN graph construction with locality sensitive hashing. In: PKDD, pp. 660\u2013674 (2013)","DOI":"10.1007\/978-3-642-40991-2_42"},{"issue":"1","key":"819_CR37","first-page":"718","volume":"2","author":"Y Zhou","year":"2009","unstructured":"Zhou, Y., Cheng, H., Yu, J.X.: Graph clustering based on structural\/attribute similarities. PVLDB 2(1), 718\u2013729 (2009)","journal-title":"PVLDB"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-020-00819-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11280-020-00819-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-020-00819-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T23:55:50Z","timestamp":1623974150000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11280-020-00819-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,18]]},"references-count":37,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["819"],"URL":"https:\/\/doi.org\/10.1007\/s11280-020-00819-6","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,18]]},"assertion":[{"value":"1 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}