Skip to main content
SpringerLink
Log in

Querying Relational Event Graphs Using Colored Range Searching Data Structures

  • Conference paper
  • First Online:
Algorithms and Discrete Applied Mathematics (CALDAM 2017)

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

Included in the following conference series:

Abstract

We present a general approach for analyzing structural parameters of a relational event graph within arbitrary query time intervals using colored range query data structures. Relational event graphs generally represent social network datasets, where each graph edge carries a timestamp. We provide data structures based on colored range searching to efficiently compute several graph parameters (e.g., density, neighborhood overlap, h-index).

This research work was supported by NSERC and OGS.

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

References

  1. Bannister, M.J., DuBois, C., Eppstein, D., Smyth, P.: Windows into relational events: data structures for contiguous subsequences of edges. In: Proceedings of the 24th ACM-SIAM SODA, pp. 856–864. SIAM (2013)

    Google Scholar 

  2. Berlingerio, M., Coscia, M., Giannotti, F., Monreale, A., Pedreschi, D.: The pursuit of hubbiness: analysis of hubs in large multidimensional networks. J. Comput. Sci. 2(3), 223–237 (2011)

    Article  Google Scholar 

  3. Bettencourt, L.M., Cintrón-Arias, A., Kaiser, D.I., Castillo-Chávez, C.: The power of a good idea: quantitative modeling of the spread of ideas from epidemiological models. Phys. A: Stat. Mech. Appl. 364, 513–536 (2006)

    Article  Google Scholar 

  4. Bozanis, P., Kitsios, N., Makris, C., Tsakalidis, A.: New upper bounds for generalized intersection searching problems. In: Fülöp, Z., Gécseg, F. (eds.) ICALP 1995. LNCS, vol. 944, pp. 464–474. Springer, Heidelberg (1995). doi:10.1007/3-540-60084-1_97

    Chapter  Google Scholar 

  5. Centola, D., Macy, M.: Complex contagions and the weakness of long ties. Am. J. Sociol. 113(3), 702–734 (2007)

    Article  Google Scholar 

  6. Chanchary, F., Maheshwari, A.: Counting subgraphs in relational event graphs. In: Kaykobad, M., Petreschi, R. (eds.) WALCOM 2016. LNCS, vol. 9627, pp. 194–206. Springer, Heidelberg (2016). doi:10.1007/978-3-319-30139-6_16

    Chapter  Google Scholar 

  7. Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J. Comput. 14(1), 210–223 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  8. De Berg, M., Van Kreveld, M., Overmars, M., Schwarzkopf, O.C.: Computational Geometry. Springer, Heidelberg (2000)

    Book  MATH  Google Scholar 

  9. Easley, D., Kleinberg, J.: Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, Cambridge (2010)

    Book  MATH  Google Scholar 

  10. Gargano, L., Hell, P., Peters, J.G., Vaccaro, U.: Influence diffusion in social networks under time window constraints. Theor. Comput. Sci. 584, 53–66 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  11. Gupta, P., Janardan, R., Rahul, S., Smid, M.: Computational geometry: generalized (or colored) intersection searching. In: Handbook of Data Structures and Applications, 2nd edn. (in press)

    Google Scholar 

  12. Gupta, P., Janardan, R., Smid, M.: Further results on generalized intersection searching problems: counting, reporting, and dynamization. J. Algorithms 19(2), 282–317 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  13. Harary, F.: Graph Theory. Addison-Wesley, Reading (1969)

    MATH  Google Scholar 

  14. Janardan, R., Lopez, M.: Generalized intersection searching problems. Int. J. Comput. Geom. Appl. 3(01), 39–69 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  15. McCreight, E.M.: Priority search trees. SIAM J. Comput. 14(2), 257–276 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  16. Meghanathan, N.: A greedy algorithm for neighborhood overlap-based community detection. Algorithms 9(1), 8 (2016)

    Article  MathSciNet  Google Scholar 

  17. Santoro, N., Quattrociocchi, W., Flocchini, P., Casteigts, A., Amblard, F.: Time-varying graphs and social network analysis: temporal indicators and metrics. In: 3rd AISB SNAMAS, pp. 32–38 (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Carleton University, Ottawa, Ontario, K1S 5B6, Canada

    Farah Chanchary, Anil Maheshwari & Michiel Smid

Authors
  1. Farah Chanchary
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anil Maheshwari
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michiel Smid
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Farah Chanchary .

Editor information

Editors and Affiliations

  1. University of Lethbridge, Lethbridge, Alberta, Canada

    Daya Gaur

  2. Indian Institute of Technology Madras, Chennai, India

    N.S. Narayanaswamy

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Chanchary, F., Maheshwari, A., Smid, M. (2017). Querying Relational Event Graphs Using Colored Range Searching Data Structures. In: Gaur, D., Narayanaswamy, N. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2017. Lecture Notes in Computer Science(), vol 10156. Springer, Cham. https://doi.org/10.1007/978-3-319-53007-9_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-53007-9_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-53006-2

  • Online ISBN: 978-3-319-53007-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation