Skip to main content
SpringerLink
Log in

Continuous Top-k Processing of Social Network Information Streams: A Vision

  • Conference paper
  • First Online:
Book cover Information Search, Integration and Personalization (ISIP 2014)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 497))

  • 230 Accesses

Abstract

With the huge popularity of social networks, publishing and consuming content through information streams is nowadays at the heart of the new Web. Top-k queries over the streams of interest allow limiting results to relevant content, while continuous processing of such queries is the most effective approach in large scale systems. Current systems fail in combining continuous top-k processing with rich scoring models including social network criteria. We present in this paper our vision on the possible features of a social network of information streams, with a rich scoring model compatible with continuous top-k processing.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Notes

  1. 1.

    http://www.netvibes.com.

  2. 2.

    https://pipes.yahoo.com/pipes/.

References

  1. Aguilera, M.K., Strom, R.E., Sturman, D.C., Astley, M., Chandra, T.D.: Matching events in a content-based subscription system. In: PODC 1999, pp. 53–61 (1999)

    Google Scholar 

  2. Bahmani, B., Goel, A.: Partitioned multi-indexing: bringing order to social search. In: WWW 2012, pp. 399–408 (2012)

    Google Scholar 

  3. Bianchi, S., Felber, P., Gradinariu, M.: Potop-Butucaru: stabilizing distributed r-trees for peer-to-peer content routing. IEEE Trans. Parallel Distrib. Syst. 21(8), 1175–1187 (2010)

    Article  Google Scholar 

  4. Broder, A.Z., Carmel, D., Herscovici, M., Soffer, A., Zien, J.: Efficient query evaluation using a two-level retrieval process. In: CIKM 2003, pp. 426–434 (2003)

    Google Scholar 

  5. Buckley, C., Lewit, A.F.: Optimization of inverted vector searches. In: SIGIR 1985, pp. 97–110 (1985)

    Google Scholar 

  6. Callan, J.: Document filtering with inference networks. In: SIGIR 1996, pp. 262–269 (1996)

    Google Scholar 

  7. Dahimene, R., Du Mouza, C., Scholl, M.: Efficient filtering in micro-blogging systems: We won’t get flooded again. In: Ailamaki, A., Bowers, S. (eds.) SSDBM 2012. LNCS, vol. 7338, pp. 168–176. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  8. Das, G., Gunopulos, D., Koudas, N., Sarkas, N.: Ad-hoc top-k query answering for data streams. In: VLDB 2007, pp. 183–194 (2007)

    Google Scholar 

  9. Del Corso, G.M., Gullí, A., Romani, F.: Ranking a stream of news. In: WWW 2005, pp. 97–106 (2005)

    Google Scholar 

  10. Fabret, F., Jacobsen, H.A., Llirbat, F., Pereira, J., Ross, K.A., Shasha, D.: Filtering algorithms and implementation for very fast publish/subscribe systems. SIGMOD Rec. 30(2), 115–126 (2001)

    Article  Google Scholar 

  11. Fagin, R.: Combining fuzzy information: an overview. SIGMOD Rec. 31(2), 109–118 (2002)

    Article  Google Scholar 

  12. Gabrilovich, E., Dumais, S., Horvitz, E.: Newsjunkie: Providing personalized newsfeeds via analysis of information novelty. In: WWW 2004, pp. 482–490 (2004)

    Google Scholar 

  13. Golab, L., Özsu, M.T.: Issues in data stream management. SIGMOD Rec. 32(2), 5–14 (2003)

    Article  Google Scholar 

  14. Haghani, P., Michel, S., Aberer, K.: The gist of everything new: Personalized top-k processing over web 2.0 streams. In: CIKM 2010, pp. 489–498 (2010)

    Google Scholar 

  15. Hmedeh, Z., Kourdounakis, H., Christophides, V., du Mouza, C., Scholl, M., Travers, N.: Subscription indexes for web syndication systems. In: EDBT 2012, pp. 312–323 (2012)

    Google Scholar 

  16. Hu, Y., Li, M., Li, Z., Ma, W.-Y.: Discovering authoritative news sources and top news stories. In: Ng, H.T., Leong, M.-K., Kan, M.-Y., Ji, D. (eds.) AIRS 2006. LNCS, vol. 4182, pp. 230–243. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  17. Jones, K.S., Walker, S., Robertson, S.E.: A probabilistic model of information retrieval: development and comparative experiments. Inf. Process. Manage. 36(6), 779–808 (2000)

    Article  Google Scholar 

  18. Khodaei, A., Shahabi, C.: Social-textual search and ranking. In: International Workshop on Crowdsourcing Web Search, Lyon, France, April 17, 2012, pp. 3–8 (2012)

    Google Scholar 

  19. Maniu, S., Cautis, B.: Efficient top-k retrieval in online social tagging networks. CoRR, abs/1104.1605 (2011)

    Google Scholar 

  20. Mouratidis, K., Bakiras, S., Papadias, D.: Continuous monitoring of top-k queries over sliding windows. In: SIGMOD 2006, pp. 635–646 (2006)

    Google Scholar 

  21. Mouratidis, K., Pang, H.: Efficient evaluation of continuous text search queries. IEEE Trans. Knowl. Data Eng. 23(10), 1469–1482 (2011)

    Article  Google Scholar 

  22. Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical report, Stanford University (1999)

    Google Scholar 

  23. Pripužić, K., Žarko, I.P., Aberer, K.: Top-k/w publish/subscribe: Finding k most relevant publications in sliding time window w. In: DEBS 2008, pp. 127–138 (2008)

    Google Scholar 

  24. Rao, W., Chen, L., Chen, S., Tarkoma, S.: Evaluating continuous top-k queries over document streams. World Wide Web 17(1), 59–83 (2014)

    Article  Google Scholar 

  25. Rao, W., Fu, AW.-C., Chen, L., Chen, H.: Stairs: Towards efficient full-text filtering and dissemination in a dht environment. In: ICDE 2009, pp. 198–209 (2009)

    Google Scholar 

  26. Salton, G., Buckley, C.: Term-weighting approaches in automatic text retrieval. Inf. Process. Manage. 24(5), 513–523 (1988)

    Article  Google Scholar 

  27. Schenkel, R., Crecelius, T., Kacimi, M., Michel, S., Neumann, T., Parreira, J.X., Weikum, G.: Efficient top-k querying over social-tagging networks. In: SIGIR 2008, pp. 523–530 (2008)

    Google Scholar 

  28. Shraer, A., Gurevich, M., Fontoura, M., Josifovski, V.: Top-k publish-subscribe for social annotation of news. Proc. VLDB Endow. 6(6), 385–396 (2013)

    Article  Google Scholar 

  29. Vouzoukidou, N., Amann, B., Christophides, V.: Processing continuous text queries featuring non-homogeneous scoring functions. In: CIKM 2012, pp. 1065–1074 (2012)

    Google Scholar 

  30. Wang, C., Zhang, M., Ru, L., Ma, S.: Automatic online news topic ranking using media focus and user attention based on aging theory. In: CIKM 2008, pp. 1033–1042 (2008)

    Google Scholar 

  31. Wu, D., Li, Y., Choi, B., Xu, J.: Social-aware top-k spatial keyword search. In: MDM 2014, pp. 235–244 (2014)

    Google Scholar 

  32. Yan, T.W., Garcia-Molina, H.: Index structures for information filtering under the vector space model. In: ICDE 1994, pp. 337–347 (1994)

    Google Scholar 

  33. Yan, T.W., García-Molina, H.: Index structures for selective dissemination of information under the boolean model. ACM Trans. Database Syst. (TODS) 19(2), 332–364 (1994)

    Article  Google Scholar 

  34. Yan, T.W., Garcia-Molina, H.: The sift information dissemination system. ACM Trans. Database Syst. 24(4), 529–565 (1999)

    Article  Google Scholar 

  35. Yin, P., Lee, W.-C., Lee, K.C.K.: On top-k social web search. In: CIKM, pp. 1313–1316. ACM (2010)

    Google Scholar 

  36. Zhang, Y., Callan, J.: Maximum likelihood estimation for filtering thresholds. In: SIGIR 2001, pp. 294–302 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ETIS, ENSEA, University of Cergy-Pontoise, CNRS, Cergy, France

    Abdulhafiz Alkhouli, Dan Vodislav & Boris Borzic

Authors
  1. Abdulhafiz Alkhouli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dan Vodislav
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Boris Borzic
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dan Vodislav .

Editor information

Editors and Affiliations

  1. Lab. ETIS, Sciences Informatiques, Université de Cergy-Pontoise, Pontoise, France

    Dimitrios Kotzinos

  2. HELP University, Kuala Lumpur, Malaysia

    Yeow Wei Choong

  3. LRI, University of Paris South, Orsay, France

    Nicolas Spyratos

  4. Information Science, Knowledge Media Lab, Hokkaido University, Sapporo, Hokkaido, Japan

    Yuzuru Tanaka

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Alkhouli, A., Vodislav, D., Borzic, B. (2016). Continuous Top-k Processing of Social Network Information Streams: A Vision. In: Kotzinos, D., Choong, Y., Spyratos, N., Tanaka, Y. (eds) Information Search, Integration and Personalization. ISIP 2014. Communications in Computer and Information Science, vol 497. Springer, Cham. https://doi.org/10.1007/978-3-319-38901-1_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-38901-1_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-38900-4

  • Online ISBN: 978-3-319-38901-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation