13 citations · 15 across the 9 of their papers we have counts for
10 papers
GeoLayer: Towards Low-Latency and Cost-Efficient Geo-Distributed Graph Stores with Layered Graph
Feng Yao, Xiaokang Yang, Shufeng Gong +3
The inherent connectivity and dependency of graph-structured data, combined with its unique topology-driven access patterns, pose fundamental challenges to conventional data replic…
DGAI: Decoupled On-Disk Graph-Based ANN Index for Efficient Updates and Queries
Jiahao Lou, Shufeng Gong, Quan Yu +6
On-disk graph-based indexes are favored for billion-scale Approximate Nearest Neighbor Search (ANNS) due to their high performance and cost-efficiency. However, existing systems ty…
GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search
Yijie Zhou, Shengyuan Lin, Shufeng Gong +4
Graph-based high-dimensional vector indices have become a mainstream solution for large-scale approximate nearest neighbor search (ANNS). However, their substantial memory footprin…
A Topology-Aware Localized Update Strategy for Graph-Based ANN Index
Song Yu, Shengyuan Lin, Shufeng Gong +7
The graph-based index has been widely adopted to meet the demand for approximate nearest neighbor search (ANNS) for high-dimensional vectors. However, in dynamic scenarios involvin…
TRAPP: An Efficient Point-to-Point Path Planning Algorithm for Road Networks with Restrictions
Hanzhang Chen, Xiangzhi Zhang, Shufeng Gong +4
Path planning is a fundamental problem in road networks, with the goal of finding a path that optimizes objectives such as shortest distance or minimal travel time. Existing method…
LSMGraph: A High-Performance Dynamic Graph Storage System with Multi-Level CSR
Song Yu, Shufeng Gong, Qian Tao +9
The growing volume of graph data may exhaust the main memory. It is crucial to design a disk-based graph storage system to ingest updates and analyze graphs efficiently. However, e…
Fast Iterative Graph Computing with Updated Neighbor States
Yijie Zhou, Shufeng Gong, Feng Yao +6
Enhancing the efficiency of iterative computation on graphs has garnered considerable attention in both industry and academia. Nonetheless, the majority of efforts focus on expedit…
GastCoCo: Graph Storage and Coroutine-Based Prefetch Co-Design for Dynamic Graph Processing
Hongfu Li, Qian Tao, Song Yu +6
An efficient data structure is fundamental to meeting the growing demands in dynamic graph processing. However, the dual requirements for graph computation efficiency (with contigu…
Layph: Making Change Propagation Constraint in Incremental Graph Processing by Layering Graph
Song Yu, Shufeng Gong, Yanfeng Zhang +7
Real-world graphs are constantly evolving, which demands updates of the previous analysis results to accommodate graph changes. By using the memoized previous computation state, in…
Clustering Stream Data by Exploring the Evolution of Density Mountain
Shufeng Gong, Yanfeng Zhang, Ge Yu
Stream clustering is a fundamental problem in many streaming data analysis applications. Comparing to classical batch-mode clustering, there are two key challenges in stream cluste…