:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Yang, Linglin, Su, Xunbin, Zou, Lei, Gou, Xiangyang, Lin, Yinnian
Format:	Preprint
Published:	2026
Subjects:	Databases
Online Access:	https://arxiv.org/abs/2603.08037
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

ShareDP: Finding k Disjoint Paths for Multiple Vertex Pairs
by: Yuan, Zhiqiu, et al.
Published: (2025)

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

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

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

Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach
by: Yu, Kaiqiang, et al.
Published: (2025)

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

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

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

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

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

Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings (Technical Report)
by: Ye, Yutong, 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)

Finding Non-Redundant Simpson's Paradox from Multidimensional Data
by: Yang, Yi, et al.
Published: (2025)

OmniMatch: Effective Self-Supervised Any-Join Discovery in Tabular Data Repositories
by: Koutras, Christos, et al.
Published: (2024)

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

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

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)

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

QQESPM: A Quantitative and Qualitative Spatial Pattern Matching Algorithm
by: Minervino, Carlos, et al.
Published: (2023)

Structured Multi-Step Reasoning for Entity Matching Using Large Language Model
by: Bopardikar, Rohan, et al.
Published: (2025)

In-depth Analysis of Densest Subgraph Discovery in a Unified Framework
by: Zhou, Yingli, et al.
Published: (2024)

RAIRS: Optimizing Redundant Assignment and List Layout for IVF-Based ANN Search
by: Yang, Zehai, et al.
Published: (2026)

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

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

Why Are Learned Indexes So Effective but Sometimes Ineffective?
by: Liu, Qiyu, et al.
Published: (2024)

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

SiMa: Effective and Efficient Matching Across Data Silos Using Graph Neural Networks
by: Koutras, Christos, et al.
Published: (2022)

Redundancy-Driven Top-$k$ Functional Dependency Discovery
by: Wan, Xiaolong, et al.
Published: (2026)

A Plaque Test for Redundancies in Relational Data [Extendend Version]
by: Köhnen, Christoph, et al.
Published: (2023)

Dupin: A Parallel Framework for Densest Subgraph Discovery in Fraud Detection on Massive Graphs (Technical Report)
by: Jiang, Jiaxin, et al.
Published: (2025)

Efficient and Effective Algorithms for A Family of Influence Maximization Problems with A Matroid Constraint
by: Huang, Yiqian, et al.
Published: (2024)

Elimination of annotation dependencies in validation for Modern JSON Schema
by: Attouche, Lyes, et al.
Published: (2025)

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

Version Control System for Data with MatrixOne
by: Gou, Hongshen, et al.
Published: (2026)

Exact Acceleration of Subgraph Graph Neural Networks by Eliminating Computation Redundancy
by: Tao, Qian, et al.
Published: (2024)

Effective Clustering for Large Multi-Relational Graphs
by: Lin, Xiaoyang, et al.
Published: (2025)

Enhancing Real-Time Master Data Management with Complex Match and Merge Algorithms
by: Rajamanickam, Durai
Published: (2024)

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

Efficient Hypergraph Pattern Matching via Match-and-Filter and Intersection Constraint
by: Song, Siwoo, et al.
Published: (2025)