基于平面图覆盖的大规模图可达查询处理-计算机科学与探索.PDF

段雨晴，李世峰，丁琳琳.基于平面图覆盖的大规模图可达查询处理[J].计算机科学与探索，2015 ，9（11）：1326-1334. ISSN 1673-9418 CODEN JKYTA8 E-mail: fcst@vip. 163.com Journal of Frontiers of Computer Science and Technology 1673-9418/2015/09(11)- 1326-09 Tel: +86-10 doi: 10.3778/j.issn. 1673-9418.1412056 基于平面图覆盖的大规模图可达查询处理* 1 2 2+ 段雨晴 ，李世峰 ，丁琳琳 1. 香港科技大学 电子及计算机工程学系，中国香港 2. 辽宁大学 信息学院，沈阳 110036 Planar Graph Cover Based Reachability Query Processing in Large Graph 1 2 2+ DUAN Yuqing , LI Shifeng , DING Linlin 1. Department of Electronic Computer Engineering, Hong Kong University of Science and Technology, Hong Kong, China 2. School of Information, Liaoning University, Shenyang 110036, China + Corresponding author: E-mail: dinglinlin@ DUAN Yuqing, LI Shifeng, DING Linlin. Planar graph cover based reachability query processing in large graph. Journal of Frontiers of Computer Science and Technology, 2015, 9(11) ：1326-1334. Abstract: With the springing up and wide use of emerging applications, such as semantic networks, social networks and bioinformatics networks, the research on increasingly large-scale graph data has become a hot and difficult prob- lem. Reachability query is a fundamental query frequently used in graph data analysis and processing which has important effectiveness. Some complex queries can be decomposed into operation sets containing multiple reachability queries. For processing the reachability query of large graph, this paper proposes planar graph cover based reachability query processing in large graph. Firstly, this paper presents a planar gra