Querying relational event graphs using colored range searching data structures
2019
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).
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
20
References
3
Citations
NaN
KQI