Advertisement

Context-Aware Nearest Neighbor Query on Social Networks

  • Yazhe Wang
  • Baihua Zheng
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6984)

Abstract

Social networking has grown rapidly over the last few years, and social networks contain a huge amount of content. However, it can be not easy to navigate the social networks to find specific information. In this paper, we define a new type of queries, namely context-aware nearest neighbor (CANN) search over social network to retrieve the nearest node to the query node that matches the context specified. CANN considers both the structure of the social network, and the profile information of the nodes. We design a hyper-graph based index structure to support approximated CANN search efficiently.

Keywords

Social Network Short Path Center Node Approximation Quality Query Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cohen, E.: Fast algorithms for constructing t-spanners and paths with stretch t. SIAM J. Comput. 28, 210–236 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1(1), 269–271 (1959)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Erwig, M.: The graph Voronoi diagram with applications. Networks 36(3), 156–163 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Gaboille, C., Peleg, D., Pérennes, S., Raz, R.: Distance labeling in graphs. Journal of Algorithms 53(1), 85–112 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Goldberg, A.V., Harrelson, C.: Computing the shortest path: A search meets graph theory. In: SODA, pp. 156–165 (2005)Google Scholar
  6. 6.
    Gutman, R.: Reach-based routing: A new approach to shortest path algorithms optimized for road networks. In: ALENEX, pp. 100–111 (2004)Google Scholar
  7. 7.
    He, H., Wang, H., Yang, J., Yu, P.S.: Blinks: ranked keyword searches on graphs. In: SIGMOD, pp. 305–316 (2007)Google Scholar
  8. 8.
    Hu, H., Lee, D.L., Lee, V.C.S.: Distance indexing on road networks. In: VLDB, pp. 894–905 (2006)Google Scholar
  9. 9.
    Hulgeri, A., Nakhe, C.: Keyword searching and browsing in databases using banks. In: ICDE, pp. 431–443 (2002)Google Scholar
  10. 10.
    Jing, N., Huang, Y.-W., Rundensteiner, E.A.: Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation. TKDE 10(3), 409–432 (1998)Google Scholar
  11. 11.
    Jung, S., Pramanik, S.: An efficient path computation model for hierarchically structured topographical road maps. TKDE 14(5), 1029–1046 (2002)Google Scholar
  12. 12.
    Kacholia, V., Pandit, S., Chakrabarti, S., Sudarshan, S., Desai, R., Karambelkar, H.: Bidirectional expansion for keyword search on graph databases. In: VLDB, pp. 505–516 (2005)Google Scholar
  13. 13.
    Lee, D., Leng, C.: Partitioned signature file: Design considerations and performance evaluation. TOIS 7(2), 158–180 (1989)CrossRefGoogle Scholar
  14. 14.
    Lee, D.L., Kim, Y.M., Patel, G.: Efficient signature file methods for text retrieval. TKDE 7(3), 423–435 (1995)Google Scholar
  15. 15.
    Leng, C., Lee, D.: Optimal weight assignment for signature generation. TODS 17(2), 346–373 (1992)CrossRefGoogle Scholar
  16. 16.
    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. 36, 248–266 (2011)CrossRefGoogle Scholar
  17. 17.
  18. 18.
    Peleg, D.: Proximity-preserving labeling schemes. J. Graph Theory 33, 167–176 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Samet, H., Sankaranarayanan, J., Alborzi, H.: Scalable network distance browsing in spatial databases. In: SIGMOD, pp. 43–54 (2008)Google Scholar
  20. 20.
    Wei, F.: TEDI: efficient shortest path query answering on graphs. In: SIGMOD, pp. 99–110 (2010)Google Scholar
  21. 21.
    Xiao, Y., Wu, W., Pei, J., Wang, W., He, Z.: Efficiently indexing shortest paths by exploiting symmetry in graphs. In: EDBT, pp. 493–504 (2009)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Yazhe Wang
    • 1
  • Baihua Zheng
    • 1
  1. 1.Singapore Management UniversitySingapore

Personalised recommendations