In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework
- Title
- In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework
- Authors
- HAN, WOOK SHIN; KIM, KYOUNG MIN; LEE, WONSEOK; YUKYOUNG, LEE
- Date Issued
- 2024-06-09
- Publisher
- ACM SIGMOD
- Abstract
- The continuous subgraph matching (CSM) problem aims to continuously detect patterns on a dynamic graph, with real-world applications such as fraud detection. Numerous methods have been proposed to address CSM, yet they lack fair comparisons. Furthermore, an existing unified framework for CSM shows misleading experimental results due to its suboptimal implementations. In this paper, we propose a new framework that generates CSM code from the logical and physical plans of delta queries with stacked views. By expressing each CSM method as a delta query plan, our framework enables fair comparisons of CSM methods. Through our comprehensive experiments, we make cause-and-effect arguments for the divergent performance trends from the previous papers and further analyze the individual impacts of various techniques on overall performance. Specifically, our CSM code for an old method significantly outperforms the most recent CSM method, CaLiG, by up to 48.6 times
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/122293
- Article Type
- Conference
- Citation
- 50th Int’l Conf. on Management of Data (ACM SIGMOD), 2024-06-09
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.