{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T13:36:51Z","timestamp":1761917811526},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2015,1,29]],"date-time":"2015-01-29T00:00:00Z","timestamp":1422489600000},"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":["The VLDB Journal"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s00778-014-0376-8","type":"journal-article","created":{"date-parts":[[2015,1,28]],"date-time":"2015-01-28T10:23:50Z","timestamp":1422440630000},"page":"655-679","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Scheduled approximation for Personalized PageRank with Utility-based Hub Selection"],"prefix":"10.1007","volume":"24","author":[{"given":"Fanwei","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin Chen-Chuan","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Ying","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,1,29]]},"reference":[{"key":"376_CR1","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chung, F., Lang, K.: Local graph partitioning using pagerank vectors. In: FOCS, pp. 475\u2013486 (2006)","DOI":"10.1109\/FOCS.2006.44"},{"key":"376_CR2","doi-asserted-by":"crossref","unstructured":"Baeza-Yates, R., Tiberi, A.: Extracting semantic relations from query logs. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 76\u201385 (2007)","DOI":"10.1145\/1281192.1281204"},{"key":"376_CR3","doi-asserted-by":"crossref","unstructured":"Bahmani, B., Chakrabarti, K., Xin, D.: Fast personalized PageRank on MapReduce. In: SIGMOD, pp. 973\u2013984 (2011)","DOI":"10.1145\/1989323.1989425"},{"key":"376_CR4","doi-asserted-by":"crossref","unstructured":"Bahmani, B., Chowdhury, A., Goel, A.: Fast incremental and personalized PageRank. In: VLDB, pp. 173\u2013184 (2010)","DOI":"10.14778\/1929861.1929864"},{"key":"376_CR5","doi-asserted-by":"crossref","unstructured":"Balmin, A., Hristidis, V., Papakonstantinou, Y.: ObjectRank: authority-based keyword search in databases. VLDB 30, 564\u2013575 (2004)","DOI":"10.1016\/B978-012088469-8.50051-6"},{"issue":"1","key":"376_CR6","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1080\/15427951.2006.10129116","volume":"3","author":"P Berkhin","year":"2006","unstructured":"Berkhin, P.: Bookmark-coloring algorithm for personalized pagerank computing. Internet Math. 3(1), 41\u201362 (2006)","journal-title":"Internet Math."},{"key":"376_CR7","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: The webgraph framework I: compression techniques. In: WWW, pp. 595\u2013602 (2004)","DOI":"10.1145\/988672.988752"},{"key":"376_CR8","doi-asserted-by":"crossref","unstructured":"Brandes, U., Gaertler, M., Wagner, D.: Experiments on graph clustering algorithms. In: In 11th European Symposium on Algorithms, pp. 568\u2013579. Springer (2003)","DOI":"10.1007\/978-3-540-39658-1_52"},{"key":"376_CR9","doi-asserted-by":"crossref","unstructured":"Brinkmeier, M., Werner, J., Recknagel, S.: Communities in graphs and hypergraphs. In: Proceedings of the Sixteenth ACM Conference on Conference on Information and Knowledge Management, CIKM \u201907, pp. 869\u2013872, New York, NY, USA. ACM (2007)","DOI":"10.1145\/1321440.1321563"},{"key":"376_CR10","doi-asserted-by":"crossref","unstructured":"Chakrabarti, S.: Dynamic personalized pagerank in entity-relation graphs. In: WWW, pp. 571\u2013580 (2007)","DOI":"10.1145\/1242572.1242650"},{"key":"376_CR11","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/s00778-010-0204-8","volume":"20","author":"S Chakrabarti","year":"2010","unstructured":"Chakrabarti, S., Pathak, A., Gupta, M.: Index design and query processing for graph conductance search. VLDBJ 20, 445\u2013470 (2010)","journal-title":"VLDBJ"},{"issue":"3","key":"376_CR12","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1080\/15427951.2005.10129104","volume":"2","author":"D Fogaras","year":"2005","unstructured":"Fogaras, D., R\u00e1cz, B., Csalog\u00e1ny, K., Sarl\u00f3s, T.: Towards scaling fully personalized pagerank: algorithms, lower bounds, and experiments. Internet Math. 2(3), 333\u2013358 (2005)","journal-title":"Internet Math."},{"key":"376_CR13","doi-asserted-by":"crossref","unstructured":"Fujiwara, Y., Nakatsuji, M., Yamamuro, T., Shiokawa, H., Onizuka, M.: Efficient personalized pagerank with accuracy assurance. In: SIGKDD, pp. 15\u201323 (2012)","DOI":"10.1145\/2339530.2339538"},{"key":"376_CR14","doi-asserted-by":"crossref","unstructured":"Gupta, M., Pathak, A., Chakrabarti, S.: Fast algorithms for top- $$k$$ k personalized pagerank queries. In: WWW, pp. 1225\u20131226 (2008)","DOI":"10.1145\/1367497.1367738"},{"key":"376_CR15","doi-asserted-by":"crossref","unstructured":"Haveliwala, T.H.: Topic-sensitive PageRank: a context-sensitive ranking algorithm for web search. TKDE 15(4), 784\u2013796 (2003)","DOI":"10.1109\/TKDE.2003.1208999"},{"key":"376_CR16","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Scaling personalized web search. In: WWW, pp. 271\u2013279 (2003)","DOI":"10.1145\/775152.775191"},{"key":"376_CR17","unstructured":"Kamvar, S., Haveliwala, T., Manning, C., Golub, G.: Exploiting the block structure of the web for computing PageRank. Technical report, Stanford University (2003)"},{"issue":"1","key":"376_CR18","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functionsi. Math. Program. 14(1), 265\u2013294 (1978)","journal-title":"Math. Program."},{"key":"376_CR19","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: bringing order to the web. Technical report, Stanford University (1999)"},{"key":"376_CR20","volume-title":"Probability, Random Variables, and Stochastic Processes","author":"A Papoulis","year":"1965","unstructured":"Papoulis, A., Pillai, S., Unnikrishna, S.: Probability, Random Variables, and Stochastic Processes. McGraw-Hill, New York (1965)"},{"key":"376_CR21","doi-asserted-by":"crossref","unstructured":"Pathak, A., Chakrabarti, S., Gupta, M.: Index design for dynamic personalized pagerank. In: ICDE, pp. 1489\u20131491 (2008)","DOI":"10.1109\/ICDE.2008.4497599"},{"key":"376_CR22","unstructured":"Randall, K.H., Stata, R., Wickremesinghe, R.G., Wiener, J.L.: The link database: fast access to graphs of the web. In: DCC, pp. 122\u2013131 (2002)"},{"key":"376_CR23","unstructured":"Richardson, M., Domingos, P.: The intelligent surfer: probabilistic combination of link and content information in pagerank. In: NIPS, pp. 1441\u20131448 (2002)"},{"key":"376_CR24","doi-asserted-by":"crossref","unstructured":"Sarkar, P., Moore, A.: Fast nearest-neighbor search in disk-resident graphs. In: SIGKDD, pp. 513\u2013522 (2010)","DOI":"10.1145\/1835804.1835871"},{"issue":"1","key":"376_CR25","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1145\/331403.331405","volume":"33","author":"C Silverstein","year":"1999","unstructured":"Silverstein, C., Marais, H., Henzinger, M., Moricz, M.: Analysis of a very large web search engine query log. SIGIR Forum 33(1), 6\u201312 (1999)","journal-title":"SIGIR Forum"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-014-0376-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-014-0376-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-014-0376-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T05:52:52Z","timestamp":1566280372000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-014-0376-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,29]]},"references-count":25,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["376"],"URL":"https:\/\/doi.org\/10.1007\/s00778-014-0376-8","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,29]]}}}