{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T12:12:35Z","timestamp":1771330355920,"version":"3.50.1"},"reference-count":41,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1109\/icde.2013.6544858","type":"proceedings-article","created":{"date-parts":[[2013,6,26]],"date-time":"2013-06-26T19:02:52Z","timestamp":1372273372000},"page":"589-600","source":"Crossref","is-referenced-by-count":53,"title":["Efficient search algorithm for SimRank"],"prefix":"10.1109","author":[{"given":"Y.","family":"Fujiwara","sequence":"first","affiliation":[]},{"given":"M.","family":"Nakatsuji","sequence":"additional","affiliation":[]},{"given":"H.","family":"Shiokawa","sequence":"additional","affiliation":[]},{"given":"M.","family":"Onizuka","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","first-page":"9","article-title":"Link-Based Similarity Search to Fight Web Spam","author":"benczu?r","year":"2006","journal-title":"AIRWeb"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972801.50"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775126"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835874"},{"key":"18","author":"page","year":"1999","journal-title":"The PageRank Citation Ranking Bringing Order to the Web"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00672-2_40"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140441"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060839"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339538"},{"key":"39","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.109"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453903"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012088469-8\/50051-6"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1145\/361573.361582"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20847-8_4"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1007\/BF01731936"},{"key":"12","article-title":"PathSim: Meta Path-based Top-k Similarity Search in Heterogeneous Information Networks","volume":"4","author":"sun","year":"2011","journal-title":"PVLDB"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956972"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88192-6_75"},{"key":"41","author":"newman","year":"2006","journal-title":"The Structure and Dynamics of Networks"},{"key":"40","author":"stoll","year":"2008","journal-title":"A Krylov-Schur Approach to the Truncated SVD"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/APWeb.2010.47"},{"key":"23","first-page":"389","article-title":"Exploiting the Block Structure of Link graph for Efficient Similarity Computation","author":"li","year":"2009","journal-title":"PAKDD"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1109\/APWeb.2010.42"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739098"},{"key":"26","author":"harville","year":"2008","journal-title":"Matrix Algebra from a Statistician's Perspective"},{"key":"27","author":"press","year":"2007","journal-title":"Numerical Recipes 2nd Edition"},{"key":"28","article-title":"Factorized Solution of Sylvester Equations with Applications in Control","author":"benner","year":"2004","journal-title":"NTNS"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511817106"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066273"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767910"},{"key":"10","first-page":"607","article-title":"Recommendations over Domain Specific User Graphs","author":"nakatsuji","year":"2010","journal-title":"ECAI"},{"key":"1","first-page":"938","article-title":"Graph Indexing: Tree + Delta >= Graph","author":"zhao","year":"2007","journal-title":"VLDB"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1145\/1135777.1135794"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20149-3_24"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497459"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1145\/1454586.1454603"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767883"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1177\/0165551506062337"},{"key":"4","first-page":"913","article-title":"Fast Graph pattern Matching","author":"cheng","year":"2008","journal-title":"ICDE"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516425"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0168-8"}],"event":{"name":"2013 29th IEEE International Conference on Data Engineering (ICDE 2013)","location":"Brisbane, QLD","start":{"date-parts":[[2013,4,8]]},"end":{"date-parts":[[2013,4,12]]}},"container-title":["2013 IEEE 29th International Conference on Data Engineering (ICDE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6530811\/6544790\/06544858.pdf?arnumber=6544858","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T19:09:37Z","timestamp":1490209777000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6544858\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1109\/icde.2013.6544858","relation":{},"subject":[],"published":{"date-parts":[[2013,4]]}}}