Cover Image

Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chen, Liuyi, Hu, Yuchen, Yang, Zhengyi, Zhou, Xu, Zhang, Wenjie, Li, Kenli
Format:	Preprint
Published:	2025
Subjects:	Databases
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Efficient Algorithms for Top-k Stabbing Queries on Weighted Interval Data (Full Version)
by: Amagata, Daichi, et al.
Published: (2024)

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

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

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

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

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

Discovering Top-k Periodic and High-Utility Patterns
by: Zhou, Qingfeng, et al.
Published: (2025)

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

Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks
by: Wang, Yiqi, et al.
Published: (2024)

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

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

Top-k Representative Search for Comparative Tree Summarization
by: Chen, Yuqi, et al.
Published: (2024)

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

Approximating Opaque Top-k Queries
by: Chang, Jiwon, et al.
Published: (2025)

Flexible Keyword-Aware Top-$k$ Route Search
by: Yu, Ziqiang, et al.
Published: (2025)

Top-k contrast order-preserving pattern mining
by: Wu, Youxi, et al.
Published: (2023)

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

Query Refinement for Diverse Top-$k$ Selection
by: Campbell, Felix S., et al.
Published: (2024)

Top-k Approximate Functional Dependency Discovery
by: Wan, Xiaolong, 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)

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

NetChain: Authenticated Blockchain Top-k Graph Data Queries and its Application in Asset Management
by: Zhao, Hongguang, et al.
Published: (2025)

C$^{2}$TC: A Training-Free Framework for Efficient Tabular Data Condensation
by: Xu, Sijia, et al.
Published: (2026)

MCI-SQL: Text-to-SQL with Metadata-Complete Context and Intermediate Correction
by: Wang, Qin, et al.
Published: (2026)

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

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

NeuSO: Neural Optimizer for Subgraph Queries
by: Yang, Linglin, 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)

Marlin: Efficient Coordination for Autoscaling Cloud DBMS (Extended Version)
by: Hu, Wenjie, et al.
Published: (2025)

Efficient k-step Weighted Reachability Query Processing Algorithms
by: Mei, Congquan, et al.
Published: (2024)

Personalized w-Event Privacy for Infinite Stream Estimation
by: Du, Leilei, et al.
Published: (2026)

Efficient Antagonistic k-plex Enumeration in Signed Graphs
by: Xu, Lantian, et al.
Published: (2024)

An Efficient Proximity Graph-based Approach to Table Union Search
by: Xie, Yiming, et al.
Published: (2025)

MS-Index: Fast Top-k Subsequence Search for Multivariate Time Series under Euclidean Distance
by: d'Hondt, Jens E., et al.
Published: (2025)

Generalizing Fair Top-$k$ Selection: An Integrative Approach
by: Cai, Guangya
Published: (2026)

A Universal Scheme for Dynamic Partitioned Shortest Path Index: Survey, Improvement, and Experiments
by: Zhang, Mengxuan, et al.
Published: (2023)

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