期刊文献+

大规模图数据匹配技术综述 被引量:36

Survey on Large-Scale Graph Pattern Matching
下载PDF
导出
摘要 在大数据时代海量的多源异构数据间存在着紧密的关联性,图作为表示数据之间关系的基本结构在社交网络分析、社会安全分析、生物数据分析等领域有着广泛应用.在大规模图数据上进行高效地查询、匹配是大数据分析处理的基础问题.从应用角度对用于图查询的图数据匹配技术的研究进展进行综述,根据图数据的不同特征以及应用的不同需求对图匹配问题分类进行介绍.同时,将重点介绍精确图匹配,包括无索引的匹配和基于索引的匹配,以及相关的关键技术、主要算法、性能评价等进行了介绍、测试和分析.最后对图匹配技术的应用现状和面临的问题进行了总结,并对该技术的未来发展趋势进行了展望. In the big data age, there exists close affinities among the great amount of multi-modal data. As a popular data model for representing the relations of different data, graph has been widely used in various fields such as analysis of social network, social security, and biological information. Fast and accurate search over the large-scale graph serves as a fundamental problem in graph analysis. In this paper, we survey the up-to-date development in graph pattern matching techniques for graph search from the application perspective. Graph pattern matching techniques are roughly classified into several categories according to the properties of graphs and the requirement of applications. Meanwhile, we focus on introducing and analyzing the exact pattern matching, including non-index matching, index-based matching and their key techniques, representative algorithms, and performance evaluation. We summarize the state-of-the-art applications, challenging issues, and research trends for graph pattern matching.
出处 《计算机研究与发展》 EI CSCD 北大核心 2015年第2期391-409,共19页 Journal of Computer Research and Development
基金 国家自然科学基金项目(61202477) 中国科学院战略性科技先导专项基金项目(XDA06031000) 国家"八六三"高技术研究发展计划基金项目(2012AA012502)
关键词 图数据管理 图模式匹配 精确匹配 子图同构 索引技术 图搜索 graph management graph pattern matching exact matching subgraph isomorphism index techniques graph search
  • 相关文献

参考文献64

  • 1Microsoft Academic Search. Explore researchers' cooperating network.[2009-12-01 J.[2014-11-20]. http://academic. research. microsoft. com/VisualExplorer.
  • 2Brynielsson J, Hogberg J, Kaati L, et al. Detecting social positions using simulation[C]//Proc of 2010 Int Conf on Advances in Social Networks Analysis and Mining (ASONAM). Alamitos, CA: IEEE, 2010: 48-55.
  • 3唐德权,张悦,贺永恒,肖自红.基于图数据挖掘算法的犯罪规律研究及应用[J].计算机技术与发展,2011,21(11):89-91. 被引量:2
  • 4Palantir. Products Built for A Purpose.[2004-01-01].[2014-11-20]. https://www.palantir.com/.
  • 5Malewicz G, Austern M H, Bik A J C, et al, Pregel , A system for large-scale graph processing[C]//Proc of the 2010 ACM SIGMOD Int Conf on Management of Data. New York: ACM, 2010: 135-146.
  • 6Sarwat M, Elnikety S, He Y, et al. Horton: Online query execution engine for large distributed graphs[C]//Proc of the 28th IEEE Int Conf on Data Engineering (ICDE J. Alamitos, CA: IEEE, 2012: 1289-1292.
  • 7Low y, Gonzalez J, Kyrola A, et al. Graphlab , A new framework for parallel machine learning[C]//Proc of the 26th Conf on Uncertainty in Artificial Intelligence (UA]). Oregon, USA: AUAI, 2010.
  • 8Michael R G, David S J. Computers and intractability: A guide to the theory of NP-completeness[R]. New York: W. H. Freeman Company, 1979.
  • 9Christmas W J, Kittler J, Petrou M. Structural matching in computer vision using probabilistic relaxation[J]. Pattern Analysis and Machine Intelligence, 1995, 17(8): 749-764.
  • 10Ullmann J R. An algorithm for subgraph isomorphism[J]. Journal of the ACM (JACM), 1976,23(1): 31-42.

二级参考文献36

  • 1贺龙涛,方滨兴,余翔湛.一种时间复杂度最优的精确串匹配算法[J].软件学报,2005,16(5):676-683. 被引量:25
  • 2夏明波,王晓川,孙永强,金士尧.序列模式挖掘算法研究[J].计算机技术与发展,2006,16(4):4-6. 被引量:13
  • 3朱其祥,徐勇,张林.基于改进Apriori算法的关联规则挖掘研究[J].计算机技术与发展,2006,16(7):102-104. 被引量:16
  • 4Wu S, Manber U. A fast algorithm for multi-pattern searching, TR-94-17 [R]. Tucson, AZ: Department of Computer Science, University of Arizona, 1994.
  • 5Raffinot M. On the multi backward DAWG matching algorithm (MultiBDM)[C]//Proc of the 4th South American Workshop on String Processing. Valparaiso, Chile: Carleton University Press, 1997:149-165.
  • 6Allauzen C, Crochemore M, Raffinot M. Factor oracle: A new structure for pattern matching [C] //Proc of the 26th Conf on Current Trends in Theory and Practice of Informatics. Berlin: Springer, 1999:295-310.
  • 7Navarro G, Raffinot M. Fast and flexible string matching by combining bit-parallelism and suffix automata [OL]. (2000- 12-01) [2007-12-01]. http://www. jea. acre. org.
  • 8Tarjan R E, Yao A C. Storing a sparse table [J]. Communications of the ACM, 1979, 22(11) : 606-611.
  • 9Fredman M, Komlos J, Szemeredi E. Storing a sparse table with O(1) worst case access time[J]. Journal of the ACM, 1984, :31(3): 538-544.
  • 10Galli N, Seybold B, Simon K. Tetris-hashiog or optimal table compression [J]. Discrete Applied Mathematics, 2001, 110(1): 41-58.

共引文献6

同被引文献166

引证文献36

二级引证文献203

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部