Skip to main content
SpringerLink
Log in

Stream Querying and Reasoning on Social Data

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

  • 50 Accesses

Synonyms

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

Glossary

CEP:

Complex event processing

CQP:

Continuous query processing

SNA:

Social network analysis

Social data stream:

A time-stamped sequence of updates to a social network

Definition

We define social data to be comprised of a network component that captures the relationships among its entities, as well as the constant stream of information generated by the entities. In turn, we define stream querying and reasoning on social data to be tasks that need to process the data in a continuous fashion to produce answers and insights.

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...

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

Access this chapter

Log in via an institution

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. Proc VLDB Endow 5(10):980–991

    Article  Google Scholar 

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

    MATH  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 R (2014) Network sampling: from static to streaming graphs. ACM Transactions on Knowledge Discovery from Data (TKDD), 2014;8(2):7

    Google Scholar 

  • Ahn KJ, Guha S, McGregor A (2012) Graph sketches: sparsification, spanners, and subgraphs. In: Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems, PODS 2012, Scottsdale, 20–24 May 2012, pp 5–14

    Google Scholar 

  • Akoglu L, Faloutsos C (2013) Anomaly, event, and fraud detection in large network datasets. In: WSDM’13 Proceedings of the sixth ACM international conference on web search and data mining, Rome, 4–8 Feb 2013, pp 773–774

    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, 21–24 June 2010, pp 410–421

    Google Scholar 

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

    Article  MathSciNet  MATH  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 2011, Hyderabad, pp 635–644

    Google Scholar 

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

    Article  Google Scholar 

  • Barbieri DF, Braga D, Ceri S, Della Valle E, Grossniklaus M (2009) C-SPARQL: SPARQL for continuous querying. In: Proceedings of the 18th international conference on World wide web, Madrid, pp 1061–1062

    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 

  • Becchetti L, Boldi P, Castillo C, Gionis A (2008) Efficient semi-streaming algorithms for local triangle counting in massive graphs. In: Proceedings of ACM KDD, Las Vegas, Aug 2008, pp 16–24

    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

    Article  MathSciNet  MATH  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

    Chapter  Google Scholar 

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

    Google Scholar 

  • Chandramouli BJ (2012). Temporal analytics on big data for web advertising. In: IEEE 28th international conference on data engineering (ICDE), Apr 2012, pp 90–101

    Google Scholar 

  • Chandrasekaran S (2004) Remembrance of streams past: overload-sensitive management of archived streams. In: VLDB’04 proceedings of the 30th international conference on very large data bases – volume 30, Toronto, 31 Aug–3 Sept 2004, pp 348–359

    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 

  • 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, IEEE, San Jose, pp 341–342

    Google Scholar 

  • Eppstein D, Galil Z, Italiano GF (1999) Dynamic graph algorithms, chapter 8. In: Atallah MJ (ed) Algorithms and theory of computation handbook. 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 

  • Jiang MB (2014) Catchsync: catching synchronized behavior in large directed graphs. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining, New York, 24–27 Aug 2014, pp 941–950

    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

    Chapter  Google Scholar 

  • Kutzkov K, Pagh R (2013) On the streaming complexity of computing local clustering coefficients. In: Proceedings of the 6th ACM international conference on web search and data mining, WSDM, Rome, 4–8 Feb 2013, pp 677–686

    Google Scholar 

  • Libkin L, Martens W, Vrgoc D (2013) Querying graph databases with XPath. In: Proceedings of the 16th international conference on database theory, ICDT, Genoa, 18–22 Mar 2013, pp 129–140

    Google Scholar 

  • Madden S, Franklin MJ, Hellerstein JM, Hong W (2002a) TAG: a tiny aggregation service for ad-hoc sensor networks. In: Proceedings of the 5th symposium on operating systems design and implementation, OSDI, Boston, pp 131–146

    Google Scholar 

  • Madden S, Shah MA, Hellerstein JM, Raman V (2002b) Continuously adaptive continuous queries over streams. In: Proceedings of the 2002 ACM SIGMOD international conference on management of data, Madison, 3–6 June 2002, pp 49–60

    Google Scholar 

  • Mcauley J, Leskovec J (2014) Discovering social circles in ego networks. ACM Transactions on Knowledge Discovery from Data (TKDD), 2014;8(1):4

    Google Scholar 

  • Mondal J (2014) EAGr: supporting continuous ego-centric aggregate queries over large dynamic graphs. In: Proceedings of the 2014 ACM SIGMOD international conference on management of data, Snowbird, 22–27 June 2014, pp 1335–1346

    Google Scholar 

  • Mondal J (2016) CASQD: continuous detection of activity-based subgraph pattern queries on dynamic graphs. In: Proceedings of the 10th ACM international conference on distributed and event-based systems, Irvine, 20–24 June 2016, pp 226–237

    Google Scholar 

  • Mondal J, Deshpande A (2012) Managing large dynamic graphs efficiently. In: Proceedings of the 2012 ACM SIGMOD international conference on management of data, Scottsdale, 20–24 May 2014, pp 145–156

    Google Scholar 

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

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

    Google Scholar 

  • 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 

  • Mozafari B, Zeng K, Zaniolo C (2012) High-performance complex event processing over XML streams. In: Proceedings of the 2012 ACM SIGMOD international conference on management of data, Scottsdale, 20–24 May 2012, pp 253–264

    Google Scholar 

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

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  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: Proceedings of the ACM SIGCOMM 2010 conference, New Delhi, pp 375–386

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Reiss FS (2007). Enabling real-time querying of live and historical stream data. In: 19th international conference on scientific and statistical database management, SSDBM 2007, Banff, 9–11 July 2007, p 28

    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, 28–30 Sept 2008, 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

    Article  Google Scholar 

  • Wang C, Chen L (2009) Continuous subgraph pattern search over graph streams. IEEE 25th International Conference on Data Engineering (ICDE), IEEE 2009; 29:393–404

    Google Scholar 

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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Microsoft Corporation, Redmond, WA, USA

    Jayanta Mondal

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

    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

Corresponding author

Correspondence to Jayanta Mondal .

Editor information

Editors and Affiliations

  1. Computer Science, University of Calgary, Calgary, Alberta, Canada

    Reda Alhajj

  2. University of Calgary Computer Science, Calgary, Canada

    Jon Rokne

Section Editor information

  1. Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN, USA

    Jaideep Srivastava

  2. Baruch College, CUNY, New York, NY, USA

    Abdullah Uz Tansel

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Science+Business Media LLC

About this entry

Cite this entry

Mondal, J., Deshpande, A. (2017). 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-7163-9_391-1

Download citation

  • DOI: https://doi.org/10.1007/978-1-4614-7163-9_391-1

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4614-7163-9

  • Online ISBN: 978-1-4614-7163-9

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Search

Navigation