Efficient Distributed Exact Subgraph Matching via GNN-PE: Load Balancing, Cache Optimization, and Query Plan Ranking
Fuente:
arXiv
Saved in:
| Main Authors: | Wang, Yu, Wang, Hui, Ge, Jiake, Wang, Xin |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
GNN-based Anchor Embedding for Efficient Exact Subgraph Matching
by: Yang, Bin, et al.
Published: (2025)
by: Yang, Bin, et al.
Published: (2025)
Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding (Technical Report)
by: Ye, Yutong, et al.
Published: (2023)
by: Ye, Yutong, et al.
Published: (2023)
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)
GraphMatch: Subgraph Query Processing on FPGAs
by: Dann, Jonas, et al.
Published: (2024)
by: Dann, Jonas, et al.
Published: (2024)
NeuSO: Neural Optimizer for Subgraph Queries
by: Yang, Linglin, et al.
Published: (2025)
by: Yang, Linglin, 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)
XMiner: Efficient Directed Subgraph Matching with Pattern Reduction
by: Yuan, Pingpeng, et al.
Published: (2024)
by: Yuan, Pingpeng, et al.
Published: (2024)
Efficient Filtered-ANN via Learning-based Query Planning
by: Gan, Zhuocheng, et al.
Published: (2026)
by: Gan, Zhuocheng, et al.
Published: (2026)
CARPO: Leveraging Listwise Learning-to-Rank for Context-Aware Query Plan Optimization
by: Zhou, Wenrui, et al.
Published: (2025)
by: Zhou, Wenrui, et al.
Published: (2025)
Succinct Structure Representations for Efficient Query Optimization
by: Jiang, Zhekai, et al.
Published: (2026)
by: Jiang, Zhekai, et al.
Published: (2026)
QCFuse: Query-Centric Cache Fusion for Efficient RAG Inference
by: Yan, Jianxin, et al.
Published: (2026)
by: Yan, Jianxin, et al.
Published: (2026)
Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching
by: Chen, Liuyi, et al.
Published: (2025)
by: Chen, Liuyi, et al.
Published: (2025)
Efficient Enumeration of Recursive Plans in Transformation-based Query Optimizers
by: Fejza, Amela, et al.
Published: (2023)
by: Fejza, Amela, et al.
Published: (2023)
Learned Offline Query Planning via Bayesian Optimization
by: Tao, Jeffrey, et al.
Published: (2025)
by: Tao, Jeffrey, et al.
Published: (2025)
Efficient Query Rewrite Rule Discovery via Standardized Enumeration and Learning-to-Rank(extend)
by: Zhang, Yuan, et al.
Published: (2026)
by: Zhang, Yuan, 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)
Low Rank Learning for Offline Query Optimization
by: Yi, Zixuan, et al.
Published: (2025)
by: Yi, Zixuan, et al.
Published: (2025)
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)
Towards Selecting the Informative Alternative Relational Query Plans for Database Education
by: Wang, Hu, et al.
Published: (2022)
by: Wang, Hu, et al.
Published: (2022)
DIST: Efficient k-Clique Listing via Induced Subgraph Trie
by: Nam, Yehyun, et al.
Published: (2025)
by: Nam, Yehyun, et al.
Published: (2025)
Ranking Methods for Skyline Queries
by: Martin-Nevot, Mickaël, et al.
Published: (2025)
by: Martin-Nevot, Mickaël, et al.
Published: (2025)
Ranked Enumeration for Database Queries
by: Tziavelis, Nikolaos, et al.
Published: (2024)
by: Tziavelis, Nikolaos, et al.
Published: (2024)
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)
GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query
by: Ge, Mingchang, et al.
Published: (2025)
by: Ge, Mingchang, et al.
Published: (2025)
Training-Free Query Optimization via LLM-Based Plan Similarity
by: Vasilenko, Nikita, et al.
Published: (2025)
by: Vasilenko, Nikita, et al.
Published: (2025)
PARQO: Penalty-Aware Robust Plan Selection in Query Optimization
by: Xiu, Haibo, et al.
Published: (2024)
by: Xiu, Haibo, et al.
Published: (2024)
GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search
by: Zhou, Yijie, et al.
Published: (2025)
by: Zhou, Yijie, et al.
Published: (2025)
Ranked Enumeration of Conjunctive Query Results
by: Deep, Shaleen, et al.
Published: (2019)
by: Deep, Shaleen, et al.
Published: (2019)
Quantifying Point Contributions: A Lightweight Framework for Efficient and Effective Query-Driven Trajectory Simplification
by: Song, Yumeng, et al.
Published: (2025)
by: Song, Yumeng, et al.
Published: (2025)
SafeLoad: Efficient Admission Control Framework for Identifying Memory-Overloading Queries in Cloud Data Warehouses
by: Wu, Yifan, et al.
Published: (2026)
by: Wu, Yifan, et al.
Published: (2026)
FIER: Fine-Grained and Efficient KV Cache Retrieval for Long-context LLM Inference
by: Wang, Dongwei, et al.
Published: (2025)
by: Wang, Dongwei, 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)
ContextCache: Context-Aware Semantic Cache for Multi-Turn Queries in Large Language Models
by: Yan, Jianxin, et al.
Published: (2025)
by: Yan, Jianxin, et al.
Published: (2025)
CardOOD: Robust Query-driven Cardinality Estimation under Out-of-Distribution
by: Li, Rui, et al.
Published: (2024)
by: Li, Rui, et al.
Published: (2024)
QUEST: Query Optimization in Unstructured Document Analysis
by: Sun, Zhaoze, et al.
Published: (2025)
by: Sun, Zhaoze, et al.
Published: (2025)
Approximate Reverse $k$-Ranks Queries in High Dimensions
by: Amagata, Daichi, et al.
Published: (2025)
by: Amagata, Daichi, et al.
Published: (2025)
One-Hop Sub-Query Result Caches for Graph Database Systems
by: Nguyen, Hieu, et al.
Published: (2024)
by: Nguyen, Hieu, et al.
Published: (2024)
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)
Efficient Fault Tolerance for Pipelined Query Engines via Write-ahead Lineage
by: Wang, Ziheng, et al.
Published: (2024)
by: Wang, Ziheng, et al.
Published: (2024)
Similar Items
-
GNN-based Anchor Embedding for Efficient Exact Subgraph Matching
by: Yang, Bin, et al.
Published: (2025) -
Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding (Technical Report)
by: Ye, Yutong, et al.
Published: (2023) -
LIVE: Learnable Monotonic Vertex Embedding for Efficient Exact Subgraph Matching (Technical Report)
by: Ye, Yutong, et al.
Published: (2026) -
GraphMatch: Subgraph Query Processing on FPGAs
by: Dann, Jonas, et al.
Published: (2024) -
NeuSO: Neural Optimizer for Subgraph Queries
by: Yang, Linglin, et al.
Published: (2025)