October
2001 Issue: 22
Journal of Conceptual Modeling
www.inconcept.com/jcm
August Analysis Problem Solution
by Dr. John Sharp
Solution for the August 2001 Analysis Problem:
|
A |
B |
C |
|
a1 |
b1 |
c1 |
|
a2 |
b1 |
c1 |
|
a1 |
b2 |
c1 |
|
a3 |
b1 |
c2 |
|
a1 |
b3 |
c3 |
Analysis results (only tables and keys are needed):
One table exists: ABC
Key exists over AB in ABC
Here is the real world example that this problem was developed from:
Room 210 in building B22 has 260 ft2.
The
rules are:
A
room number and building identifier identifies a room.
A room has a number of square feet.
![]()
Dr. John Sharp is the founder and principal consultant for Sharp Informatics.Before starting Sharp Informatics in 1997 he was employed by Sandia National Laboratories in Albuquerque, NM for 18 years. While at Sandia he held staff and management positions in all areas of information technology, including analysis, design, implementation, maintenance, information architecture, data administration, and information technology research. He has worked closely with Prof. Shir Nijssen of The Netherlands to improve the NIAM analysis methodology. Dr. Sharp is the creator of the first information analysis procedure known to be mathematically precise.This procedure reformulates the usual (imprecise and inaccurate) statements and examples from a subject area into verified fact types. The output of this productivity enhancing process (a set of information requirements) is compatible with all the latest and most productive database application creation tools. John is the editor of the international standard for conceptual schemas. He has co-chaired two international conferences on natural language modeling and he has presented numerous papers and seminars at professional conferences.
Contact information:
Dr. John Sharp
Sharp Informatics
1604 Vassar SE
Albuquerque, NM 87106
sharp@sharp-informatics.com
505-243-1498
fax 505-248-0345
http://www.sharp-informatics.com
![]()
© Copyright, 1998-2004 InConcept
(Information Conceptual Modeling, Inc.) All
Rights Reserved. Privacy Statement.
ISSN: 1533-3825