Skip to content
RDL
Network
Ekosistem
Uygulama değiştir
EN
Hakkımızda
SSS
Giriş yap
Başla
Time-evolving graph processing at scale — Anand Iyer (2016) | RDL Network
Back
Cite
Save
Save for later
Share
Home
Publications
Time-evolving graph processing at scale
Shared by
Ion Stoica
University of California, Berkeley
Time-evolving graph processing at scale
Article
2016
en
Authors
+1 more
AI
Anand Iyer
LL
Li Erran Li
TD
Tathagata Das
Abstract
1 min read
Time-evolving graph-structured big data arises naturally in many application domains such as social networks and communication networks. However, existing graph processing systems lack support for efficient computations on dynamic graphs.
Discussion
(0)
Sign in
to like and join the discussion.
No comments yet. Be the first to comment.
Related publications
Article
2015
CellIQ: real-time cellular network analytics at scale
Anand Iyer
,
Li Erran Li
,
Ion Stoica
Article
2013
GraphX
Reynold Xin
,
Joseph E. Gonzalez
,
Michael J. Franklin
,
Ion Stoica
Preprint
2014
GraphX: Unifying Data-Parallel and Graph-Parallel Analytics
Reynold Xin
,
Daniel Crankshaw
,
Ankur Dave
,
Joseph E. Gonzalez
,
Michael J. Franklin
,
Ion Stoica
Preprint
2013
Sparse Allreduce: Efficient Scalable Communication for Power-Law Data
Huasha Zhao
,
John F Canny
Article
2020
Continuous-Time Dynamic Graph Learning via Neural Interaction Processes
Xiaofu Chang
,
Xuqin Liu
,
Jianfeng Wen
,
Shuang Li
,
Yanming Fang
,
Le Song
,
Qi Yuan
Discussion(0)
No comments yet. Be the first to comment.