{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T23:40:02Z","timestamp":1748562002810,"version":"3.41.0"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319228488"},{"type":"electronic","value":"9783319228495"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-22849-5_32","type":"book-chapter","created":{"date-parts":[[2015,8,10]],"date-time":"2015-08-10T12:07:51Z","timestamp":1439208471000},"page":"471-480","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["TopCom: Index for Shortest Distance Query in Directed Graph"],"prefix":"10.1007","author":[{"given":"Vachik S.","family":"Dave","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad Al","family":"Hasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,11]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Akiba, T., Iwata, Y., Yoshida, Y.: Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In: ACM SIGMOD, pp. 349\u2013360 (2013)","DOI":"10.1145\/2463676.2465315"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Backstrom, L., Huttenlocher, D., Kleinberg, J., Lan, X.: Group formation in large social networks: membership, growth, and evolution. In: SIGMOD, pp. 44\u201354 (2006)","DOI":"10.1145\/1150402.1150412"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Cheng, J., Huang, S., Wu, H., Fu, A.W.C.: TF-Label: a topological-folding labeling scheme for reachability querying in a large graph. In: SIGMOD, pp. 193\u2013204 (2013)","DOI":"10.1145\/2463676.2465286"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. In: SODA, pp. 937\u2013946 (2002)","DOI":"10.1137\/S0097539702403098"},{"key":"32_CR5","first-page":"457","volume":"6","author":"AWC Fu","year":"2013","unstructured":"Fu, A.W.C., Wu, H., Cheng, J., Wong, R.C.W.: IS-Label: an independent-set based labeling scheme for point-to-point distance querying. VLDB 6, 457\u2013468 (2013)","journal-title":"VLDB"},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-1-4419-8462-3_9","volume-title":"Social Network Data Analytics","author":"M Hasan","year":"2011","unstructured":"Hasan, M., Zaki, M.: A survey of link prediction in social networks. In: Aggarwal, C.C. (ed.) Social Network Data Analytics, pp. 243\u2013275. Springer, US (2011)"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Jin, R., Ruan, N., Xiang, Y., Lee, V.: A highway-centric labeling approach for answering distance queries on large sparse graphs. In: SIGMOD, pp. 445\u2013456 (2012)","DOI":"10.1145\/2213836.2213887"},{"issue":"10","key":"32_CR8","doi-asserted-by":"publisher","first-page":"681","DOI":"10.14778\/2021017.2021025","volume":"4","author":"M Kargar","year":"2011","unstructured":"Kargar, M., An, A.: Keyword search in graphs: Finding r-cliques. Proc. VLDB Endow. 4(10), 681\u2013692 (2011)","journal-title":"Proc. VLDB Endow."},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Massa, P., Avesani, P.: Trust-aware bootstrapping of recommender systems. In: ECAI Workshop on Recommender Systems, pp. 29\u201333 (2006)","DOI":"10.1145\/1297231.1297235"},{"key":"32_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-540-69311-6_21","volume-title":"Frontiers in Algorithmics","author":"K Okamoto","year":"2008","unstructured":"Okamoto, K., Chen, W., Li, X.-Y.: Ranking of closeness centrality for large-scale social networks. In: Preparata, F.P., Wu, X., Yin, J. (eds.) FAW 2008. LNCS, vol. 5059, pp. 186\u2013195. Springer, Heidelberg (2008)"},{"issue":"1","key":"32_CR11","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1109\/TKDE.2012.253","volume":"26","author":"M Qiao","year":"2014","unstructured":"Qiao, M., Cheng, H., Chang, L., Yu, J.: Approximate shortest distance computing: a query-dependent local landmark scheme. IEEE Trans. Knowl. Data Eng. 26(1), 55\u201368 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"5","key":"32_CR12","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/s00778-013-0338-6","volume":"23","author":"Y Xiang","year":"2014","unstructured":"Xiang, Y.: Answering exact distance queries on real-world graphs with bounded performance guarantees. VLDB J. 23(5), 677\u2013695 (2014)","journal-title":"VLDB J."},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Yan, D., Cheng, J., Ng, W., Liu, S.: Finding distance-preserving subgraphs in large road networks. In: ICDE, pp. 625\u2013636 (2013)","DOI":"10.1109\/ICDE.2013.6544861"},{"issue":"4","key":"32_CR14","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s00778-011-0256-4","volume":"21","author":"H Yildirim","year":"2012","unstructured":"Yildirim, H., Chaoji, V., Zaki, M.: Grail: a scalable index for reachability queries in very large graphs. VLDB J. 21(4), 509\u2013534 (2012)","journal-title":"VLDB J."}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22849-5_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T23:08:34Z","timestamp":1748560114000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22849-5_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319228488","9783319228495"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22849-5_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"11 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}