EAGr: Supporting Continuous Ego-centric Aggregate Queries over Large Dynamic Graphs
Summary: Proposes EAGr, an in-memory system for ego-centric aggregates on dynamic graphs. Aggregation overlay graph enables sharing partial results and precomputation for low-latency updates and scalable single-machine deployment (up to 320M nodes/edges, 500k+ ops/s). (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Jayanta Mondal (University of Maryland)
- 2. Amol Deshpande (University of Maryland)
BibTeX Citation
@inproceedings{mondal_sigmod14,
title = {{EAGr: Supporting Continuous Ego-centric Aggregate Queries over Large Dynamic Graphs}},
author = {Mondal, Jayanta and Deshpande, Amol},
series = {{SIGMOD} '14},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2588555.2612182},
url = {https://dl.acm.org/doi/10.1145/2588555.2612182},
year = {2014}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,722 | Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming | 2021 | VLDB | 6.5438628e-05 |
| 8,502 | MWP: Multi-Window Parallel Evaluation of Regular Path Queries on Streaming Graphs | 2024 | SIGMOD | 5.4132367e-05 |
| 9,207 | Behavior Query Discovery in System-Generated Temporal Graphs | 2016 | VLDB | 5.3058708e-05 |
| 11,196 | A Universal Sketch for Estimating Heavy Hitters and Per-Element Frequency Moments in Data Streams with Bounded Deletions | 2024 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 106 | The MADlib Analytics Library or MAD Skills, the SQL | 2012 | VLDB | 0.00033539462 |
| 161 | Mining Frequent Patterns without Candidate Generation | 2000 | SIGMOD | 0.00027981772 |
| 1,263 | Resource Sharing in Continuous Sliding-Window Aggregates | 2004 | VLDB | 0.00011425419 |
| 1,354 | On-the-Fly Sharing for Streamed Aggregation | 2006 | SIGMOD | 0.00011057534 |
| 1,676 | Feeding Frenzy: Selectively Materializing Users' Event Feeds | 2010 | SIGMOD | 0.00010034449 |
| 3,109 | Managing Large Dynamic Graphs Efficiently | 2012 | SIGMOD | 7.7482727e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,616 | ACGraph: An Efficient Asynchronous Out-of-Core Graph Processing Framework | 2026 | SIGMOD |
| 2 | 10,972 | GraphCSR: A Degree-Equalized CSR Format for Large-scale Graph Processing | 2025 | VLDB |
| 3 | 3,594 | On Querying Historical Evolving Graph Sequences | 2011 | VLDB |
| 4 | 1,803 | Towards Effective Partition Management for Large Graphs | 2012 | SIGMOD |
| 5 | 7,900 | Distributed Graph Embedding with Information-Oriented Random Walks | 2023 | VLDB |
| 6 | 1,875 | Large-Scale Distributed Graph Computing Systems: An Experimental Evaluation | 2015 | VLDB |
| 7 | 7,897 | AeonG: An Efficient Built-in Temporal Support in Graph Databases | 2024 | VLDB |
| 8 | 10,922 | When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction | 2025 | VLDB |
| 9 | 7,281 | A General-Purpose Query-Centric Framework for Querying Big Graphs | 2016 | VLDB |
| 10 | 3,109 | Managing Large Dynamic Graphs Efficiently | 2012 | SIGMOD |