activity
20232026
most citedStarling: An I/O-Efficient Disk-Resident Graph Index Framework for High-Dimensional Vector Similarity Search on Data Segment

62 citations · 93 across the 19 of their papers we have counts for

collaborators
Showing 2024Show all

10 papers · 1 filter

cs.DC2024

HC-SpMM: Accelerating Sparse Matrix-Matrix Multiplication for Graphs with Hybrid GPU Cores

Zhonggen Li, Xiangyu Ke, Yifan Zhu +2

Sparse Matrix-Matrix Multiplication (SpMM) is a fundamental operation in graph computing and analytics. However, the irregularity of real-world graphs poses significant challenges…

cs.SI2024

Spectral Subspace Clustering for Attributed Graphs

Xiaoyang Lin, Renchi Yang, Haoran Zheng +1

Subspace clustering seeks to identify subspaces that segment a set of n data points into k (k<<n) groups, which has emerged as a powerful tool for analyzing data from various domai…

cs.LG2024

A Benchmark Study of Deep-RL Methods for Maximum Coverage Problems over Graphs

Zhicheng Liang, Yu Yang, Xiangyu Ke +2

Recent years have witnessed a growing trend toward employing deep reinforcement learning (Deep-RL) to derive heuristics for combinatorial optimization (CO) problems on graphs. Maxi…

cs.DB2024★ 2 cited

An Interactive Multi-modal Query Answering System with Retrieval-Augmented Large Language Models

Mengzhao Wang, Haotian Wu, Xiangyu Ke +3

Retrieval-augmented Large Language Models (LLMs) have reshaped traditional query-answering systems, offering unparalleled user experiences. However, existing retrieval techniques o…

cs.DB2024★ 8 cited

GTS: GPU-based Tree Index for Fast Similarity Search

Yifan Zhu, Ruiyao Ma, Baihua Zheng +3

Similarity search, the task of identifying objects most similar to a given query object under a specific metric, has gathered significant attention due to its practical application…

cs.DC2024

Accelerating Biclique Counting on GPU

Linshan Qiu, Zhonggen Li, Xiangyu Ke +2

Counting (p,q)-bicliques in bipartite graphs poses a foundational challenge with broad applications, from densest subgraph discovery in algorithmic research to personalized content…

cs.DB2024★ 62 cited

Starling: An I/O-Efficient Disk-Resident Graph Index Framework for High-Dimensional Vector Similarity Search on Data Segment

Mengzhao Wang, Weizhi Xu, Xiaomeng Yi +7

High-dimensional vector similarity search (HVSS) is gaining prominence as a powerful tool for various data science and AI applications. As vector data scales up, in-memory indexes…

cs.SI2024

Scalable Community Search with Accuracy Guarantee on Attributed Graphs

Yuxiang Wang, Shuzhan Ye, Xiaoliang Xu +4

Given an attributed graph and a query node , \underline{C}ommunity \underline{S}earch over \underline{A}ttributed \underline{G}raphs (CS-AG) aims to find a structure- and at…

cs.DC2024★ 1 cited

GPU-Accelerated Batch-Dynamic Subgraph Matching

Linshan Qiu, Lu Chen, Hailiang Jie +4

Subgraph matching has garnered increasing attention for its diverse real-world applications. Given the dynamic nature of real-world graphs, addressing evolving scenarios without in…

cs.LG2024★ 17 cited

View-based Explanations for Graph Neural Networks

Tingyang Chen, Dazhuo Qiu, Yinghui Wu +3

Generating explanations for graph neural networks (GNNs) has been studied to understand their behavior in analytical tasks such as graph classification. Existing approaches aim to…