Journal
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
Volume 32, Issue 3, Pages 424-437Publisher
IEEE COMPUTER SOC
DOI: 10.1109/TKDE.2019.2891565
Keywords
Semantics; Parallel processing; Time factors; Syntactics; Databases; Prototypes; Standards; ChronoGraph; temporal networks; temporal graph; graph traversal language; temporal aggregation; parallelism
Categories
Funding
- Institute for Information & communications Technology Promotion (IITP) - Korea government (MSIP) [R0126-15-1002]
- International Research & Development Program of the National Research Foundation of Korea(NRF) - Ministry of Science, ICT & Future Planning of Korea [2016K1A3A7A03952054]
- Ministry of Public Safety & Security (MPSS), Republic of Korea [R0126-15-1002] Funding Source: Korea Institute of Science & Technology Information (KISTI), National Science & Technology Information Service (NTIS)
- National Research Foundation of Korea [2016K1A3A7A03952054] Funding Source: Korea Institute of Science & Technology Information (KISTI), National Science & Technology Information Service (NTIS)
Ask authors/readers for more resources
ChronoGraph is a novel system enabling temporal graph traversals. Compared to snapshot-oriented systems, this traversal-oriented system is suitable for analyzing information diffusion over time without violating a time constraint on temporal paths. The cornerstone of ChronoGraph aims at bridging the chasm between point-based semantics and period-based semantics and the gap between temporal graph traversals and static graph traversals. Therefore, our graph model and traversal language provide the temporal syntax for both semantics, and we present a method converting point-based semantics to period-based ones. Also, ChronoGraph exploits the temporal support and parallelism to handle the temporal degree, which explosively increases compared to static graphs. We demonstrate how three traversal recipes can be implemented on top of our system: temporal breadth-first search (tBFS), temporal depth-first search (tDFS), and temporal single source shortest path (tSSSP). According to our evaluation, our temporal support and parallelism enhance temporal graph traversals in terms of convenience and efficiency. Also, ChronoGraph outperforms existing property graph databases in terms of temporal graph traversals. We prototype ChronoGraph by extending Tinkerpop, a de facto standard for property graphs. Therefore, we expect that our system would be readily accessible to existing property graph users.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available