Cover Image

Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings (Technical Report)

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ye, Yutong, Lian, Xiang, Zhang, Nan, Chen, Mingsong
Format:	Preprint
Published:	2024
Subjects:	Databases
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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)

S3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics (Technical Report)
by: Wen, Qi, et al.
Published: (2025)

Top-L Most Influential Community Detection Over Social Networks (Technical Report)
by: Zhang, Nan, et al.
Published: (2023)

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

Efficient Community Detection Over Streaming Bipartite Networks (Technical Report)
by: Zhang, Nan, et al.
Published: (2024)

Reverse Influential Community Search Over Social Networks (Technical Report)
by: Wen, Qi, et al.
Published: (2024)

GCLS$^2$: Towards Efficient Community Detection Using Graph Contrastive Learning with Structure Semantics
by: Wen, Qi, et al.
Published: (2024)

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

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

gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs
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)

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

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

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

BEACON: Budget-Aware Entity Matching Across Domains (Extended Technical Report)
by: Pulsone, Nicholas, et al.
Published: (2026)

Efficient Distributed Exact Subgraph Matching via GNN-PE: Load Balancing, Cache Optimization, and Query Plan Ranking
by: Wang, Yu, et al.
Published: (2025)

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

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

Cost-Efficient RAG for Entity Matching with LLMs: A Blocking-based Exploration
by: Ma, Chuangtao, et al.
Published: (2026)

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

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

Novel Table Search [Technical Report]
by: Kassaie, Besat, et al.
Published: (2026)

Self-Enhancing Video Data Management System for Compositional Events with Large Language Models [Technical Report]
by: Zhang, Enhao, et al.
Published: (2024)

DSparsE: Dynamic Sparse Embedding for Knowledge Graph Completion
by: Yang, Chuhong, et al.
Published: (2024)

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

Privacy-Enhanced Database Synthesis for Benchmark Publishing (Technical Report)
by: Ge, Yunqing, et al.
Published: (2024)

Efficient Learned Query Execution over Text and Tables [Technical Report]
by: Urban, Matthias, et al.
Published: (2024)

K-Join: Combining Vertex Covers for Parallel Joins
by: Frisk, Simon, et al.
Published: (2026)

Color: A Framework for Applying Graph Coloring to Subgraph Cardinality Estimation
by: Deeds, Kyle, et al.
Published: (2024)

Finding Locally Densest Subgraphs: Convex Programming with Edge and Triangle Density
by: Yang, Yi, et al.
Published: (2025)

Towards Robust Trajectory Embedding for Similarity Computation: When Triangle Inequality Violations in Distance Metrics Matter
by: Si, Jianing, et al.
Published: (2025)

Diverse Unionable Tuple Search: Novelty-Driven Discovery in Data Lakes [Technical Report]
by: Khatiwada, Aamod, et al.
Published: (2025)

Interactive Ontology Matching with Cost-Efficient Learning
by: Cheng, Bin, et al.
Published: (2024)

Match, Compare, or Select? An Investigation of Large Language Models for Entity Matching
by: Wang, Tianshu, et al.
Published: (2024)

TKHist: Cardinality Estimation for Join Queries via Histograms with Dominant Attribute Correlation Finding
by: Li, Renrui, et al.
Published: (2025)

FLEXIS: FLEXible Frequent Subgraph Mining using Maximal Independent Sets
by: Sharma, Akshit, et al.
Published: (2024)

Efficient Multiple Temporal Network Kernel Density Estimation
by: Shao, Yu, et al.
Published: (2025)

Cost-based Selection of Provenance Sketches for Data Skipping
by: Liu, Ziyu, et al.
Published: (2025)

RLOMM: An Efficient and Robust Online Map Matching Framework with Reinforcement Learning
by: Chen, Minxiao, et al.
Published: (2025)