Copertina

Efficient Distributed Exact Subgraph Matching via GNN-PE: Load Balancing, Cache Optimization, and Query Plan Ranking

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Wang, Yu, Wang, Hui, Ge, Jiake, Wang, Xin
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Databases
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

GNN-based Anchor Embedding for Efficient Exact Subgraph Matching
di: Yang, Bin, et al.
Pubblicazione: (2025)

Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding (Technical Report)
di: Ye, Yutong, et al.
Pubblicazione: (2023)

LIVE: Learnable Monotonic Vertex Embedding for Efficient Exact Subgraph Matching (Technical Report)
di: Ye, Yutong, et al.
Pubblicazione: (2026)

GraphMatch: Subgraph Query Processing on FPGAs
di: Dann, Jonas, et al.
Pubblicazione: (2024)

NeuSO: Neural Optimizer for Subgraph Queries
di: Yang, Linglin, et al.
Pubblicazione: (2025)

gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs
di: Chen, Weitian, et al.
Pubblicazione: (2026)

XMiner: Efficient Directed Subgraph Matching with Pattern Reduction
di: Yuan, Pingpeng, et al.
Pubblicazione: (2024)

Efficient Filtered-ANN via Learning-based Query Planning
di: Gan, Zhuocheng, et al.
Pubblicazione: (2026)

CARPO: Leveraging Listwise Learning-to-Rank for Context-Aware Query Plan Optimization
di: Zhou, Wenrui, et al.
Pubblicazione: (2025)

Succinct Structure Representations for Efficient Query Optimization
di: Jiang, Zhekai, et al.
Pubblicazione: (2026)

QCFuse: Query-Centric Cache Fusion for Efficient RAG Inference
di: Yan, Jianxin, et al.
Pubblicazione: (2026)

Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching
di: Chen, Liuyi, et al.
Pubblicazione: (2025)

Efficient Enumeration of Recursive Plans in Transformation-based Query Optimizers
di: Fejza, Amela, et al.
Pubblicazione: (2023)

Learned Offline Query Planning via Bayesian Optimization
di: Tao, Jeffrey, et al.
Pubblicazione: (2025)

Efficient Query Rewrite Rule Discovery via Standardized Enumeration and Learning-to-Rank(extend)
di: Zhang, Yuan, et al.
Pubblicazione: (2026)

RLMiner: Finding the Most Frequent k-sized Subgraph via Reinforcement Learning
di: Huang, Wei, et al.
Pubblicazione: (2026)

Low Rank Learning for Offline Query Optimization
di: Yi, Zixuan, et al.
Pubblicazione: (2025)

Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach
di: Shin, Wonseok, et al.
Pubblicazione: (2023)

CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination
di: Yang, Linglin, et al.
Pubblicazione: (2026)

Towards Selecting the Informative Alternative Relational Query Plans for Database Education
di: Wang, Hu, et al.
Pubblicazione: (2022)

DIST: Efficient k-Clique Listing via Induced Subgraph Trie
di: Nam, Yehyun, et al.
Pubblicazione: (2025)

Ranking Methods for Skyline Queries
di: Martin-Nevot, Mickaël, et al.
Pubblicazione: (2025)

Ranked Enumeration for Database Queries
di: Tziavelis, Nikolaos, et al.
Pubblicazione: (2024)

Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings (Technical Report)
di: Ye, Yutong, et al.
Pubblicazione: (2024)

GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query
di: Ge, Mingchang, et al.
Pubblicazione: (2025)

Training-Free Query Optimization via LLM-Based Plan Similarity
di: Vasilenko, Nikita, et al.
Pubblicazione: (2025)

PARQO: Penalty-Aware Robust Plan Selection in Query Optimization
di: Xiu, Haibo, et al.
Pubblicazione: (2024)

GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search
di: Zhou, Yijie, et al.
Pubblicazione: (2025)

Ranked Enumeration of Conjunctive Query Results
di: Deep, Shaleen, et al.
Pubblicazione: (2019)

Quantifying Point Contributions: A Lightweight Framework for Efficient and Effective Query-Driven Trajectory Simplification
di: Song, Yumeng, et al.
Pubblicazione: (2025)

SafeLoad: Efficient Admission Control Framework for Identifying Memory-Overloading Queries in Cloud Data Warehouses
di: Wu, Yifan, et al.
Pubblicazione: (2026)

FIER: Fine-Grained and Efficient KV Cache Retrieval for Long-context LLM Inference
di: Wang, Dongwei, et al.
Pubblicazione: (2025)

Optimal $(α,β)$-Dense Subgraph Search in Bipartite Graphs
di: Zhang, Yalong, et al.
Pubblicazione: (2025)

ContextCache: Context-Aware Semantic Cache for Multi-Turn Queries in Large Language Models
di: Yan, Jianxin, et al.
Pubblicazione: (2025)

CardOOD: Robust Query-driven Cardinality Estimation under Out-of-Distribution
di: Li, Rui, et al.
Pubblicazione: (2024)

QUEST: Query Optimization in Unstructured Document Analysis
di: Sun, Zhaoze, et al.
Pubblicazione: (2025)

Approximate Reverse $k$-Ranks Queries in High Dimensions
di: Amagata, Daichi, et al.
Pubblicazione: (2025)

One-Hop Sub-Query Result Caches for Graph Database Systems
di: Nguyen, Hieu, et al.
Pubblicazione: (2024)

Automated Data Quality Validation in an End-to-End GNN Framework
di: Dong, Sijie, et al.
Pubblicazione: (2025)

Efficient Fault Tolerance for Pipelined Query Engines via Write-ahead Lineage
di: Wang, Ziheng, et al.
Pubblicazione: (2024)