{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T10:21:35Z","timestamp":1725618095988},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642247033"},{"type":"electronic","value":"9783642247040"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24704-0_15","type":"book-chapter","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T01:11:06Z","timestamp":1317863466000},"page":"98-112","source":"Crossref","is-referenced-by-count":0,"title":["Context-Aware Nearest Neighbor Query on Social Networks"],"prefix":"10.1007","author":[{"given":"Yazhe","family":"Wang","sequence":"first","affiliation":[]},{"given":"Baihua","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/S0097539794261295","volume":"28","author":"E. Cohen","year":"1999","unstructured":"Cohen, E.: Fast algorithms for constructing t-spanners and paths with stretch t. SIAM J. Comput.\u00a028, 210\u2013236 (1999)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"15_CR2","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik\u00a01(1), 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"issue":"3","key":"15_CR3","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1002\/1097-0037(200010)36:3<156::AID-NET2>3.0.CO;2-L","volume":"36","author":"M. Erwig","year":"2000","unstructured":"Erwig, M.: The graph Voronoi diagram with applications. Networks\u00a036(3), 156\u2013163 (2000)","journal-title":"Networks"},{"issue":"1","key":"15_CR4","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.jalgor.2004.05.002","volume":"53","author":"C. Gaboille","year":"2004","unstructured":"Gaboille, C., Peleg, D., P\u00e9rennes, S., Raz, R.: Distance labeling in graphs. Journal of Algorithms\u00a053(1), 85\u2013112 (2004)","journal-title":"Journal of Algorithms"},{"key":"15_CR5","unstructured":"Goldberg, A.V., Harrelson, C.: Computing the shortest path: A search meets graph theory. In: SODA, pp. 156\u2013165 (2005)"},{"key":"15_CR6","unstructured":"Gutman, R.: Reach-based routing: A new approach to shortest path algorithms optimized for road networks. In: ALENEX, pp. 100\u2013111 (2004)"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"He, H., Wang, H., Yang, J., Yu, P.S.: Blinks: ranked keyword searches on graphs. In: SIGMOD, pp. 305\u2013316 (2007)","DOI":"10.1145\/1247480.1247516"},{"key":"15_CR8","unstructured":"Hu, H., Lee, D.L., Lee, V.C.S.: Distance indexing on road networks. In: VLDB, pp. 894\u2013905 (2006)"},{"key":"15_CR9","unstructured":"Hulgeri, A., Nakhe, C.: Keyword searching and browsing in databases using banks. In: ICDE, pp. 431\u2013443 (2002)"},{"issue":"3","key":"15_CR10","first-page":"409","volume":"10","author":"N. Jing","year":"1998","unstructured":"Jing, N., Huang, Y.-W., Rundensteiner, E.A.: Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation. TKDE\u00a010(3), 409\u2013432 (1998)","journal-title":"TKDE"},{"issue":"5","key":"15_CR11","first-page":"1029","volume":"14","author":"S. Jung","year":"2002","unstructured":"Jung, S., Pramanik, S.: An efficient path computation model for hierarchically structured topographical road maps. TKDE\u00a014(5), 1029\u20131046 (2002)","journal-title":"TKDE"},{"key":"15_CR12","unstructured":"Kacholia, V., Pandit, S., Chakrabarti, S., Sudarshan, S., Desai, R., Karambelkar, H.: Bidirectional expansion for keyword search on graph databases. In: VLDB, pp. 505\u2013516 (2005)"},{"issue":"2","key":"15_CR13","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/65935.65937","volume":"7","author":"D. Lee","year":"1989","unstructured":"Lee, D., Leng, C.: Partitioned signature file: Design considerations and performance evaluation. TOIS\u00a07(2), 158\u2013180 (1989)","journal-title":"TOIS"},{"issue":"3","key":"15_CR14","first-page":"423","volume":"7","author":"D.L. Lee","year":"1995","unstructured":"Lee, D.L., Kim, Y.M., Patel, G.: Efficient signature file methods for text retrieval. TKDE\u00a07(3), 423\u2013435 (1995)","journal-title":"TKDE"},{"issue":"2","key":"15_CR15","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1145\/128903.128907","volume":"17","author":"C. Leng","year":"1992","unstructured":"Leng, C., Lee, D.: Optimal weight assignment for signature generation. TODS\u00a017(2), 346\u2013373 (1992)","journal-title":"TODS"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/j.is.2008.08.001","volume":"36","author":"G. Li","year":"2011","unstructured":"Li, G., Feng, J., Chin Ooi, B., Wang, J., Zhou, L.: An effective 3-in-1 keyword search method over heterogeneous data sources. Inf. Syst.\u00a036, 248\u2013266 (2011)","journal-title":"Inf. Syst."},{"key":"15_CR17","unstructured":"Burcher, N.: \n                    \n                      http:\/\/www.nickburcher.com\/2010\/03\/facebook-usage-statistics-march-2010.html"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1002\/(SICI)1097-0118(200003)33:3<167::AID-JGT7>3.0.CO;2-5","volume":"33","author":"D. Peleg","year":"2000","unstructured":"Peleg, D.: Proximity-preserving labeling schemes. J. Graph Theory\u00a033, 167\u2013176 (2000)","journal-title":"J. Graph Theory"},{"key":"15_CR19","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"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Wei, F.: TEDI: efficient shortest path query answering on graphs. In: SIGMOD, pp. 99\u2013110 (2010)","DOI":"10.1145\/1807167.1807181"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Xiao, Y., Wu, W., Pei, J., Wang, W., He, Z.: Efficiently indexing shortest paths by exploiting symmetry in graphs. In: EDBT, pp. 493\u2013504 (2009)","DOI":"10.1145\/1516360.1516418"}],"container-title":["Lecture Notes in Computer Science","Social Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24704-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T23:14:37Z","timestamp":1554851677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24704-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642247033","9783642247040"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24704-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}