:: Library Catalog

Copertina

Salvato in:

Dettagli Bibliografici
Autori principali:	Yang, Linglin, Su, Xunbin, Zou, Lei, Gou, Xiangyang, Lin, Yinnian
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Databases
Accesso online:	https://arxiv.org/abs/2603.08037
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

S$^3$GND: An Effective Learning-Based Approach for Subgraph Similarity Search Under Generalized Neighbor Difference Semantics (Technical Report)
di: Wen, Qi, et al.
Pubblicazione: (2026)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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