Skip to main content

Friends Based Keyword Search over Online Social Networks

  • Conference paper
Book cover Grid and Pervasive Computing (GPC 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7861))

Included in the following conference series:

  • 2030 Accesses

Abstract

Online social networks are rapidly becoming popular for users to share, organize and locate interesting content. Users pay much attention to their close friends, those direct or two-hop friends. Users of Facebook commonly browse relevant profiles and the homepages, which are inefficient in obtaining desired information for a user due to the large amount of relevant data. In this paper, we propose a summary index with a ranking model by extending existing Bloom filter techniques, and achieve efficient full-text search over large scale OSNs to reduce inter-server communication cost and provide much shorter query latency. Furthermore, we conduct comprehensive simulations using traces from real world systems to evaluate our design. Results show that our scheme reduces the network traffic by 94.1% and reduces the query latency by 82.4% with high search accuracy.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. http://blog.facebook.com/blog.php?post=115469877130 (2011)

  2. Benevenuto, F., Rodrigues, T., Cha, M., Almeida, V.A.F.: Characterizing user behavior in online social networks. In: Proceedings of the 9th Conference on Internet Measurement. ACM (2009)

    Google Scholar 

  3. Bjørklund, T.A., Götz, M., Gehrke, J.: Search in social networks with access control. In: Proceedings of the Second International Workshop on Keyword Search on Structured Data, p. 4. ACM (2010)

    Google Scholar 

  4. Bloom, B.H.: Space/time trade-offs in hash coding with allowable errors. Communication of the ACM 13(7), 422–426 (1970)

    Article  MATH  Google Scholar 

  5. Chen, H., Jin, H., Wang, J., Chen, L., Liu, Y., Ni, L.M.: Efficient multi-keyword search over p2p web. In: Proceedings of the 17th International Conference on World Wide Web, pp. 989–998. ACM (2008)

    Google Scholar 

  6. Chen, R., Lua, E.K., Cai, Z.: Bring order to online social networks. In: Proceedings of IEEE International Conference on Computer Communications, pp. 541–545. IEEE (2011)

    Google Scholar 

  7. Fan, L., Cao, P., Almeida, J.M., Broder, A.Z.: Summary cache: A scalable wide-area web cache sharing protocol. In: Proceedings of Special Interest Group on Data Communication, pp. 254–265. ACM (1998)

    Google Scholar 

  8. Guo, D., Wu, J., Chen, H., Yuan, Y., Luo, X.: The dynamic bloom filters. IEEE Trans. Knowledge and Data Engineering. 22(1), 120–133 (2010)

    Article  Google Scholar 

  9. Hawking, D.: Overview of the TREC-9 web track. In: Proceedings of the 9th Text Retrieval Conference (2000)

    Google Scholar 

  10. Horowitz, D., Kamvar, S.D.: The anatomy of a large-scale social search engine. In: Proceedings of International Conference on World Wide Web, pp. 431–440. ACM (2010)

    Google Scholar 

  11. Joinson, A.N.: Looking at, looking up or keeping up with people?: motives and use of facebook. In: Proceedings of the Conference on Human Factors in Computing Systems. ACM (2008)

    Google Scholar 

  12. Kwak, H., Lee, C., Park, H., Moon, S.B.: What is twitter, a social network or a news media? In: Proceedings of International Conference on World Wide Web. ACM (2010)

    Google Scholar 

  13. Lakshman, A., Malik, P.: Cassandra: a decentralized structured storage system. ACM SIGOPS Operating Systems Review 44(2), 35–40 (2010)

    Article  Google Scholar 

  14. Mislove, A., Gummadi, K.P., Druschel, J.P.: Exploiting social networks for internet search. In: Proceedings of the 5th ACM Workshop on Hot Topics in Networks. ACM (2006)

    Google Scholar 

  15. Mysore, R.N., Pamboris, A., Farrington, N., Huang, N., Miri, P., Radhakrishnan, S., Subramanya, V., Vahdat, A.: Portland: a scalable fault-tolerant layer 2 data center network fabric. In: Proceedings of Special Interest Group on Data Communication. ACM (2009)

    Google Scholar 

  16. Salton, G., Fox, E.A., Wu, H.: Extended boolean information retrieval. Communication of ACM 26(11), 1022–1036 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  17. Salton, G., Wong, A., Yang, C.S.: A vector space model for automatic indexing. Communication of ACM 18(11), 613–620 (1975)

    Article  MATH  Google Scholar 

  18. Vieira, M.V., Fonseca, B.M., Damazio, R., Golgher, P.B., de Castro Reis, D., Ribeiro-Neto, B.A.: Efficient search ranking in social networks. In: Proceedings of the 16th Conference on Information and Knowledge Management. ACM (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Huang, J., Jin, H. (2013). Friends Based Keyword Search over Online Social Networks. In: Park, J.J.(.H., Arabnia, H.R., Kim, C., Shi, W., Gil, JM. (eds) Grid and Pervasive Computing. GPC 2013. Lecture Notes in Computer Science, vol 7861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38027-3_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38027-3_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38026-6

  • Online ISBN: 978-3-642-38027-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics