Abstract:
The growing popularity of dynamic applications such as social networks provides a promising way to detect valuable information in real time. These applications create hig...Show MoreMetadata
Abstract:
The growing popularity of dynamic applications such as social networks provides a promising way to detect valuable information in real time. These applications create high-speed data that can be easily modeled as streaming graph. Efficient analysis over these data is of great significance. In this paper, we study the subgraph (isomorphism) search over streaming graph data that obeys timing order constraints over the occurrence of edges in the stream. The sliding window model is employed to focus on the most recent data. We propose an efficient solution to answer subgraph search, introduce optimizations to greatly reduce the space cost, and design concurrency management to improve system throughput. Extensive experiments on real network traffic data and synthetic social streaming data shows that our solution outperforms comparative ones by one order of magnitude with less space cost.
Published in: IEEE Transactions on Knowledge and Data Engineering ( Volume: 34, Issue: 9, 01 September 2022)