Database Reference
In-Depth Information
6.9 What does the notation LastName (AK2.2) mean?
6.10 Name four column properties.
6.11 Explain why primary keys may never be null, but alternate keys can be null.
6.12 List five generic data types.
6.13 Describe three ways that a default value can be assigned.
6.14 What is a domain constraint? Give an example.
6.15 What is a range constraint? Give an example.
6.16 What is an intrarelation constraint? Give an example.
6.17 What is an interrelation constraint? Give an example.
6.18 What tasks should be accomplished when verifying normalization of a database design?
6.19 Describe two ways to represent a 1:1 strong entity relationship. Give an example other
than one in this chapter.
6.20 Describe how to represent a 1:N strong entity relationship. Give an example other than
one in this chapter.
6.21 Describe how to represent an N:M strong entity relationship. Give an example other
than one in this chapter.
6.22 What is an intersection table? Why is it necessary?
6.23 What is the difference between the table that represents an ID-dependent association
entity and an intersection table?
6.24 List four uses for ID-dependent entities.
6.25 Describe how to represent an association entity relationship. Give an example other
than one in this chapter.
6.26 Describe how to represent a multivalued attribute entity relationship. Give an example
other than one in this chapter.
6.27 Describe how to represent a archetype/instance entity relationship. Give an example
other than one in this chapter.
6.28 What happens when an instance entity is given a non-ID-dependent identifier? How
does this change affect relationship design?
6.29 What happens when the parent in an ID-dependent relationship is given a surrogate
key? What should the key of the child become?
6.30 Describe how to represent a mixed entity relationship. Give an example other than one
in this chapter.
6.31 Describe how to represent a supertype/subtype entity relationship. Give an example
other than one in this chapter.
6.32 Describe two ways to represent a 1:1 recursive relationship. Give an example other
than one in this chapter.
6.33 Describe how to represent a 1:N recursive relationship. Give an example other than one
in this chapter.
6.34 Describe how to represent an N:M recursive relationship. Give an example other than
one in this chapter.
6.35 In general, how are ternary relationships represented? Explain how a binary constraint
may impact such a relationship.
6.36 Describe a MUST constraint. Give an example other than one in this chapter.
Search WWH ::




Custom Search