基于规范序树的数据库优化以推荐软件开发人员
Database Optimization to Recommend Software Developers using Canonical Order Tree
AI总结:
本文针对增量更新数据库的频繁模式挖掘效率问题,提出基于规范序树(Canonical Order Tree)的优化技术,实现快速高效的模式发现,从而优化数据库并为软件开发人员提供推荐信息。
摘要:
近年来,频繁模式和序列模式挖掘算法已被广泛应用于软件工程领域,用于挖掘各种源代码或规范模式。在实践中,软件从一个版本演化到另一个版本,需要为用户提供额外的功能。这类任务在该领域中具有挑战性,因为数据库通常会以各种方式更新,例如序列的插入、各种修改以及删除。如果数据库得到优化,那么这些优化后的信息将有助于开发人员的开发过程,并节省他们宝贵的时间以及开发费用。现有的一些用于优化数据库的算法在数据库增量更新时运行速度不够快。为了克服这些挑战,最近提出了一种高效算法,称为规范序树(Canonical Order Tree),它捕获数据库中事务的内容和顺序。在本文中,我们提出了一种基于规范序树的技术,能够以快速高效的方式从增量数据库中发现频繁模式。因此,数据库将得到优化,同时为推荐软件开发人员提供有用的信息。
英文摘要:
Recently frequent and sequential pattern mining algorithms have been widely used in the field of software engineering to mine various source code or specification patterns. In practice software evolves from one version to another is needed for providing extra facilities to user. This kind of task is challenging in this domain since the database is usually updated in all kinds of manners such as insertion, various modifications as well as removal of sequences. If database is optimized then this optimized information will help developer in their development process and save their valuable time as well as development expenses. Some existing algorithms which are used to optimize database but it does not work faster when database is incrementally updated. To overcome this challenges an efficient algorithm is recently introduce, called the Canonical Order Tree that captures the content of the transactions of the database and orders. In this paper we have proposed a technique based on the Canonical Order Tree that can find out frequent patterns from the incremental database with speedy and efficient way. Thus the database will be optimized as well as it gives useful information to recommend software developer.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。