{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:05:45Z","timestamp":1709813145768},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,2,3]],"date-time":"2013-02-03T00:00:00Z","timestamp":1359849600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s13278-013-0095-y","type":"journal-article","created":{"date-parts":[[2013,2,2]],"date-time":"2013-02-02T09:46:42Z","timestamp":1359798402000},"page":"813-828","source":"Crossref","is-referenced-by-count":5,"title":["Hypergraph index: an index for context-aware nearest neighbor query on social networks"],"prefix":"10.1007","volume":"3","author":[{"given":"Yazhe","family":"Wang","sequence":"first","affiliation":[]},{"given":"Baihua","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,2,3]]},"reference":[{"key":"95_CR2","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s13278-011-0025-9","volume":"1","author":"C. Ang","year":"2011","unstructured":"Ang C (2011) Interaction networks and patterns of guild community in massively multiplayer online games. Soc Netw Anal Min 1:341\u2013353","journal-title":"Soc Netw Anal Min"},{"issue":"7","key":"95_CR3","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B.H. Bloom","year":"1970","unstructured":"Bloom BH (1970) Space\/time trade-offs in hash coding with allowable errors. Commun ACM (CACM) 13(7):422\u2013426","journal-title":"Commun ACM (CACM)"},{"key":"95_CR4","doi-asserted-by":"crossref","unstructured":"Carmel D, Zwerdling N, Guy I, Ofek-Koifman S, Har\u2019el N, Ronen I, Uziel E, Yogev S, Chernov S (2009) Personalized social search based on the user\u2019s social network. In: Proceedings of the 18th ACM conference on information and knowledge management (CIKM \u201909), pp 1227\u20131236","DOI":"10.1145\/1645953.1646109"},{"key":"95_CR5","doi-asserted-by":"crossref","unstructured":"Chong WH, Toh WSB, Teow LN (2010) Efficient extraction of high-betweenness vertices. In: Proceedings of the 2010 international conference on advances in social networks analysis and mining (ASONAM \u201910), pp 286\u2013290","DOI":"10.1109\/ASONAM.2010.31"},{"key":"95_CR6","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/S0097539794261295","volume":"28","author":"E. Cohen","year":"1999","unstructured":"Cohen E. (1999) Fast algorithms for constructing t-spanners and paths with stretch t. SIAM J Comput 28:210\u2013236","journal-title":"SIAM J Comput"},{"issue":"1","key":"95_CR7","doi-asserted-by":"crossref","first-page":"1189","DOI":"10.14778\/1453856.1453982","volume":"1","author":"B.B. Dalvi","year":"2008","unstructured":"Dalvi BB, Kshirsagar M, Sudarshan S (2008) Keyword search on external memory data graphs. VLDB Endow 1(1):1189\u20131204","journal-title":"VLDB Endow"},{"issue":"1","key":"95_CR8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1(1):269\u2013271","journal-title":"Numer Math"},{"issue":"3","key":"95_CR9","doi-asserted-by":"crossref","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. (2000) The graph Voronoi diagram with applications. Networks 36(3):156\u2013163","journal-title":"Networks"},{"issue":"1","key":"95_CR10","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"L.C. Freeman","year":"1977","unstructured":"Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40(1):35\u201341","journal-title":"Sociometry"},{"issue":"1","key":"95_CR11","doi-asserted-by":"crossref","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 (2004) Distance labeling in graphs. J Algorithms 53(1):85\u2013112","journal-title":"J Algorithms"},{"key":"95_CR12","doi-asserted-by":"crossref","unstructured":"Goldberg AV (2007) Point-to-point shortest path algorithms with preprocessing. In: Proceedings of the 33rd conference on current trends in theory and practice of computer science (SOFSEM\u201907), pp 88\u2013102","DOI":"10.1007\/978-3-540-69507-3_6"},{"key":"95_CR13","unstructured":"Goldberg AV, Harrelson C (2005) Computing the shortest path: a search meets graph theory. In: Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms (SODA\u201905), pp 156\u2013165"},{"key":"95_CR14","unstructured":"Gutman R. (2004) Reach-based routing: a new approach to shortest path algorithms optimized for road networks. In: Proceeding of the sixth workshop on algorithm engineering and experiments (ALENEX\u201904), pp 100\u2013111"},{"key":"95_CR15","doi-asserted-by":"crossref","unstructured":"He H, Wang H, Yang J, Yu PS (2007) Blinks: ranked keyword searches on graphs. In: Proceedings of the 2007 ACM SIGMOD international conference on management of data (SIGMOD\u201907), pp 305\u2013316","DOI":"10.1145\/1247480.1247516"},{"key":"95_CR16","unstructured":"Hu H, Lee DL, Lee VCS (2006) Distance indexing on road networks. In: Proceedings of the 32nd international conference on Very large data bases (VLDB\u201906), pp 894\u2013905"},{"key":"95_CR17","unstructured":"Hulgeri A, Nakhe C (2002) Keyword searching and browsing in databases using banks. In: Proceedings of the 18th international conference on data engineering (ICDE\u201902), pp 431\u2013443"},{"issue":"3","key":"95_CR18","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1109\/69.687976","volume":"10","author":"N. Jing","year":"1998","unstructured":"Jing N, Huang YW, Rundensteiner EA (1998) Hierarchical encoded path views for path query processing: an optimal model and its performance evaluation. IEEE Trans Knowl Data Eng (TKDE) 10(3):409\u2013432","journal-title":"IEEE Trans Knowl Data Eng (TKDE)"},{"issue":"5","key":"95_CR19","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1109\/TKDE.2002.1033772","volume":"14","author":"S. Jung","year":"2002","unstructured":"Jung S, Pramanik S (2002) An efficient path computation model for hierarchically structured topographical road maps. IEEE Trans Knowl Data Eng (TKDE) 14(5):1029\u20131046","journal-title":"IEEE Trans Knowl Data Eng (TKDE)"},{"key":"95_CR20","unstructured":"Kacholia V, Pandit S, Chakrabarti S, Sudarshan S, Desai R, Karambelkar H (2005) Bidirectional expansion for keyword search on graph databases. In: Proceedings of the 31st international conference on very large data bases (VLDB\u201905), pp 505\u2013516"},{"key":"95_CR21","doi-asserted-by":"crossref","unstructured":"Kourtellis N, Alahakoon T, Simha R, Iamnitchi A, Tripathi R (2012) Identifying high betweenness centrality nodes in large social networks. Soc Netw Anal Min 1\u201316. doi: 10.1007\/s13278-012-0076-6","DOI":"10.1007\/s13278-012-0076-6"},{"issue":"2","key":"95_CR22","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/65935.65937","volume":"7","author":"D. Lee","year":"1989","unstructured":"Lee D, Leng C (1989) Partitioned signature file: design considerations and performance evaluation. ACM Trans on Inform Syst (TOIS) 7(2):158\u2013180","journal-title":"ACM Trans Inform Syst (TOIS)"},{"issue":"3","key":"95_CR23","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1109\/69.390248","volume":"7","author":"D.L. Lee","year":"1995","unstructured":"Lee DL, Kim YM, Patel G (1995) Efficient signature file methods for text retrieval. IEEEIEEE Trans Knowl Data Eng (TKDE) 7(3):423\u2013435","journal-title":"IEEE Trans Knowl Data Eng (TKDE)"},{"key":"95_CR24","doi-asserted-by":"crossref","unstructured":"Lee KCK, Lee WC, Zheng B (2009) Fast object search on road networks. In: Proceedings of the 12th international conference on extending database technology (EDBT\u201909), pp 1018\u20131029","DOI":"10.1145\/1516360.1516476"},{"issue":"3","key":"95_CR25","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1109\/TKDE.2010.243","volume":"24","author":"K.C.K. Lee","year":"2012","unstructured":"Lee KCK, Lee WC, Zheng B, Tian Y (2012) Road: a new spatial object search framework for road networks. IEEE Trans Knowl Data Eng (TKDE) 24(3):547\u2013560","journal-title":"IEEE Trans Knowl Data Eng (TKDE)"},{"issue":"2","key":"95_CR26","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1145\/128903.128907","volume":"17","author":"C. Leng","year":"1992","unstructured":"Leng C, Lee D (1992) Optimal weight assignment for signature generation. ACM Trans Database Syst (TODS) 17(2):346\u2013373","journal-title":"ACM Trans Database Syst (TODS)"},{"key":"95_CR27","doi-asserted-by":"crossref","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 (2011) An effective 3-in-1 keyword search method over heterogeneous data sources. Inform Syst 36:248\u2013266","journal-title":"Inform Syst"},{"key":"95_CR28","doi-asserted-by":"crossref","unstructured":"Maglaras LA, Katsaros D (2012) New measures for characterizing the significance of nodes in wireless ad hoc networks via localized path-based neighborhood analysis. Soc Netw Anal Min 2:97\u2013106","DOI":"10.1007\/s13278-011-0029-5"},{"key":"95_CR1","doi-asserted-by":"crossref","unstructured":"Martn Gonzlez AM, Dalsgaard B, Olesen JM (2010) Centrality measures and the importance of generalist species in pollination networks. Ecol Complexity 7(1):36\u201343","DOI":"10.1016\/j.ecocom.2009.03.008"},{"issue":"1","key":"95_CR29","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.socnet.2004.11.009","volume":"27","author":"M. Newman","year":"2005","unstructured":"Newman M (2005) A measure of betweenness centrality based on random walks. Soc Netw 27(1):39\u201354","journal-title":"Soc Netw"},{"key":"95_CR30","doi-asserted-by":"crossref","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 (2000) Proximity-preserving labeling schemes. J Graph Theory 33:167\u2013176","journal-title":"J Graph Theory"},{"key":"95_CR31","doi-asserted-by":"crossref","unstructured":"Samet H, Sankaranarayanan J, Alborzi H (2008) Scalable network distance browsing in spatial databases. In: Proceedings of the 2008 ACM SIGMOD international conference on management of data (SIGMOD\u201908), pp 43\u201354","DOI":"10.1145\/1376616.1376623"},{"key":"95_CR32","doi-asserted-by":"crossref","unstructured":"Schenkel R, Crecelius T, Kacimi M, Michel S, Neumann T, Parreira JX, Weikum G (2008) Efficient top-k querying over social-tagging networks. In: Proceedings of the 31st annual international ACM SIGIR conference on research and development in information retrieval (SIGIR\u201908), pp 523\u2013530","DOI":"10.1145\/1390334.1390424"},{"key":"95_CR33","doi-asserted-by":"crossref","unstructured":"Vieira MV, Fonseca BM, Damazio R, Golgher PB, Reis DC, Ribeiro-Neto B (2007) Efficient search ranking in social networks. In: Proceedings of the sixteenth ACM conference on conference on information and knowledge management (CIKM\u201907), pp 563\u2013572","DOI":"10.1145\/1321440.1321520"},{"key":"95_CR34","doi-asserted-by":"crossref","unstructured":"Wei F (2010) TEDI: efficient shortest path query answering on graphs. In: Proceedings of the 2010 international conference on management of data (SIGMOD\u201910), New York, NY, USA, pp 99\u2013110","DOI":"10.1145\/1807167.1807181"},{"key":"95_CR35","doi-asserted-by":"crossref","unstructured":"Xiao Y, Wu W, Pei J, Wang W, He Z (2009) Efficiently indexing shortest paths by exploiting symmetry in graphs. In: Proceedings of the 12th international conference on extending database technology (EDBT\u201909), pp 493\u2013504","DOI":"10.1145\/1516360.1516418"},{"key":"95_CR36","doi-asserted-by":"crossref","unstructured":"Yin P, Lee WC, Lee KC (2010) On top-k social web search. In: Proceedings of the 19th ACM international conference on information and knowledge management (CIKM \u201910), pp 1313\u20131316","DOI":"10.1145\/1871437.1871609"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-013-0095-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-013-0095-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-013-0095-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T00:53:57Z","timestamp":1562633637000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-013-0095-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,3]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["95"],"URL":"https:\/\/doi.org\/10.1007\/s13278-013-0095-y","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"value":"1869-5450","type":"print"},{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,3]]}}}