{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:14:01Z","timestamp":1742926441688,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030594183"},{"type":"electronic","value":"9783030594190"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-59419-0_15","type":"book-chapter","created":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T16:57:43Z","timestamp":1600707463000},"page":"237-254","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Approximate Algorithm for Single-Source Discounted Hitting Time Query"],"prefix":"10.1007","author":[{"given":"Kaixin","family":"Liu","sequence":"first","affiliation":[]},{"given":"Yong","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Chunxiao","family":"Xing","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,22]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8462-3","volume-title":"Social Network Data Analytics","year":"2011","unstructured":"Aggarwal, C.C. (ed.): Social Network Data Analytics. Springer, Boston (2011). https:\/\/doi.org\/10.1007\/978-1-4419-8462-3"},{"unstructured":"Aldous, D., Fill, J.: Reversible Markov chains and random walks on graphs (1995)","key":"15_CR2"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-540-77004-6_12","volume-title":"Algorithms and Models for the Web-Graph","author":"R Andersen","year":"2007","unstructured":"Andersen, R., Borgs, C., Chayes, J., Hopcraft, J., Mirrokni, V.S., Teng, S.-H.: Local computation of PageRank contributions. In: Bonato, A., Chung, F.R.K. (eds.) WAW 2007. LNCS, vol. 4863, pp. 150\u2013165. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77004-6_12"},{"doi-asserted-by":"crossref","unstructured":"Andersen, R., Chung, F.R.K., Lang, K.J.: Local graph partitioning using PageRank vectors. In: FOCS, pp. 475\u2013486 (2006)","key":"15_CR4","DOI":"10.1109\/FOCS.2006.44"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-21286-4_5","volume-title":"Algorithms and Models for the Web Graph","author":"K Avrachenkov","year":"2011","unstructured":"Avrachenkov, K., Litvak, N., Nemirovsky, D., Smirnova, E., Sokol, M.: Quick detection of top-k personalized PageRank lists. In: Frieze, A., Horn, P., Pra\u0142at, P. (eds.) WAW 2011. LNCS, vol. 6732, pp. 50\u201361. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21286-4_5"},{"doi-asserted-by":"crossref","unstructured":"Brand, M.: A random walks perspective on maximizing satisfaction and profit. In: SDM, pp. 12\u201319 (2005)","key":"15_CR6","DOI":"10.1137\/1.9781611972757.2"},{"unstructured":"Chen, M., Liu, J., Tang, X.: Clustering via random walk hitting time on directed graphs. In: AAAI, vol. 8, pp. 616\u2013621 (2008)","key":"15_CR7"},{"issue":"1","key":"15_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1080\/15427951.2006.10129115","volume":"3","author":"FRK Chung","year":"2006","unstructured":"Chung, F.R.K., Lu, L.: Concentration inequalities and martingale inequalities: a survey. Internet Math. 3(1), 79\u2013127 (2006)","journal-title":"Internet Math."},{"issue":"3","key":"15_CR9","doi-asserted-by":"publisher","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."},{"doi-asserted-by":"crossref","unstructured":"Guan, Z., Wu, J., Zhang, Q., Singh, A.K., Yan, X.: Assessing and ranking structural correlations in graphs. In: SIGMOD, pp. 937\u2013948 (2011)","key":"15_CR10","DOI":"10.1145\/1989323.1989421"},{"doi-asserted-by":"crossref","unstructured":"Gupta, M.S., Pathak, A., Chakrabarti, S.: Fast algorithms for topk personalized PageRank queries. In: WWW, pp. 1225\u20131226 (2008)","key":"15_CR11","DOI":"10.1145\/1367497.1367738"},{"issue":"1","key":"15_CR12","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L Katz","year":"1953","unstructured":"Katz, L.: A new status index derived from sociometric analysis. Psychometrika 18(1), 39\u201343 (1953)","journal-title":"Psychometrika"},{"issue":"7","key":"15_CR13","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D Liben-Nowell","year":"2007","unstructured":"Liben-Nowell, D., Kleinberg, J.: The link-prediction problem for social networks. J. Am. Soc. Inform. Sci. Technol. 58(7), 1019\u20131031 (2007)","journal-title":"J. Am. Soc. Inform. Sci. Technol."},{"doi-asserted-by":"crossref","unstructured":"Lofgren, P., Banerjee, S., Goel, A.: Personalized PageRank estimation and search: a bidirectional approach. In: WSDM, pp. 163\u2013172 (2016)","key":"15_CR14","DOI":"10.1145\/2835776.2835823"},{"doi-asserted-by":"crossref","unstructured":"Lofgren, P., Banerjee, S., Goel, A., Comandur, S.: FAST-PPR: scaling personalized PageRank estimation for large graphs. In: ACM SIGKDD, pp. 1436\u20131445 (2014)","key":"15_CR15","DOI":"10.1145\/2623330.2623745"},{"doi-asserted-by":"crossref","unstructured":"Mei, Q., Zhou, D., Church, K.: Query suggestion using hitting time. In: CIKM, pp. 469\u2013478 (2008)","key":"15_CR16","DOI":"10.1145\/1458082.1458145"},{"unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: bringing order to the web. Technical report, Stanford InfoLab (1999)","key":"15_CR17"},{"unstructured":"Sarkar, P., Moore, A.W.: A tractable approach to finding closest truncated-commute-time neighbors in large graphs. In: UAI, pp. 335\u2013343 (2007)","key":"15_CR18"},{"doi-asserted-by":"crossref","unstructured":"Sarkar, P., Moore, A.W.: Fast nearest-neighbor search in disk-resident graphs. In: ACM SIGKDD, pp. 513\u2013522 (2010)","key":"15_CR19","DOI":"10.1145\/1835804.1835871"},{"doi-asserted-by":"crossref","unstructured":"Sarkar, P., Moore, A.W., Prakash, A.: Fast incremental proximity search in large graphs. In: ICML, pp. 896\u2013903 (2008)","key":"15_CR20","DOI":"10.1145\/1390156.1390269"},{"issue":"6","key":"15_CR21","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1007\/s00778-019-00576-7","volume":"28","author":"R Wang","year":"2019","unstructured":"Wang, R., Wang, S., Zhou, X.: Parallelizing approximate single-source personalized PageRank queries on shared memory. VLDB J. 28(6), 923\u2013940 (2019). https:\/\/doi.org\/10.1007\/s00778-019-00576-7","journal-title":"VLDB J."},{"issue":"3","key":"15_CR22","first-page":"205","volume":"10","author":"S Wang","year":"2016","unstructured":"Wang, S., Tang, Y., Xiao, X., Yang, Y., Li, Z.: HubPPR: effective indexing for approximate personalized PageRank. PVLDB 10(3), 205\u2013216 (2016)","journal-title":"PVLDB"},{"issue":"4","key":"15_CR23","doi-asserted-by":"publisher","first-page":"18:1","DOI":"10.1145\/3360902","volume":"44","author":"S Wang","year":"2019","unstructured":"Wang, S., et al.: Efficient algorithms for approximate single-source personalized PageRank queries. ACM Trans. Database Syst. 44(4), 18:1\u201318:37 (2019)","journal-title":"ACM Trans. Database Syst."},{"doi-asserted-by":"crossref","unstructured":"Wang, S., Yang, R., Xiao, X., Wei, Z., Yang, Y.: FORA: simple and effective approximate single-source personalized PageRank. In: ACM SIGKDD, pp. 505\u2013514 (2017)","key":"15_CR24","DOI":"10.1145\/3097983.3098072"},{"doi-asserted-by":"crossref","unstructured":"Wei, Z., et al.: PRSim: sublinear time SimRank computation on large power-law graphs. In: SIGMOD, pp. 1042\u20131059. ACM (2019)","key":"15_CR25","DOI":"10.1145\/3299869.3319873"},{"doi-asserted-by":"crossref","unstructured":"Wei, Z., He, X., Xiao, X., Wang, S., Shang, S., Wen, J.: TopPPR: top-k personalized PageRank queries with precision guarantees on large graphs. In: SIGMOD, pp. 441\u2013456 (2018)","key":"15_CR26","DOI":"10.1145\/3183713.3196920"},{"issue":"7","key":"15_CR27","first-page":"798","volume":"8","author":"Y Wu","year":"2015","unstructured":"Wu, Y., Jin, R., Li, J., Zhang, X.: Robust local community detection: on free rider effect and its elimination. PVLDB 8(7), 798\u2013809 (2015)","journal-title":"PVLDB"},{"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)","key":"15_CR28","DOI":"10.1145\/2588555.2610500"},{"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)","key":"15_CR29","DOI":"10.1145\/2396761.2398450"},{"doi-asserted-by":"crossref","unstructured":"Zhang, W., Cheng, R., Kao, B.: Evaluating multi-way joins over discounted hitting time. In: ICDE, pp. 724\u2013735 (2014)","key":"15_CR30","DOI":"10.1109\/ICDE.2014.6816695"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59419-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:52:34Z","timestamp":1710265954000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-59419-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030594183","9783030594190"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59419-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jeju","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/db.pknu.ac.kr\/dasfaa2020\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"487","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":"119","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":"23","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":"24% - 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.11","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":"6.81","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15 demo papers and 4 industrial papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}