Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding (Technical Report)
Fuente:
arXiv
Saved in:
| Main Authors: | Ye, Yutong, Lian, Xiang, Chen, Mingsong |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings (Technical Report)
by: Ye, Yutong, et al.
Published: (2024)
by: Ye, Yutong, et al.
Published: (2024)
S3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics (Technical Report)
by: Wen, Qi, et al.
Published: (2025)
by: Wen, Qi, et al.
Published: (2025)
GNN-based Anchor Embedding for Efficient Exact Subgraph Matching
by: Yang, Bin, et al.
Published: (2025)
by: Yang, Bin, et al.
Published: (2025)
LIVE: Learnable Monotonic Vertex Embedding for Efficient Exact Subgraph Matching (Technical Report)
by: Ye, Yutong, et al.
Published: (2026)
by: Ye, Yutong, et al.
Published: (2026)
S$^3$GND: An Effective Learning-Based Approach for Subgraph Similarity Search Under Generalized Neighbor Difference Semantics (Technical Report)
by: Wen, Qi, et al.
Published: (2026)
by: Wen, Qi, et al.
Published: (2026)
Efficient Community Detection Over Streaming Bipartite Networks (Technical Report)
by: Zhang, Nan, et al.
Published: (2024)
by: Zhang, Nan, et al.
Published: (2024)
Top-L Most Influential Community Detection Over Social Networks (Technical Report)
by: Zhang, Nan, et al.
Published: (2023)
by: Zhang, Nan, et al.
Published: (2023)
Reverse Influential Community Search Over Social Networks (Technical Report)
by: Wen, Qi, et al.
Published: (2024)
by: Wen, Qi, et al.
Published: (2024)
Efficient Distributed Exact Subgraph Matching via GNN-PE: Load Balancing, Cache Optimization, and Query Plan Ranking
by: Wang, Yu, et al.
Published: (2025)
by: Wang, Yu, et al.
Published: (2025)
GCLS$^2$: Towards Efficient Community Detection Using Graph Contrastive Learning with Structure Semantics
by: Wen, Qi, et al.
Published: (2024)
by: Wen, Qi, et al.
Published: (2024)
Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching
by: Chen, Liuyi, et al.
Published: (2025)
by: Chen, Liuyi, et al.
Published: (2025)
gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs
by: Chen, Weitian, et al.
Published: (2026)
by: Chen, Weitian, et al.
Published: (2026)
Dupin: A Parallel Framework for Densest Subgraph Discovery in Fraud Detection on Massive Graphs (Technical Report)
by: Jiang, Jiaxin, et al.
Published: (2025)
by: Jiang, Jiaxin, et al.
Published: (2025)
XMiner: Efficient Directed Subgraph Matching with Pattern Reduction
by: Yuan, Pingpeng, et al.
Published: (2024)
by: Yuan, Pingpeng, et al.
Published: (2024)
Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach
by: Shin, Wonseok, et al.
Published: (2023)
by: Shin, Wonseok, et al.
Published: (2023)
CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination
by: Yang, Linglin, et al.
Published: (2026)
by: Yang, Linglin, et al.
Published: (2026)
GraphMatch: Subgraph Query Processing on FPGAs
by: Dann, Jonas, et al.
Published: (2024)
by: Dann, Jonas, et al.
Published: (2024)
DIST: Efficient k-Clique Listing via Induced Subgraph Trie
by: Nam, Yehyun, et al.
Published: (2025)
by: Nam, Yehyun, et al.
Published: (2025)
BEACON: Budget-Aware Entity Matching Across Domains (Extended Technical Report)
by: Pulsone, Nicholas, et al.
Published: (2026)
by: Pulsone, Nicholas, et al.
Published: (2026)
Efficient Learned Query Execution over Text and Tables [Technical Report]
by: Urban, Matthias, et al.
Published: (2024)
by: Urban, Matthias, et al.
Published: (2024)
Efficient Temporal Simple Path Graph Generation
by: Tang, Zhiyang, et al.
Published: (2025)
by: Tang, Zhiyang, et al.
Published: (2025)
Novel Table Search [Technical Report]
by: Kassaie, Besat, et al.
Published: (2026)
by: Kassaie, Besat, et al.
Published: (2026)
RLMiner: Finding the Most Frequent k-sized Subgraph via Reinforcement Learning
by: Huang, Wei, et al.
Published: (2026)
by: Huang, Wei, et al.
Published: (2026)
Efficient Multiple Temporal Network Kernel Density Estimation
by: Shao, Yu, et al.
Published: (2025)
by: Shao, Yu, et al.
Published: (2025)
NeuSO: Neural Optimizer for Subgraph Queries
by: Yang, Linglin, et al.
Published: (2025)
by: Yang, Linglin, et al.
Published: (2025)
Privacy-Enhanced Database Synthesis for Benchmark Publishing (Technical Report)
by: Ge, Yunqing, et al.
Published: (2024)
by: Ge, Yunqing, et al.
Published: (2024)
Efficient Hypergraph Pattern Matching via Match-and-Filter and Intersection Constraint
by: Song, Siwoo, et al.
Published: (2025)
by: Song, Siwoo, et al.
Published: (2025)
Optimal $(α,β)$-Dense Subgraph Search in Bipartite Graphs
by: Zhang, Yalong, et al.
Published: (2025)
by: Zhang, Yalong, et al.
Published: (2025)
Finding Locally Densest Subgraphs: Convex Programming with Edge and Triangle Density
by: Yang, Yi, et al.
Published: (2025)
by: Yang, Yi, et al.
Published: (2025)
Color: A Framework for Applying Graph Coloring to Subgraph Cardinality Estimation
by: Deeds, Kyle, et al.
Published: (2024)
by: Deeds, Kyle, et al.
Published: (2024)
Efficient Path Query Processing in Relational Database Systems
by: Correa, Diego Rivera, et al.
Published: (2026)
by: Correa, Diego Rivera, et al.
Published: (2026)
Automated Data Quality Validation in an End-to-End GNN Framework
by: Dong, Sijie, et al.
Published: (2025)
by: Dong, Sijie, et al.
Published: (2025)
Diverse Unionable Tuple Search: Novelty-Driven Discovery in Data Lakes [Technical Report]
by: Khatiwada, Aamod, et al.
Published: (2025)
by: Khatiwada, Aamod, et al.
Published: (2025)
Less is More: Efficient Time Series Dataset Condensation via Two-fold Modal Matching--Extended Version
by: Miao, Hao, et al.
Published: (2024)
by: Miao, Hao, et al.
Published: (2024)
SliceGX: Layer-wise GNN Explanation with Model-slicing
by: Zhu, Tingting, et al.
Published: (2025)
by: Zhu, Tingting, et al.
Published: (2025)
Efficient k-step Weighted Reachability Query Processing Algorithms
by: Mei, Congquan, et al.
Published: (2024)
by: Mei, Congquan, et al.
Published: (2024)
Cost-Efficient RAG for Entity Matching with LLMs: A Blocking-based Exploration
by: Ma, Chuangtao, et al.
Published: (2026)
by: Ma, Chuangtao, et al.
Published: (2026)
SHARP: Shared State Reduction for Efficient Matching of Sequential Patterns
by: Yu, Cong, et al.
Published: (2025)
by: Yu, Cong, et al.
Published: (2025)
TKHist: Cardinality Estimation for Join Queries via Histograms with Dominant Attribute Correlation Finding
by: Li, Renrui, et al.
Published: (2025)
by: Li, Renrui, et al.
Published: (2025)
FLEXIS: FLEXible Frequent Subgraph Mining using Maximal Independent Sets
by: Sharma, Akshit, et al.
Published: (2024)
by: Sharma, Akshit, et al.
Published: (2024)
Similar Items
-
Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings (Technical Report)
by: Ye, Yutong, et al.
Published: (2024) -
S3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics (Technical Report)
by: Wen, Qi, et al.
Published: (2025) -
GNN-based Anchor Embedding for Efficient Exact Subgraph Matching
by: Yang, Bin, et al.
Published: (2025) -
LIVE: Learnable Monotonic Vertex Embedding for Efficient Exact Subgraph Matching (Technical Report)
by: Ye, Yutong, et al.
Published: (2026) -
S$^3$GND: An Effective Learning-Based Approach for Subgraph Similarity Search Under Generalized Neighbor Difference Semantics (Technical Report)
by: Wen, Qi, et al.
Published: (2026)