Proxies for shortest path and distance queries (Extended abstract)

Shuai Ma, Kaiyu Feng, Jianxin Li, Haixun Wang, Gao Cong, Jinpeng Huai

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

This study investigates a light-weight data reduction technique for speeding-up shortest path and distance queries on large graphs. We propose a notion of routing proxies (or simply proxies), each of which represents a small subgraph, referred to as deterministic routing areas (DRAs). We show that routing proxies hold good properties for speeding-up shortest path and distance queries, and there exists a linear-Time algorithm to compute routing proxies and their corresponding DRAs. Finally, we discuss the experimental results, and verify that our solution is a general technique for reducing graph sizes and speeding-up shortest path and distance queries, using real-life large graphs.

源语言英语
主期刊名Proceedings - 2017 IEEE 33rd International Conference on Data Engineering, ICDE 2017
出版商IEEE Computer Society
61-62
页数2
ISBN(电子版)9781509065431
DOI
出版状态已出版 - 16 5月 2017
已对外发布
活动33rd IEEE International Conference on Data Engineering, ICDE 2017 - San Diego, 美国
期限: 19 4月 201722 4月 2017

出版系列

姓名Proceedings - International Conference on Data Engineering
ISSN(印刷版)1084-4627

会议

会议33rd IEEE International Conference on Data Engineering, ICDE 2017
国家/地区美国
San Diego
时期19/04/1722/04/17

指纹

探究 'Proxies for shortest path and distance queries (Extended abstract)' 的科研主题。它们共同构成独一无二的指纹。

引用此