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

Additional Metadata
Keywords Colored range searching, Relational event graph, Social network analysis, Timestamp
Persistent URL dx.doi.org/10.1007/978-3-319-53007-9_8
Series Lecture Notes in Computer Science
Citation
Chanchary, F. (Farah), Maheshwari, A, & Smid, M. (2017). Querying relational event graphs using colored range searching data structures. In Lecture Notes in Computer Science. doi:10.1007/978-3-319-53007-9_8