:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Chen, Weitian, Sun, Shixuan, Chen, Cheng, Hu, Yongmin, Hu, Yingqian, Guo, Minyi
Format:	Preprint
Published:	2026
Subjects:	Databases
Online Access:	https://arxiv.org/abs/2604.10601
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Maintaining Leiden Communities in Large Dynamic Graphs
by: Lin, Chunxu, et al.
Published: (2026)

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)

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

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

RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries
by: Hao, Chiyu, et al.
Published: (2025)

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

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

Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach
by: Shin, Wonseok, 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)

Revisiting the Design of In-Memory Dynamic Graph Storage
by: Su, Jixian, et al.
Published: (2025)

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

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

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

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

Efficient Densest Flow Queries in Transaction Flow Networks (Complete Version)
by: Jiang, Jiaxin, et al.
Published: (2026)

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

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

Efficiently Processing Joins and Grouped Aggregations on GPUs
by: Wu, Bowen, et al.
Published: (2023)

SynchroStore: A Cost-Based Fine-Grained Incremental Compaction for Hybrid Workloads
by: Zhang, Yinan, et al.
Published: (2025)

SHARP: Shared State Reduction for Efficient Matching of Sequential Patterns
by: Yu, Cong, et al.
Published: (2025)

AnyMatch -- Efficient Zero-Shot Entity Matching with a Small Language Model
by: Zhang, Zeyu, et al.
Published: (2024)

ReMatch: Retrieval Enhanced Schema Matching with LLMs
by: Sheetrit, Eitam, et al.
Published: (2024)

CANDY: A Benchmark for Continuous Approximate Nearest Neighbor Search with Dynamic Data Ingestion
by: Zeng, Xianzhi, et al.
Published: (2024)

Less is More: Efficient Time Series Dataset Condensation via Two-fold Modal Matching--Extended Version
by: Miao, Hao, et al.
Published: (2024)

More Bang For Your Buck(et): Fast and Space-efficient Hardware-accelerated Coarse-granular Indexing on GPUs
by: Henneberg, Justus, et al.
Published: (2024)

ApproxJoin: Approximate Matching for Efficient Verification in Fuzzy Set Similarity Join
by: Mandulak, Michael, et al.
Published: (2025)

Efficient Methods for Accurate Sparse Trajectory Recovery and Map Matching
by: Tian, Wei, et al.
Published: (2025)

KcMF: A Knowledge-compliant Framework for Schema and Entity Matching with Fine-tuning-free LLMs
by: Xu, Yongqin, et al.
Published: (2024)

All-in-one Graph-based Indexing for Hybrid Search on GPUs
by: Li, Zhonggen, et al.
Published: (2025)

ConStruM: A Structure-Guided LLM Framework for Context-Aware Schema Matching
by: Chen, Houming, et al.
Published: (2026)

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

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

Prompt-Matcher: Leveraging Large Models to Reduce Uncertainty in Schema Matching Results
by: Feng, Longyu, et al.
Published: (2024)

Scaling Worst-Case Optimal Datalog to GPUs
by: Sun, Yihao, et al.
Published: (2026)

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

BEACON: A Benchmark for Efficient and Accurate Counting of Subgraphs
by: Najafi, Mohammad Matin, et al.
Published: (2025)

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