loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
First International Conference on Innovative Computing, Information and Control - Volume III (ICICIC'06)
Classification of a Path in an ER Schema by Using the Notions of Corresponding and Representing
Beijing, China
August 30-September 01
ISBN: 0-7695-2616-0
Qinsheng Zhuang, Beijing Union University, China
Junkang Feng, University of Paisley, UK
After constructing an entity-relationship (E-R) schema, how to evaluate it seems to remain as an open problem. In this article the authors present the notion of ?classification of a path in a schema? based upon conceptual and semantic analysis of a data modeling process, and a method for classifying a path by virtue of set theory. The authors also present detailed analysis of different classes of a path in a schema. These seem significant for solving some of problems regarding evaluating an ER schema, such as, whether there are any redundant paths, whether the schema is a minimal one and whether there are any connection traps in the schema.
Citation:
Qinsheng Zhuang, Junkang Feng, "Classification of a Path in an ER Schema by Using the Notions of Corresponding and Representing," icicic, vol. 3, pp.241-245, First International Conference on Innovative Computing, Information and Control - Volume III (ICICIC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.