Abstract©2016 ACM. Retrieving historical information in a short time is a crucial objective in dynamic graphs. Some of the existing dynamic graph models use log-files to store the graph evolution history. These log-files store the history as a set of events sorted by their occurrence time. For answering a historical query on these models, the snapshot at the given historic time instant must be constructed first. Since the log-file events are sorted by time, the construction of a historical snapshot mandates that all events must be parsed and applied till the target time. Thus, the snapshot construction consumes a lot of time. However, these models provide accurate results. That is why, it is of a significant importance to provide accurate and fast results. In this paper, we present a log-file structure that is able to efficiently handle both accuracy and performance.
|Issue Date||9-May-2016||Journal||ACM International Conference Proceeding Series||URI||http://research.asu.edu.eg/123456789/1024||ISBN||9781450340625||DOI||http://api.elsevier.com/content/abstract/scopus_id/84998694313
Recommend this item
Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.