J4 ›› 2013, Vol. 48 ›› Issue (11): 44-52.

• Articles • Previous Articles     Next Articles

An overview of graph indexing technology

LIU Ya-hui1, 2, LIU Chun-yang3*, ZHANG Tie-ying1, CHENG Xue-qi1   

  1. 1. Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100190, China;
    2. Shihezi University, Shihezi 832003, Xinjiang, China; 3. National Computer Network Emergency
    Response Technical Team Coordination Center of China, Beijing 100029, China
  • Received:2013-09-02 Online:2013-11-20 Published:2013-11-25

Abstract:

Graph is a general data structure for modeling in varies of fields. With the development of information and network technology, it is widely applied for representing relationship between entities. In this way, most valuable information is hidden in entities. So as to mine the hidden information in graph, related researches on this topic are becoming popular. The key to solve the problem is how to efficiently search on graph. In the graph database, there are two kinds of graph data sets: Single Graph and Graphs. However, it is time consuming in searching either Single Graph or Graphs. Thus, graph indexing is proposed to be a promising way to minimize the search space on graph in order to speed up graph search algorithms. This paper categorizes graph search into subgraph search and supergraph search.They are subdivided into smaller categories in terms of selected graph structure in building graph indexing. Meanwhile, the paper describes graph indexing building methods and detailed explanation on typical graph indexing. It compares kinds of graph indexing and analyzes their specific applications. At last, it discusses the development trend of graph indexing.

Key words: graph indexing; graph search; feature; subgraph; supergraph

CLC Number: 

  • TP391
[1] YU Ran 1,2, LIU Chun-yang3*, JIN Xiao-long 1, WANG Yuan-zhuo 1, CHENG Xue-qi 1. Chinese spam microblog filtering based on the fusion of
multi-angle features
[J]. J4, 2013, 48(11): 53-58.
[2] ZHENG Jian-xing, ZHANG Bo-feng*, YUE Xiao-dong, CHENG Ze-yu. Research on themes recommendation in microblogging
scenario based on neighbor-user profile
[J]. J4, 2013, 48(11): 59-65.
[3] PENG Qing-xi, QIAN Tie-yun. Store review spam detection based on quantitative sentiment [J]. J4, 2013, 48(11): 66-72.
[4] HUANG Liang, DU Yong-ping. The method of latent friend recommendation based on the trust relations [J]. J4, 2013, 48(11): 73-79.
[5] ZHANG Nai-zhou1, CAO Wei 2, CHEN Ke-rui 1, LI Shi-jun3. A temporal-aware model for search engine [J]. J4, 2013, 48(11): 80-86.
[6] CHEN Ke-rui, PAN Jun. Multi-source data fusion based on the expand vector space model [J]. J4, 2013, 48(11): 87-92.
[7] FANG Zhi-jun, LIU Xin-yun, WU Shi-qian, ZHENG Wen-juan. The multi-scale retinex algorithm for image enhancement based on
sub-band weighting fusion
[J]. J4, 2013, 48(11): 93-98.
[8] LIU Wu-ying, YI Mian-zhu, ZHANG Xing. A space-time-efficient multi-category text categorization algorithm [J]. J4, 2013, 48(11): 99-104.
[9] LI Yu-Qian, LIU Lin, LI Jin-Bing. Superposition principle of gray histograms in video analysis [J]. J4, 2009, 44(11): 63-67.
[10] XIE Hua, LIN Chang-Yuan, LIN Xue-Fang. Onedirection rough relations and security of data communication [J]. J4, 2009, 44(9): 93-96.
[11] XU Jie-ping1, YIN Hong-yu1, FAN Zi-wen2. Study on cover songs identification based on phrase content [J]. J4, 2013, 48(7): 68-71.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!