{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:53:58Z","timestamp":1750308838502,"version":"3.41.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,5,29]],"date-time":"2017-05-29T00:00:00Z","timestamp":1496016000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004853","name":"Chinese University of Hong Kong","doi-asserted-by":"publisher","award":["Direct Grant 4055048"],"award-info":[{"award-number":["Direct Grant 4055048"]}],"id":[{"id":"10.13039\/501100004853","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s00778-017-0464-7","type":"journal-article","created":{"date-parts":[[2017,5,29]],"date-time":"2017-05-29T07:18:33Z","timestamp":1496042313000},"page":"563-583","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["I\/O-efficient algorithms for top-k nearest keyword search in massive graphs"],"prefix":"10.1007","volume":"26","author":[{"given":"Qiankun","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,29]]},"reference":[{"key":"464_CR1","doi-asserted-by":"crossref","unstructured":"Kolahdouzan, M.R., Shahabi, C.: Voronoi-based k nearest neighbor search for spatial network databases. In: VLDB, pp. 840\u2013851 (2004)","DOI":"10.1016\/B978-012088469-8.50074-7"},{"key":"464_CR2","doi-asserted-by":"crossref","unstructured":"Samet, H., Sankaranarayanan, J., Alborzi, H.: Scalable network distance browsing in spatial databases. In: SIGMOD, pp. 43\u201354 (2008)","DOI":"10.1145\/1376616.1376623"},{"issue":"8","key":"464_CR3","doi-asserted-by":"crossref","first-page":"1158","DOI":"10.1109\/TKDE.2010.75","volume":"22","author":"J Sankaranarayanan","year":"2010","unstructured":"Sankaranarayanan, J., Samet, H.: Query processing using distance oracles for spatial networks. IEEE Trans. Knowl. Data Eng. 22(8), 1158\u20131175 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"464_CR4","doi-asserted-by":"crossref","unstructured":"Bahmani, B., Goel, A.: Partitioned multi-indexing: bringing order to social search. In: WWW, pp. 399\u2013408 (2012)","DOI":"10.1145\/2187836.2187891"},{"issue":"10","key":"464_CR5","first-page":"901","volume":"6","author":"M Qiao","year":"2013","unstructured":"Qiao, M., Qin, L., Cheng, H., Yu, J.X., Tian, W.: Top-k nearest keyword search on large graphs. PVLDB 6(10), 901\u2013912 (2013)","journal-title":"PVLDB"},{"key":"464_CR6","doi-asserted-by":"crossref","unstructured":"Jiang, M., Fu, A., Wong, R.: Exact top-k nearest keyword search in large networks. In: SIGMOD, pp. 393\u2013404 (2015)","DOI":"10.1145\/2723372.2749447"},{"key":"464_CR7","doi-asserted-by":"crossref","unstructured":"Sibeyn, J.F., Abello, J., Meyer, U.: Heuristics for semi-external depth first search on directed graphs. In: SPAA, pp. 282\u2013292 (2002)","DOI":"10.1145\/564870.564917"},{"key":"464_CR8","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Qin, L., Yu, J.X.: Contract & expand: I\/O efficient sccs computing. In: ICDE, pp. 208\u2013219 (2014)","DOI":"10.1109\/ICDE.2014.6816652"},{"key":"464_CR9","first-page":"31","volume":"12","author":"A Kyrola","year":"2012","unstructured":"Kyrola, A., Blelloch, G., Guestrin, C.: GraphChi: large-scale graph computation on just a PC. OSDI 12, 31\u201346 (2012)","journal-title":"OSDI"},{"key":"464_CR10","unstructured":"Zhu, X., Han, W., Chen, W.: GridGraph: large-scale graph processing on a single machine using 2-level hierarchical partitioning. In: USENIX Annual Technical Conference, pp. 375\u2013386 (2015)"},{"key":"464_CR11","doi-asserted-by":"crossref","unstructured":"Roy, A., Bindschaedler, L., Malicevic, J., Zwaenepoel, W.: Chaos: Scale-out graph processing from secondary storage. In: SOSP, pp. 410\u2013424 (2015)","DOI":"10.1145\/2815400.2815408"},{"key":"464_CR12","doi-asserted-by":"crossref","unstructured":"Maheshwari, A., Zeh, N.: A survey of techniques for designing I\/O-efficient algorithms. In: Algorithms for Memory Hierarchies, pp. 36\u201361. Springer, Berlin (2003)","DOI":"10.1007\/3-540-36574-5_3"},{"key":"464_CR13","doi-asserted-by":"crossref","unstructured":"Hutchinson, D.A., Maheshwari, A., Zeh, N.: An external memory data structure for shortest path queries. In: COCOON, pp. 51\u201360 (1999)","DOI":"10.1007\/3-540-48686-0_5"},{"key":"464_CR14","doi-asserted-by":"crossref","unstructured":"Hu, X., Tao, Y., Chung, C.: Massive graph triangulation. In: SIGMOD, pp. 325\u2013336 (2013)","DOI":"10.1145\/2463676.2463704"},{"key":"464_CR15","doi-asserted-by":"crossref","unstructured":"Chu, S., Cheng, J.: Triangle listing in massive networks and its applications. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, CA, USA, 21\u201324 August 2011, pp. 672\u2013680 (2011)","DOI":"10.1145\/2020408.2020513"},{"key":"464_CR16","doi-asserted-by":"crossref","unstructured":"Tao, Y., Papadopoulos, S., Sheng, C., Stefanidis, K.: Nearest keyword search in xml documents. In: SIGMOD, pp. 589\u2013600 (2011)","DOI":"10.1145\/1989323.1989385"},{"key":"464_CR17","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Farach-colton, M.: The LCA problem revisited. In: Gonnet, G.H., Viola, A. (eds.) In Latin American Theoretical Informatics, pp. 88\u201394. Springer, Berlin (2000)","DOI":"10.1007\/10719839_9"},{"key":"464_CR18","unstructured":"Michalis, P., Bonchi, F., Castillo, C., Gionis, A.: Fast shortest path distance estimation in large networks. In: CIKM, pp. 867\u2013876 (2009)"},{"key":"464_CR19","unstructured":"Jon, K., Slivkins, A., Wexler, T.: Triangulation and embedding using small sets of beacons. In: IEEE Symposium on Foundations of Computer Science, pp. 444\u2013453 (2004)"},{"key":"464_CR20","doi-asserted-by":"crossref","unstructured":"Vieira, M.V., Fonseca, B.M., Damazio, R., Golgher, P.B., Reis, D.D.C., Ribeiro-Neto, B.: Efficient search ranking in social networks. In: CIKM, pp. 563\u2013572 (2007)","DOI":"10.1145\/1321440.1321520"},{"issue":"1","key":"464_CR21","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"464_CR22","doi-asserted-by":"crossref","unstructured":"Sarma, A.D., Gollapudi, S., Najork, M., Panigrahy, R.: A sketch-based distance oracle for web-scale graphs. In: WSDM, pp. 401\u2013410 (2010)","DOI":"10.1145\/1718487.1718537"},{"issue":"1","key":"464_CR23","doi-asserted-by":"crossref","first-page":"72","DOI":"10.2307\/1412159","volume":"15","author":"C Spearman","year":"1904","unstructured":"Spearman, C.: The proof and measurement of association between two things. Am. J. Psychol. 15(1), 72\u2013101 (1904)","journal-title":"Am. J. Psychol."},{"key":"464_CR24","doi-asserted-by":"crossref","unstructured":"Hristidis, V., Papakonstantinou, Y.: Discover: keyword search in relational databases. In: VLDB, pp. 670\u2013681 (2002)","DOI":"10.1016\/B978-155860869-6\/50065-2"},{"key":"464_CR25","doi-asserted-by":"crossref","unstructured":"Bhalotia, G., Hulgeri, A., Nakhe, C., Chakrabarti, S., Sudarshan, S.: Keyword searching and browsing in databases using banks. In: ICDE, pp. 431\u2013440 (2002)","DOI":"10.1109\/ICDE.2002.994756"},{"key":"464_CR26","doi-asserted-by":"crossref","unstructured":"Golenberg, K., Kimelfeld, B., Sagiv, Y.: Keyword proximity search in complex data graphs. In: SIGMOD, pp. 927\u2013940 (2008)","DOI":"10.1145\/1376616.1376708"},{"key":"464_CR27","doi-asserted-by":"crossref","unstructured":"Li, G., Ooi, B.C., Feng, J., Wang, J., Zhou, L.: Ease: efficient and adaptive keyword search on unstructured, semi-structured and structured data. In: SIGMOD, pp. 903\u2013914 (2008)","DOI":"10.1145\/1376616.1376706"},{"key":"464_CR28","doi-asserted-by":"crossref","unstructured":"Qin, L., Yu, J.X., Chang, L., Tao, Y.: Querying communities in relational databases. In: ICDE, pp. 724\u2013735 (2009)","DOI":"10.1109\/ICDE.2009.67"},{"issue":"10","key":"464_CR29","first-page":"681","volume":"4","author":"M Kargar","year":"2011","unstructured":"Kargar, M., An, A.: Keyword search in graphs: finding r-cliques. PVLDB 4(10), 681\u2013692 (2011)","journal-title":"PVLDB"},{"issue":"1","key":"464_CR30","first-page":"67","volume":"33","author":"JX Yu","year":"2010","unstructured":"Yu, J.X., Qin, L., Chang, L.: Keyword search in relational databases: a survey. IEEE Data Eng. Bull. 33(1), 67\u201378 (2010)","journal-title":"IEEE Data Eng. Bull."},{"key":"464_CR31","doi-asserted-by":"crossref","unstructured":"Yao, B., Tang, M., Li, F.: Multi-approximate-keyword routing in gis data. In: GIS, pp. 201\u2013210 (2011)","DOI":"10.1145\/2093973.2094001"},{"issue":"11","key":"464_CR32","first-page":"1136","volume":"5","author":"X Cao","year":"2012","unstructured":"Cao, X., Chen, L., Cong, G., Xiao, X.: Keyword-aware optimal route search. PVLDB 5(11), 1136\u20131147 (2012)","journal-title":"Keyword-aware optimal route search. PVLDB"},{"key":"464_CR33","doi-asserted-by":"crossref","unstructured":"Tao, Y.: A dynamic I\/O-efficient structure for one-dimensional top-k range reporting. In: Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS\u201914, Snowbird, UT, USA, 22\u201327 June 2014, pp. 256\u2013265 (2014)","DOI":"10.1145\/2594538.2594543"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-017-0464-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-017-0464-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-017-0464-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:47:59Z","timestamp":1750279679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-017-0464-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,29]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["464"],"URL":"https:\/\/doi.org\/10.1007\/s00778-017-0464-7","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"type":"print","value":"1066-8888"},{"type":"electronic","value":"0949-877X"}],"subject":[],"published":{"date-parts":[[2017,5,29]]}}}