期刊文献+

支持结构与行为融合的过程模型索引构建与检索 被引量:2

Process model index construction and retrieval supporting structure and behavior fusion
下载PDF
导出
摘要 为应对现有过程库中具有复杂结构的过程模型不易管理和理解、索引效率低等问题,提出一种支持结构和行为融合的过程模型索引构建与检索方法。针对过程库海量过程模型存储和高效的过程模型多维索引问题,提出采用花模型将具有复杂结构的一般过程模型转化为基于块的过程模型的方法,用于生成一般过程模型的索引;采用基于块的过程模型生成对应的过程树进行存储;利用过程树的编辑距离计算过程树的相似度,进而有效管理过程模型。通过构建相应的案例和原型系统证明了所提方法在模型转化、存储和检索方面具有良好的正确性与可行性。 The process model with complex structure in the existing process library is not easy to manage and understand,the indexing efficiency is low.To address these problems,a process model massive model retrieval method that supports complex structures was proposed.Aiming at the storage of process massive process model and the multidimensional indexing problem of efficient process model,the method of transforming the general process model with complex structure into the block-based process model using flower model was proposed,which could be used to generate the index of the general process model.The block-based process model was used to generate the corresponding process tree for storage,and then the process tree editing distance was used to calculate the similarity of the process tree,thus the process model could be managed effectively.By constructing the corresponding cases and prototype systems,the accuracy and feasibility of the proposed method was verified in model conversion,storage and retrieval.
作者 朱锐 黄月 李彤 马自飞 郑明 汤雅惠 ZHU Rui;HUANG Yue;LI Tong;MA Zifei;ZHENG Ming;TANG Yahui(School of Software,Yunnan University,Kunming 650091,China;Key Laboratory in Software Engineering of Yunnan Province,Kunming 650091,China;School of Big Data,Yunnan Agricultural University,Kunming 650201,China)
出处 《计算机集成制造系统》 EI CSCD 北大核心 2021年第5期1447-1458,共12页 Computer Integrated Manufacturing Systems
基金 国家自然科学基金资助项目(62002310) 云南省重大科技专项计划资助项目(202002AD080002) 云南省自然科学基金基础研究面上资助项目(2019FB135) 云南省软件工程重点实验室开放基金资助项目(2020SE404) 云南大学数据驱动的软件工程省科技创新团队资助项目(2017HC012) 云南大学“东陆中青年骨干教师”培养计划资助项目(C176220200)。
关键词 过程模型库 复杂结构 过程索引 过程树 花模型 process model repository complex structures process index process tree flower model
  • 相关文献

参考文献7

二级参考文献49

  • 1DUMAS M, VAN DER AALST W, TER HOFSTEDE A. Process aware information systems: bridging people and soft ware through process teehnology[M]. Garsington Road, Ox ford, UK : Wiley Blackwell, 2005.
  • 2COOK S A. The complexity of theorem proving procedures [C]//Proeeedings of the 3rd Annual ACM Symposium on Theory of Computing. New York, N. Y. ,USA:ACM,1971:151-158.
  • 3GAREY M R, JOHNSON DS. Computers and intractability: a guide to the theory of NP completeness[M]. New York, N. Y. , USA:WH Freeman,1979.
  • 4SHASHA D, WANG J T L, GIUGNO R. Algorithmics and applications of tree and graph searching[C]//Proceedings of the 21st ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. New York, N. Y. , USA: ACM,2002:39-52.
  • 5YAN Xifeng, YU P S, HAN J. Graph indexing:a frequent structure based approach[C]//Proceedings of the ACM SIG- MOD International Conference on Management of Data. New York, N.Y. ,USA:ACM,2004 :335-346.
  • 6YAN Xifeng, YU P S, HAN J. Graph indexing based on dis criminative frequent structure analysis[J]. ACM Transactions on Database Systems,2005,30(4):960-993.
  • 7ZHANG S, HU M, YANG J. TreePi:a novel graph indexing method[C]//Proceedings of the 23rd International Conference on Dala Engineering. Washington, D. C. ,USA:IRE;E,2007: 966-975.
  • 8ZHAO Peixiang, YU J X, YU P S. Graph indexing= tree+ delta> = graph[C]//Proceedings of the 33rd International Conference on Very Large Data Bases. New York, N. Y. , USA : ACM, 2007 : 938-949.
  • 9CHENG J, KE Y, NG W, et al. Fg index;towards verifica tion-free query processing on graph datahases [C]//Proceed ings of the ACM SIGMOD International Conference on Man agement of Data. New York, N. Y. , USA: ACM, 2007 857-872.
  • 10CHENG J, KE Y, NG W. Efficient query processing on graph databases[J]. ACM Transactions on Database Sys- tems,2009,34(1) :2.

共引文献37

同被引文献19

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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