Crane: An Accurate and Scalable Neural Sketch for Graph Stream Summarization
Preprint
Abstract
Graph streams are rapidly evolving sequences of edges that convey continuously changing relationships among entities, playing a crucial role in domains such as networking, finance, and cybersecurity. Their massive scale and high dynamism make obtaining accurate statistics challenging with limited memory constraints. Traditional methods summarize graph streams through hand-crafted sketches, while recent studies have begun to replace these sketches with neural counterparts to improve adaptability and accuracy. However, this shift faces a major challenge: under limited memory, dominant frequent items tend to overshadow rare ones, hindering the neural network's ability to recover accurate statistics. To address this, we propose Crane, a hierarchical neural sketch architecture for graph stream summarization. Crane uses a hierarchical carry mechanism that automatically elevates frequent items to higher memory layers, reducing interference between frequent and infrequent items within the same layer. To better accommodate real-world deployment, Crane further adopts an adaptive memory expansion strategy that dynamically adds new layers once the occupancy of the top layer exceeds a threshold, enabling scalability across diverse data magnitudes. Extensive experiments on various datasets ranging from 20K to 60M edges demonstrate that Crane reduces estimation error by roughly 10x compared to state-of-the-art methods.Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- A survey on transactional stream processingThe VLDB Journal, 2023
- Graph Stream Sketch: Summarizing Graph Streams With High Speed and AccuracyIEEE Transactions on Knowledge and Data Engineering, 2022
- Enhanced Privacy Preserving Group Nearest Neighbor SearchIEEE Transactions on Knowledge and Data Engineering, 2019
- Hybrid computing using a neural network with dynamic external memoryNature, 2016
- Event detection over twitter social media streamsThe VLDB Journal, 2013
- An improved data stream summary: the count-min sketch and its applicationsJournal of Algorithms, 2005
- Finding frequent items in data streamsTheoretical Computer Science, 2004