Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2006.12737 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917766587482112 |
|---|---|
| author | Bhuiyan, T. M. Amir-Ul-Haque Talukdar, Mehedi Hasan Rahman, Ziaur Rahman, Mohammad Motiur |
| author_facet | Bhuiyan, T. M. Amir-Ul-Haque Talukdar, Mehedi Hasan Rahman, Ziaur Rahman, Mohammad Motiur |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2006_12737 |
| institution | arXiv |
| publishDate | 2020 |
| record_format | arxiv |
| spellingShingle | Database Optimization to Recommend Software Developers using Canonical Order Tree Bhuiyan, T. M. Amir-Ul-Haque Talukdar, Mehedi Hasan Rahman, Ziaur Rahman, Mohammad Motiur Databases D.1.1 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. |
| title | Database Optimization to Recommend Software Developers using Canonical Order Tree |
| topic | Databases D.1.1 |
| url | https://arxiv.org/abs/2006.12737 |