Accelerating Streaming Subgraph Matching via Vector Databases
Graphs are widely used in applications such as social network analysis, bioinformatics, and recommendation systems to represent relationships and complex dependencies. Subgraph matching, which involves finding instances of a query subgraph within a larger graph, is crucial for tasks such as fraud de...
Saved in:
| Main Authors: | Liuyi Chen, Yi Ding, Xushuo Tang, Fangyue Chen, Siyuan Gong, Xu Zhou, Zhengyi Yang |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
American Association for the Advancement of Science (AAAS)
2025-01-01
|
| Series: | Intelligent Computing |
| Online Access: | https://spj.science.org/doi/10.34133/icomputing.0131 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
ENDNet: Extra-Node Decision Network for Subgraph Matching
by: Masaki Shirotani, et al.
Published: (2025-01-01) -
The index-based subgraph matching algorithm (ISMA): fast subgraph enumeration in large networks using optimized search trees.
by: Sofie Demeyer, et al.
Published: (2013-01-01) -
SymmPi: Exploiting Symmetry Removal for Fast Subgraph Matching
by: Yujiang Wang, et al.
Published: (2025-01-01) -
SGIR-Tree: Integrating R-Tree Spatial Indexing as Subgraphs in Graph Database Management Systems
by: Juyoung Kim, et al.
Published: (2024-09-01) -
Federated Subgraph Learning via Global-Knowledge-Guided Node Generation
by: Yuxuan Liu, et al.
Published: (2025-04-01)