A Study on Reachability Problems of Large-scale Graph

	A Study on Reachability Problems of Large-scale Graph
	Ma, Jing-yan ; Zhang, Ke-hong
	2015
会议名称	2015 INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND TECHNOLOGY (ICCST 2015)
会议录名称	DESTECH PUBLICATIONS, INC
页码	244-254
会议日期	OCT 17-18, 2015
会议地点	Wuhan, PEOPLES R CHINA
出版地	439 DUKE STREET, LANCASTER, PA 17602-4967 USA
出版者	DESTECH PUBLICATIONS, INC
摘要	The rapid development of Social networking, biological network, RDF and semantic web Produce a large number of graph data, How to analyze effectively these data and query is one of the important problems, Especially the reachability problem between two vertices is the research hotspot. This paper introduced in detail and summarizes the current traditional method in order to solve the problem of reachability, the method of N-Hop, tree method, method of interval labels, uncertain graph processing method and so on, at the same time it illustrates the research and the overall trend of the reachability problem.
URL	查看原文
收录类别	CPCI ; CPCI-S
语种	英语
WOS研究方向	Computer Science
WOS类目	Computer Science, Information Systems ; Computer Science, Theory & Methods
WOS记录号	WOS:000380291300043
原始文献类型	Proceedings Paper
引用统计	被引频次[WOS]：0 [WOS记录] [WOS相关记录]
文献类型	会议论文
条目标识符	http://ir.lzufe.edu.cn/handle/39EH0E1M/9731
专题	信息工程与人工智能学院
作者单位	1.Northwest Univ Nationalities, Sch Preparatory Educ, Lanzhou 730030, Peoples R China; 2.Lanzhou Univ Finance & Econ, Sch Informat Engn, Lanzhou 730020, Peoples R China; 3.Dalian Univ Technol, Sch Comp Sci & Technol, Dalian 116024, Peoples R China
推荐引用方式 GB/T 7714	Ma, Jing-yan,Zhang, Ke-hong. A Study on Reachability Problems of Large-scale Graph[C]. 439 DUKE STREET, LANCASTER, PA 17602-4967 USA:DESTECH PUBLICATIONS, INC,2015:244-254.