{TEGRA}: Efficient {Ad-Hoc} analytics on evolving graphs

AP Iyer, Q Pu, K Patel, JE Gonzalez… - 18th USENIX Symposium …, 2021 - usenix.org
Several emerging evolving graph application workloads demand support for efficient ad-hoc
analytics—the ability to perform ad-hoc queries on arbitrary time windows of the graph. We …

Monarch: Gaining Command on {Geo-Distributed} Graph Analytics

AP Iyer, A Panda, M Chowdhury, A Akella… - 10th USENIX Workshop …, 2018 - usenix.org
A number of existing and emerging application scenarios generate graph-structured data in
a geo-distributed fashion. Although there is a lot of interest in distributed graph processing …

Reordering and Compression for Hypergraph Processing

Y Liu, Q Luo, M Xiao, D Yu, H Chen… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
Hypergraphs are applicable to various domains such as social contagion, online groups,
and protein structures due to their effective modeling of multivariate relationships. However …

Vertex-and-edge ordering for faster parallel graph processing

A Trostanovsky - 2023 - open.library.ubc.ca
Graph structured data, which models complex relationships, describes data in myriad
domains, such as social network analysis, protein structure analysis, and supply chain …

Scalable Systems for Large Scale Dynamic Connected Data Processing

A Padmanabha Iyer - 2019 - escholarship.org
As the proliferation of sensors rapidly make the Internet-of-Things (IoT) a reality, the devices
and sensors in this ecosystem—such as smartphones, video cameras, home automation …

効率的なグラフ分析のための実行時並列リオーダリング

新井淳也, 塩川浩昭, 山室健, 鬼塚真… - … 情報通信学会論文誌 D, 2019 - search.ieice.org
グラフ分析におけるメモリアクセスの局所性を向上させるため, 頂点リオーダリングによってデータ
配置を事前に最適化するアプローチが広く用いられている. しかしながら既存のアルゴリズムは効果 …