research-article

Chronos: a graph engine for temporal graph analysis

Authors:

Vijayan Prabhakaran,

Enhong ChenAuthors Info & Claims

EuroSys '14: Proceedings of the Ninth European Conference on Computer Systems

Article No.: 1, Pages 1 - 14

https://doi.org/10.1145/2592798.2592799

Published: 14 April 2014 Publication History

Abstract

Temporal graphs capture changes in graphs over time and are becoming a subject that attracts increasing interest from the research communities, for example, to understand temporal characteristics of social interactions on a time-evolving social graph. Chronos is a storage and execution engine designed and optimized specifically for running in-memory iterative graph computation on temporal graphs. Locality is at the center of the Chronos design, where the in-memory layout of temporal graphs and the scheduling of the iterative computation on temporal graphs are carefully designed, so that common "bulk" operations on temporal graphs are scheduled to maximize the benefit of in-memory data locality. The design of Chronos further explores the interesting interplay among locality, parallelism, and incremental computation in supporting common mining tasks on temporal graphs. The result is a high-performance temporal-graph system that offers up to an order of magnitude speedup for temporal iterative graph mining compared to a straightforward application of existing graph engines on a series of snapshots.

References

[1]

C. C. Aggarwal and H. Wang, editors. Managing and Mining Graph Data, volume 40 of Advances in Database Systems. Springer, 2010.

Digital Library

[2]

P. Boldi, M. Santini, and S. Vigna. A large time-aware web graph. SIGIR Forum, 42(2):33--38, 2008.

Digital Library

[3]

S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. Computer Networks, 30(1-7):107--117, 1998.

Digital Library

[4]

R. Chen, J. Shi, Y. Chen, H. Guan, B. Zang, and H. Chen. Powerlyra: Differentiated graph computation and partitioning on skewed graphs. Technical Report IPADSTR-2013-001, Shanghai Jiao Tong Univ., 2013.

[5]

R. Cheng, J. Hong, A. Kyrola, Y. Miao, X. Weng, M. Wu, F. Yang, L. Zhou, F. Zhao, and E. Chen. Kineograph: taking the pulse of a fast-changing and connected world. In EuroSys, pages 85--98. ACM, 2012.

Digital Library

[6]

M. Frigo, C. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In FOCS, 1999.

Digital Library

[7]

J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin. Powergraph: distributed graph-parallel computation on natural graphs. In OSDI, pages 17--30, 2012.

Digital Library

[8]

G. Karypis and V. Kumar. METIS - unstructured graph partitioning and sparse matrix ordering system, ver 2.0. Technical report, Univ. of Minnesota, 1995.

[9]

Z. Khayyat, K. Awara, A. Alonazi, H. Jamjoom, D. Williams, and P. Kalnis. Mizan: a system for dynamic load balancing in large-scale graph processing. In EuroSys, pages 169--182, 2013.

Digital Library

[10]

U. Khurana and A. Deshpande. Efficient snapshot retrieval over historical graph data. In ICDE, 2013.

Digital Library

[11]

A. Kyrola, G. Blelloch, and C. Guestrin. GraphChi: large-scale graph computation on just a PC. In OSDI, volume 8, pages 31--46, 2012.

Digital Library

[12]

K. Lerman, R. Ghosh, and J. H. Kang. Centrality metric for dynamic networks. In MLG, pages 70--77, 2010.

Digital Library

[13]

J. Leskovec, J. Kleinberg, and C. Faloutsos. Graphs over time: densification laws, shrinking diameters and possible explanations. In KDD, pages 177--187, 2005.

Digital Library

[14]

D. Lomet, R. Barga, M. F. Mokbel, G. Shegalov, R. Wang, and Y. Zhu. Immortal db: transaction time support for SQL server. In SIGMOD, 2005.

Digital Library

[15]

D. Lomet and B. Salzberg. Access methods for multiversion data. In SIGMOD, pages 315--324, 1989.

Digital Library

[16]

Y. Low, D. Bickson, J. Gonzalez, C. Guestrin, A. Kyrola, and J. M. Hellerstein. Distributed GraphLab: a framework for machine learning and data mining in the cloud. PVLDB, 5(8):716--727, Apr. 2012.

Digital Library

[17]

G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. Pregel: a system for large-scale graph processing. In SIGMOD, pages 135--146, 2010.

Digital Library

[18]

A. Mislove. Online social networks: measurement, analysis, and applications to distributed information systems. PhD thesis, Rice University, 2009.

Digital Library

[19]

D. Murray, F. McSherry, R. Isaacs, M. Isard, P. Barham, and M. Abadi. Naiad: a timely dataflow system. In SOSP, pages 439--455, 2013.

Digital Library

[20]

D. Nguyen, A. Lenharth, and K. Pingali. A lightweight infrastructure for graph analytics. In SOSP, pages 456--471, 2013.

Digital Library

[21]

PostgreSQL. PostgreSQL, 2013. http://postgresql.org.

[22]

R. Power and J. Li. Piccolo: Building fast, distributed programs with partitioned tables. In OSDI, pages 1--14, 2010.

Digital Library

[23]

V. Prabhakaran, M. Wu, X. Weng, F. McSherry, L. Zhou, and M. Haridasan. Managing large graphs on multi-cores with graph awareness. In USENIX ATC, volume 12, 2012.

Digital Library

[24]

C. Ren, E. Lo, B. Kao, X. Zhu, and R. Cheng. On querying historical evolving graph sequences. PVLDB, 4(11):726--737, 2011.

Digital Library

[25]

L. Roditty and U. Zwick. On dynamic shortest paths problems. In ESA, pages 580--591, 2004.

[26]

D. M. Romero, B. Meeder, and J. Kleinberg. Differences in the mechanics of information diffusion across topics: idioms, political hashtags, and complex contagion on twitter. In WWW, pages 695--704, 2011.

Digital Library

[27]

A. Roy, I. Mihailovic, and W. Zwaenepoel. X-stream: edge-centric graph processing using streaming partitions. In SOSP, pages 472--488, 2013.

Digital Library

[28]

B. Salzberg and V. J. Tsotras. Comparison of access methods for time-evolving data. ACM Comput. Surv., 31(2):158--221, June 1999.

Digital Library

[29]

J. Shun and G. E. Blelloch. Ligra: a lightweight graph processing framework for shared memory. In PPoPP, pages 135--146, 2013.

Digital Library

[30]

Sina. Weibo, 2013. http://weibo.com.

[31]

S. Venkataraman, E. Bodzsar, I. Roy, A. AuYoung, and R. Schreiber. Presto: distributed machine learning and graph processing with sparse matrices. In EuroSys, pages 197--210, 2013.

Digital Library

[32]

C. Wilson, B. Boe, R. Sala, K. P. N. Puttaswamy, and B. Y. Zhao. User interactions in social networks and their implications. In EuroSys, pages 205--218, 2009.

Digital Library

[33]

L. Yang, L. Qi, Y.-P. Zhao, B. Gao, and T.-Y. Liu. Link analysis using time series of web graphs. In CIKM, pages 1011--1014, 2007.

Digital Library

[34]

M. Zaharia, M. Chowdhury, T. Das, A. Dave, J. Ma, M. McCauley, M. Franklin, S. Shenker, and I. Stoica. Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing. In NSDI, pages 2--2, 2012.

Digital Library

[35]

R. Zhang and M. Stradling. The HV-tree: a memory hierarchy aware version index. PVLDB, 3(1--2):397--408, Sept. 2010.

Digital Library

Cited By

Chen YJiang JSun SHe BChen M(2024)RUSH: Real-Time Burst Subgraph Detection in Dynamic GraphsProceedings of the VLDB Endowment10.14778/3681954.368202817:11(3657-3665)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.14778/3681954.3682028
Yin XZhao ZGupta R(2024)IncBoost: Scaling Incremental Graph Processing for Edge Deletions and Weight UpdatesProceedings of the 2024 ACM Symposium on Cloud Computing10.1145/3698038.3698524(915-932)Online publication date: 20-Nov-2024
https://dl.acm.org/doi/10.1145/3698038.3698524
Fouquet FHartmann TCecchinel CCombemale BCombemale BWimmer MChechik MEgyed A(2024)GreyCat: A Framework to Develop Digital Twins at Large ScaleProceedings of the ACM/IEEE 27th International Conference on Model Driven Engineering Languages and Systems10.1145/3652620.3688265(492-495)Online publication date: 22-Sep-2024
https://dl.acm.org/doi/10.1145/3652620.3688265
Show More Cited By

Recommendations

CHRONOS: A Tool for Handling Temporal Ontologies in Protégé
ICTAI '12: Proceedings of the 2012 IEEE 24th International Conference on Tools with Artificial Intelligence - Volume 01

Representing information evolving in time in ontologies is a difficult problem to deal with. Temporal relations are in fact ternary (i.e., properties of objects that change in time involve also a temporal value in addition to the object and the subject) ...
CHRONOS: Improving the Performance of Qualitative Temporal Reasoning in OWL
ICTAI '14: Proceedings of the 2014 IEEE 26th International Conference on Tools with Artificial Intelligence

We investigate on potential improvements to reasoning about qualitative temporal information in OWL. Building upon path consistency, the new reasoner design, referred to as CHRONOS, computes a minimal set of relation compositions at run-time (based on a ...
On the Multichromatic Number of s-Stable Kneser Graphs

For positive integers n and s, a subset Sï [n] is s-stable if sï |i-j|ï n-s for distinct i,j∈S . The s-stable r-uniform Kneser hypergraph KGrn,ks-stable is the r-uniform hypergraph that has the collection of all s-stable k-element subsets of [n] as ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

EuroSys '14: Proceedings of the Ninth European Conference on Computer Systems

April 2014

388 pages

ISBN:9781450327046

DOI:10.1145/2592798

General Chairs:
Dick Bultermann
CWI
,
Herbert Bos
Vrije Universiteit Amsterdam
,
Program Chairs:
Ant Rowstron
Microsoft Research Cambridge
,
Peter Druschel
MPI SWS

Copyright © 2014 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGOPS: ACM Special Interest Group on Operating Systems

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 April 2014

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Funding Sources

Conference

EuroSys 2014

Sponsor:

SIGOPS

EuroSys 2014: Ninth Eurosys Conference 2014

April 14 - 16, 2014

Amsterdam, The Netherlands

Acceptance Rates

EuroSys '14 Paper Acceptance Rate 27 of 147 submissions, 18%;

Overall Acceptance Rate 241 of 1,308 submissions, 18%

Upcoming Conference

EuroSys '25

Sponsor:
sigops

Twentieth European Conference on Computer Systems

March 30 - April 3, 2025

Rotterdam , Netherlands

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

153
Total Citations
View Citations
2,106
Total Downloads

Downloads (Last 12 months)127
Downloads (Last 6 weeks)8

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Chen YJiang JSun SHe BChen M(2024)RUSH: Real-Time Burst Subgraph Detection in Dynamic GraphsProceedings of the VLDB Endowment10.14778/3681954.368202817:11(3657-3665)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.14778/3681954.3682028
Yin XZhao ZGupta R(2024)IncBoost: Scaling Incremental Graph Processing for Edge Deletions and Weight UpdatesProceedings of the 2024 ACM Symposium on Cloud Computing10.1145/3698038.3698524(915-932)Online publication date: 20-Nov-2024
https://dl.acm.org/doi/10.1145/3698038.3698524
Fouquet FHartmann TCecchinel CCombemale BCombemale BWimmer MChechik MEgyed A(2024)GreyCat: A Framework to Develop Digital Twins at Large ScaleProceedings of the ACM/IEEE 27th International Conference on Model Driven Engineering Languages and Systems10.1145/3652620.3688265(492-495)Online publication date: 22-Sep-2024
https://dl.acm.org/doi/10.1145/3652620.3688265
Zhang SHe ZJing YZhang KWang X(2024)MWP: Multi-Window Parallel Evaluation of Regular Path Queries on Streaming GraphsProceedings of the ACM on Management of Data10.1145/36392602:1(1-26)Online publication date: 26-Mar-2024
https://dl.acm.org/doi/10.1145/3639260
Bhoot RGhanmode SSimmhan Y(2024)TARIS: Scalable Incremental Processing of Time-Respecting Algorithms on Streaming GraphsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2024.347157435:12(2527-2544)Online publication date: Dec-2024
https://doi.org/10.1109/TPDS.2024.3471574
Huan CLiu YZhang HLiu HChen SSong SWu Y(2024)TeGraph+: Scalable Temporal Graph Processing Enabling Flexible Edge ModificationsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2024.339391435:8(1469-1487)Online publication date: Aug-2024
https://doi.org/10.1109/TPDS.2024.3393914
Gaza HByun J(2024)Kairos: Enabling Prompt Monitoring of Information Diffusion Over Temporal NetworksIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.334762136:12(8607-8621)Online publication date: Dec-2024
https://doi.org/10.1109/TKDE.2023.3347621
Cheng YMa YJiang HZeng LWang FXu XWu Y(2024)TgStore: An Efficient Storage System for Large Time-Evolving GraphsIEEE Transactions on Big Data10.1109/TBDATA.2024.336608710:2(158-173)Online publication date: Apr-2024
https://doi.org/10.1109/TBDATA.2024.3366087
Xu YZhang WZhang YOrlowska MLin X(2024)TimeSGN: Scalable and Effective Temporal Graph Neural Network2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00255(3297-3310)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00255
Min SJang JPark KGiammarresi DItaliano GHan W(2024)Time-Constrained Continuous Subgraph Matching Using Temporal Information for Filtering and Backtracking2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00252(3257-3269)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00252
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents