Title: Historical prioritisation and reprioritisations using hierarchical historical R-tree

Authors: Varun Gupta; Durg Singh Chauhan; Kamlesh Dutta

Addresses: Department of CSE, Amity University, Noida, 201313, India ' GLA University, 281 406, Uttar Pradesh, India ' National Institute of Technology, 177005, Himachal Pradesh, India

Abstract: Mass market software development involves uncertainties and involves effortful activities of requirement prioritisation and reprioritisations that may lead to delivery cost and time overrun. To facilitate the minimisation of efforts in resource constrained incremental developments, the historical preferences of stakeholders of previous similar projects could be reused during the development of the new similar project by employing the modified version of the HR tree, indexing structure as used for historical indexing of moving objects, for performing prioritisation and reprioritisations of the similar context project. The proposed data structure, i.e., HHR tree is capable of handling both requirements and decision aspects for performing prioritisations and reprioritisations by reusing historical preference values.

Keywords: historical R-tree; hierarchical HR-tree; requirements prioritisation; requirements reprioritisation; software development.

DOI: 10.1504/IJCAT.2016.080492

International Journal of Computer Applications in Technology, 2016 Vol.54 No.4, pp.257 - 265

Received: 24 Feb 2015
Accepted: 29 Aug 2015
Published online: 26 Nov 2016 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article