期刊文献+

基于云计算数据查询的安全索引构建方法 被引量:9

A construction method for security index based on data query in cloud computing
下载PDF
导出
摘要 为了加强云计算数据查询的安全性,防止用户数据查询过程中过度访问和检索过程的数据泄露,提出一种云计算服务端的数据安全索引构建方法.对图状部署的云计算数据采用相似子图和哈希函数进行构造,通过特征子结构将被查询对象与索引图状数据进行对比,找出被查询对象.该方法可防止非查询对象的图状数据泄露,同时将哈希函数对节点进行了散列,提高了节点安全性.仿真结果表明,该方法数据查询效率高,耗费存储资源少,安全性好. In order to enhance the security of data query in cloud computing and avoid the excessive access and data leakage in the process of user data query,a construction method for data security index at the cloud computing service side was proposed.The cloud computing data with graph deployment were constructed with the similar subgraph and Hash function,and the query objects and graph data were compared through the characteristic substructure to find the query objects.This method can prevent the graph data leakage of non query objects,and hash the Hash function to the nodes to improve the security of nodes.The results show that the method had high data query efficiency,low storage resource consumption and good security.
作者 邢文凯 XING Wen-kai(Sias International University,Zhengzhou University,Xinzheng 451150,China;Computer Science Department,Shangqiu Vocational College,Shangqiu 476100,China)
出处 《沈阳工业大学学报》 EI CAS 北大核心 2018年第2期198-202,共5页 Journal of Shenyang University of Technology
基金 河南省科技计划资助项目(132300410445 172102210109)
关键词 云计算 安全索引 图状数据 相似子图 特征子结构 图像向量 哈希函数 可达节点 cloud computing security index graph data similar subgraph characteristic substructure image vector Hash function reachable node
  • 相关文献

参考文献9

二级参考文献119

  • 1刘艳秋,焦妮,李佳.基于确定网络的多级物流网络优化设计[J].沈阳工业大学学报,2015,37(1):64-68. 被引量:12
  • 2袁向阳,殷建平.基于二元语法的全链接模块化B*树设计[J].计算机工程与应用,2005,41(27):74-76. 被引量:2
  • 3刘宝生,闫莉萍,周东华.几种经典相似性度量的比较研究[J].计算机应用研究,2006,23(11):1-3. 被引量:44
  • 4INOKUCHI A, WASHIO T, MMOTODA H.An apriori-based algorithm for mining frequent substructures from graph data.In Proc. 2000 European Symp.Principle of Data Mining and Knowledge Diseovery(PKDD'00), Lyon, France, 1998(9):13-33.
  • 5KURAMOCHI M, KARYPIS G.Frequent subgraphs discovery.In Proc.2001 Int.Conf.Data Mining(ICDM' 01), San Jose, CA, 2001 (11) : 313-320.
  • 6VANETIK N, GUDES E, SHIMONY S.E.Computing frequent graph patterns from semistructured data.In Proc.2002 Int.Conf.on Data Mining(ICDM ' 02), Maebashi, Japan, 2002(10) : 458-465.
  • 7YAN X.HAN J.gSpan: Graph-based substructure pattern mining.In Proc.2002 Int.Conf.Data Mining(ICDM' 02), Maebashi, Japan, 2002(10) : 721-724.
  • 8YAN X, HAN J.Closegraph: mining closed frequent graph patterns. In KDD, 2003 : 286-295.
  • 9HUAN J, WANG W, PRINS J.Efficient mining of frequent subgraphs in the presence of isomorphism.In ICDM, 2003:549-552.
  • 10KETKAR S, HOLDER B, COOK J.Subdue : Compression-Based Frequent Pattern Discovery.In ACM, 2005 : 71-76.

共引文献75

同被引文献118

引证文献9

二级引证文献42

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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