Skip to main content
SpringerLink
Log in

Stream Querying and Reasoning on Social Data

  • Reference work entry
  • First Online:
Encyclopedia of Social Network Analysis and Mining

Synonyms

Continuous query processing; Dynamic social networks; Incremental computation; Temporal analytics

Glossary

Social Data Stream:

A time-stamped sequence of updates to a social network

SNA:

Social network analysis

CQP:

Continuous query processing

CEP:

Complex event processing

Introduction

Since the inception of online social networks, the amount of social data that is being published on a daily basis has been increasing at an unprecedented rate. Smart, GPS-enabled, always-connected personal devices have taken the data generation to a new level by making it tremendously easy to generate and share social content like check-in information, likes, microblogs(e.g., Twitter), multi-media data, and so on. There is an enormous value in reasoning about such streaming data and deriving meaningful insights from it in real time. Examples of potential applications include advertising, sentiment analysis, detecting natural disasters, social recommendations, personalized trends, spam...

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 1,500.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 549.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  • Agarwal MK, Ramamritham K, Bhide M (2012) Real time discovery of dense clusters in highly dynamic graphs: identifying real world events in highly dynamic environments. PVLDB 5(10):980–991

    Google Scholar 

  • Aggarwal C (ed) (2007) Data streams: models and algorithms. Springer, New York

    Google Scholar 

  • Aggarwal C, Zhao Y, Yu P (2011) Outlier detection in graph streams. In: 27th international conference on data engineering (ICDE), Hannover, pp 399–409

    Google Scholar 

  • Ahmed NK, Neville J, Kompella RR (2012) Network sampling: from static to streaming graphs. CoRR abs/1211.3412

    Google Scholar 

  • Ahn KJ, Guha S, McGregor A (2012) Graph sketches: sparsification, spanners, and subgraphs. In: PODS, Scottsdale

    Google Scholar 

  • Akoglu L, Faloutsos C (2013) Anomaly, event, and fraud detection in large network datasets. In: WSDM, Rome

    Google Scholar 

  • Akoglu L, McGlohon M, Faloutsos C (2010) Oddball: spotting anomalies in weighted graphs. In: Proceedings of the 14th Pacific-Asia conference on advances in knowledge discovery and data mining (PAKDD), Hyderabad, pp 410–421

    Google Scholar 

  • Alon N, Yuster R, Zwick U (1997) Finding and counting given length cycles. Algorithmica 17:209–223

    MATH  MathSciNet  Google Scholar 

  • Angel A, Sarkas N, Koudas N, Srivastava D (2012) Dense subgraph maintenance under streaming edge weight updates for real-time story identification. VLDB 5:574–585

    Google Scholar 

  • Anicic D, Fodor P, Rudolph S, Stojanovic N (2011) EP-SPARQL: a unified language for event processing and stream reasoning. In: WWW, Hyderabad

    Google Scholar 

  • Bahmani B, Chowdhury A, Goel A (2010) Fast incremental and personalized pagerank. Proc VLDB Endow 4:173–184

    Google Scholar 

  • Barbieri DF, Braga D, Ceri S, Grossniklaus M (2010) An execution environment for C-SPARQL queries. In: Proceedings of the 13th international conference on extending database technology, EDBT'10, Lausanne, pp 441–452

    Google Scholar 

  • Barbieri DF, Braga D, Ceri S, Della Valle E, Grossniklaus M (2009) C-SPARQL: SPARQL for continuous querying. In: WWW, Madrid

    Google Scholar 

  • Becchetti L, Boldi P, Castillo C, Gionis A (2008) Efficient semi-streaming algorithms for local triangle counting in massive graphs. In: KDD, Las Vegas

    Google Scholar 

  • Boccaletti S, Latora V, Moreno Y, Chavez M, Hwang D-U (2006) Complex networks: structure and dynamics. Phys Rep 424(4): 175–308

    MathSciNet  Google Scholar 

  • Bolles A, Grawunder M, Jacobi J (2008) Streaming SPARQL: extending SPARQL to process data streams. In: The semantic web: research and applications, Springer, New York, pp 448–462

    Google Scholar 

  • Cai Z, Logothetis D, Siganos G (2012) Facilitating realtime graph mining. In: Proceedings of the fourth international workshop on cloud data management, CloudDB'12, Sheraton, Maui, pp 1–8

    Google Scholar 

  • Cheng R, Hong J, Kyrola A, Miao Y, Weng X, Wu M, Yang F, Zhou L, Zhao F, Chen E (2012) Kineograph: taking the pulse of a fast-changing and connected world. In: Proceedings of the 7th ACM European conference on computer systems, EuroSys '12, Bern, pp 85–98

    Google Scholar 

  • Choudhury S, Holder LB, Ray A, Chin G Jr, Feo J (2012) Continuous queries for multi-relational graphs. CoRR abs/1209.2178

    Google Scholar 

  • Diao Y, Fischer P, Franklin MJ, To R (2002) Yfilter: efficient and scalable filtering of XML documents. In: Proceedings of the 18th international conference on data engineering, San Jose. IEEE, pp 341–342

    Google Scholar 

  • Eppstein D, Galil Z, Italiano GF (1999) Dynamic graph algorithms. In: Atallah MJ (ed) Algorithms and theory of computation handbook, chapter 8. CRC, Boca Raton

    Google Scholar 

  • Garofalakis M, Gehrke J, Rastogi R (eds) (2011) Data-Stream management — processing high-speed data streams. Data-Centric systems and applications series. Springer, New York

    Google Scholar 

  • Gupta A, Mumick IS (1999) Materialized views: techniques, implementations, and applications. MIT, Cambridge

    Google Scholar 

  • Jowhari H, Ghodsi M (2005) New streaming algorithms for counting triangles in graphs. In: Wang L (ed) Computing and combinatorics. Lecture notes in computer science, vol 3595. Springer, Berlin/Heidelberg, pp 710–716

    Google Scholar 

  • Kutzkov K, Pagh R (2013) On the streaming complexity of computing local clustering coefficients. In: WSDM, Rome

    Google Scholar 

  • Libkin L, Martens W, Vrgoc D (2013) Querying graph databases with XPath. In: ICDT, Genoa

    Google Scholar 

  • Madden S, Franklin MJ, Hellerstein JM, Hong W (2002a) TAG: a tiny aggregation service for Ad-Hoc sensor networks. In: OSDI, Boston

    Google Scholar 

  • Madden S, Shah MA, Hellerstein JM, Raman V (2002b) Continuously adaptive continuous queries over streams. In: SIGMOD, Madison

    Google Scholar 

  • McAuley JJ, Leskovec J (2012) Discovering social circles in ego networks. CoRR abs/1210.8182

    Google Scholar 

  • Mondal J, Deshpande A (2012) Managing large dynamic graphs efficiently. In: SIGMOD, Scottsdale

    Google Scholar 

  • Mondal J, Deshpande A (2013) Stream querying and reasoning on social data. http://www.cs.umd.edu/~jayanta/papers/SRQ-ESNAM.pdf

  • Moustafa WE, Miao H, Deshpande A, Getoor L (2013) GrDB: a system for declarative and interactive analysis of noisy information networks: demo, SIGMOD, New York

    Google Scholar 

  • Moustafa WE, Namata G, Deshpande A, Getoor L (2011) Declarative Analysis of noisy information networks. In: ICDE GDM workshop, Hannover

    Google Scholar 

  • Mozafari B, Zeng K, Zaniolo C (2012) High-performance complex event processing over xml streams. In: SIGMOD, Scottsdale

    Google Scholar 

  • Muthukrishnan S (2005) Data streams: algorithms and applications. Now Publishers, Boston/Hanover

    Google Scholar 

  • Newman MEJ (2003) The structure and function of complex networks. SIAM Rev 45(2):167–256

    MATH  MathSciNet  Google Scholar 

  • Pujol J, Erramilli V, Siganos G, Yang X, Laoutaris N, Chhabra P, Rodriguez P (2010) The little engine (s) that could: scaling online social networks. In: SIG-COMM, New Delhi

    Google Scholar 

  • Ramakrishnan R, Ullman JD (1995) A survey of deductive database systems. J Log Program 23(2):125–149

    MathSciNet  Google Scholar 

  • Scott J (2012) Social network analysis. Sage, London

    Google Scholar 

  • Valle ED, Ceri S, Barbieri DF, Braga D, Campi A (2008) A first step towards stream reasoning. In: FIS, Vienna, pp 72–81

    Google Scholar 

  • Valle ED, Ceri S, van Harmelen F, Fensel D (2009) It's a streaming world! Reasoning upon rapidly changing information. IEEE Intell Syst 24(6):83–89

    Google Scholar 

  • Zhao P, Aggarwal CC, Wang M (2011) gSketch: on query estimation in graph streams. VLDB 5:193–204

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Maryland, College Park, MD, USA

    Jayanta Mondal & Amol Deshpande

Authors
  1. Jayanta Mondal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Amol Deshpande
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Calgary, Calgary, AB, Canada

    Reda Alhajj

  2. Department of Computer Science, University of Calgary, Calgary, AB, Canada

    Jon Rokne

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media New York

About this entry

Cite this entry

Mondal, J., Deshpande, A. (2014). Stream Querying and Reasoning on Social Data. In: Alhajj, R., Rokne, J. (eds) Encyclopedia of Social Network Analysis and Mining. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-6170-8_391

Download citation

Publish with us

Policies and ethics

Search

Navigation