{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:32:05Z","timestamp":1725460325652},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642374494"},{"type":"electronic","value":"9783642374500"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37450-0_2","type":"book-chapter","created":{"date-parts":[[2013,4,17]],"date-time":"2013-04-17T05:41:52Z","timestamp":1366177312000},"page":"16-30","source":"Crossref","is-referenced-by-count":4,"title":["Fast SimRank Computation over Disk-Resident Graphs"],"prefix":"10.1007","author":[{"given":"Yinglong","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Cuiping","family":"Li","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Likun","family":"Sheng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"2_CR1","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1109\/TKDE.2007.1008","volume":"19","author":"D. Fogaras","year":"2007","unstructured":"Fogaras, D., R\u00e1cz, B.: Practical algorithms and lower bounds for similarity search in massive graphs. IEEE Trans. Knowl. Data Eng.\u00a019(5), 585\u2013598 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Simrank: a measure of structural-context similarity. In: KDD, pp. 538\u2013543 (2002)","DOI":"10.1145\/775047.775126"},{"key":"2_CR3","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. In: Proc.7th International World Wide Web Conference (1988)"},{"issue":"5","key":"2_CR4","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"J.M. Kleinberg","year":"1999","unstructured":"Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. Journal of the ACM\u00a046(5), 604\u2013632 (1999)","journal-title":"Journal of the ACM"},{"issue":"1","key":"2_CR5","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s00778-009-0168-8","volume":"19","author":"D. Lizorkin","year":"2010","unstructured":"Lizorkin, D., Velikhov, P., Grinev, M.N., Turdakov, D.: Accuracy estimate and optimization techniques for simrank computation. VLDB J.\u00a019(1), 45\u201366 (2010)","journal-title":"VLDB J."},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Li, C., Han, J., He, G., Jin, X., Sun, Y., Yu, Y., Wu, T.: Fast computation of simrank for static and dynamic information networks. In: EDBT, pp. 465\u2013476 (2010)","DOI":"10.1145\/1739041.1739098"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Li, P., Liu, H., Yu, J.X., He, J., Du, X.: Fast single-pair simrank computation. In: SDM, pp. 571\u2013582 (2010)","DOI":"10.1137\/1.9781611972801.50"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"He, G., Feng, H., Li, C., Chen, H.: Parallel simrank computation on large graphs with iterative aggregation. In: KDD, pp. 543\u2013552 (2010)","DOI":"10.1145\/1835804.1835874"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Zhao, P., Han, J., Sun, Y.: P-rank: a comprehensive structural similarity measure over information networks. In: CIKM, pp. 553\u2013562 (2009)","DOI":"10.1145\/1645953.1646025"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Scaling personalized web search. In: WWW, pp. 271\u2013279 (2003)","DOI":"10.1145\/775189.775191"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Xi, W., Fox, E.A., Fan, W., Zhang, B., Chen, Z., Yan, J., Zhuang, D.: Simfusion: measuring similarity using unified relationship matrix. In: SIGIR, pp. 130\u2013137 (2005)","DOI":"10.1145\/1076034.1076059"},{"issue":"3","key":"2_CR12","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s11280-010-0100-6","volume":"15","author":"W. Yu","year":"2012","unstructured":"Yu, W., Zhang, W., Lin, X., Zhang, Q., Le, J.: A space and time efficient algorithm for simrank computation. World Wide Web J.\u00a015(3), 327\u2013353 (2012)","journal-title":"World Wide Web J."},{"issue":"11","key":"2_CR13","first-page":"714","volume":"4","author":"L. Sun","year":"2011","unstructured":"Sun, L., Cheng, R., Li, X., Cheung, D.W., Han, J.: On link-based similarity join. PVLDB\u00a04(11), 714\u2013725 (2011)","journal-title":"PVLDB"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Lee, P., Lakshmanan, L.V.S., Yu, J.X.: On top-k structural similarity search. In: ICDE, pp. 774\u2013785 (2012)","DOI":"10.1109\/ICDE.2012.109"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Sarkar, P., Moore, A.W.: Fast nearest-neighbor search in disk-resident graphs. In: KDD, pp. 513\u2013522 (2010)","DOI":"10.1145\/1835804.1835871"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37450-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T10:50:18Z","timestamp":1557658218000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37450-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642374494","9783642374500"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37450-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}