DocumentCode :
251425
Title :
Effectiveness of minimization and measurement of schema complexity based on weighted graph
Author :
Bashir, G.M.M. ; Howlader, A. ; Shemu, I. ; Ety, E.
Author_Institution :
Dept. of CCE, Patuakhali Sci. & Technol. Univ., Patuakhali, Bangladesh
fYear :
2014
fDate :
20-22 Dec. 2014
Firstpage :
349
Lastpage :
352
Abstract :
The complexity of data requirement increasing day by day; therefore minimization of schema becomes an important role for equi distribution or equalization of two or more problems. Schema complexity is measured by transmitting schema to a graph with weight or weighted graph. Selected special fundamentals from schema for weight the schema graph are described as major part. Minimization of schema ensures easy to measure the schema complexity. Some consideration for this approaches are normalization and de-normalization. We also find the effect of normalization and de-normalization on minimization of schema of real life data model as well as synthetic data model. The purpose of this research is to examine the effectiveness of schema complexity based on schema minimization with weighted graph.
Keywords :
computational complexity; graph theory; graphs; minimisation; data requirement complexity; measurement; schema complexity; schema graph; schema minimization; synthetic data model; weighted graph; Complexity theory; Data models; Erbium; Minimization; Relational databases; Weight measurement;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Electrical and Computer Engineering (ICECE), 2014 International Conference on
Conference_Location :
Dhaka
Print_ISBN :
978-1-4799-4167-4
Type :
conf
DOI :
10.1109/ICECE.2014.7026993
Filename :
7026993
Link To Document :
بازگشت