A Relational Database Complexity Computing Model

Abstract:

Article Preview

In this paper we have proposed a model to compute the complexity of small relational database application developed in MS Access. The model was built using different database objects. These objects were categorized based upon the basis of weights assigned to their complexity determining factors. We have implemented our model in a tool called SMARtS. We used our model to compute complexity of eight database projects. To evaluate our model, we analyzed the calculated complexity and actual effort. We found that our model successfully captured the complexity of different database projects. Correlation analysis has shown that complexities computed by SMARtS and the actual efforts are strongly correlated.

Info:

Periodical:

Key Engineering Materials (Volumes 474-476)

Edited by:

Garry Zhu

Pages:

1464-1469

DOI:

10.4028/www.scientific.net/KEM.474-476.1464

Citation:

X. Y. Lin "A Relational Database Complexity Computing Model", Key Engineering Materials, Vols. 474-476, pp. 1464-1469, 2011

Online since:

April 2011

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.