Time Traveling in Graphs using a Graph Database.
Konstantinos Semertzidis, Evaggelia Pitoura · 2016
Most graph structured data, such as data created from the web, social, citation and computer networks, evolve over time. In this paper, we assume that we are given the his-tory of a graph in the form of a sequence of graph snapshots. Our goal is to dene the different types of queries that one can ask regarding the graph history and present an initial approach to storing graph snapshots and processing histor-ical queries in a native graph database. We dene three general types of historical queries, namely, historical graph queries, historical time queries and historical top-k queries. We present two representations of graph snapshots that use either a single or a multi-edge approach. We evaluate the two approaches experimentally for various types of historical reachability queries.