5 papers
ACTIVE: A Dynamic Pareto-Frontier-Based Unified Index for Dual-Vector Query
Shengyuan Lin, Shufeng Gong, Zheng Wang +4
Existing approximate nearest neighbor search (ANNS) methods generally assume that each entity has a single vector. In many real-world applications, however, an entity is associated…
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…
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…
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…