Home > Articles > Data

Implementing Models with Relational Databases

Relational databases are powerful, but can be difficult to use. Individual tables are straightforward and intuitive, but applications with hundreds of tables can be hard to fathom. Models can help you deal with this complexity. In this article, we look at implementing models with relational databases.
Like this article? We recommend

Mapping Models to Tables

Article 2 of this series, "Modeling Database Applications," discussed the importance of models and their use for database applications. The Unified Modeling Language (UML) is a popular notation for modeling databases, and we continue discussing its use in this article.

There are systematic rules for converting a model to a database structure. It is helpful to understand the rules, even though you would normally apply them with a tool, in practice. We sketch out the basic rules here.


The first step in implementing a model is to deal with identity. We first define several terms:

  • A candidate key is a combination of columns that uniquely identifies each row in a table. The combination must be minimal and should not include any columns that are not needed for unique identification. No column in a candidate key can be null.

  • A primary key is a candidate key that is preferentially used to access the records in a table. A table can have at most one primary key; normally, each table should have a primary key.

  • A foreign key is a reference to a candidate key, and is the glue that binds tables. A foreign key must have a value for all columns in a candidate key, or it must be wholly null. Foreign keys are used to implement relationships and generalizations.

Each foreign key should refer only to a table's primary key (not to some other candidate key). There are no disadvantages and several advantages to doing this. Multiple referents complicate the database structure, and it is good style to have consistency in an implementation. Searching and comparisons are also more difficult if there are multiple access routes to a record.

There are two basic approaches to defining primary keys:

  • Existence-based identity. An artificial number attribute is added to each entity type table and made the primary key. The primary key for each relationship table consists of identifiers from the related entity types.

    Existence-based identifiers have the advantage of being a single attribute, small, and uniform in size. Most relational DBMSs (RDBMSs) provide sequence numbers so that they can allocate identifiers efficiently. Existence-based identifiers can make a database more difficult to read during debugging and maintenance. IDs also complicate the merging of databases; sometimes ID values contend and must be reassigned. Artificial numbers should only be used internally in applications and not be displayed to users.

  • Value-based identity. Some combination of real-world attributes identifies each entity. The primary key for each relationship table consists of primary keys from the related entity types.

    Value-based identity has different trade-offs. Primary keys have intrinsic meaning, making it easier to debug the database. On the downside, value-based primary keys can be difficult to change. One change may propagate to many foreign keys. Some entity types do not have natural real-world identifiers.

We recommend that you use existence-based identity for relational databases with more than 30 entity types. The uniformity and simplicity of existence-based identity outweighs any additional debugging effort. Both existence-based and value-based identity are viable options for small applications.

Entity Types

Normally, you should map each entity type to a table and each attribute to a column (see Figure 1). You can add columns for an existence-based identifier, buried relationships, and generalization discriminators (to be explained). The primary key is shown in bold font.

Figure 1 Entity type. Make each entity type a table.


The design rules for relationship types depend on the multiplicity. Figure 2 shows the rule for many-to-many relationships. The relationship type is promoted to a table, and the primary key is the combination of the primary keys for the related entity types. The ellipses (...) denote attributes that are not shown.

Figure 2 Many-to-many relationship. Promote each one to a table.

Figure 3 shows the recommended rule for one-to-many relationships. The relationship type becomes a foreign key buried in the table for the "many" entity type.

Figure 3 One-to-many relationship. Bury each one as a foreign key in the "many" entity type table.

One-to-one relationships seldom occur. You can handle these by burying a foreign key in either entity type table.


The simplest approach is to map the general entity type and each specific entity type to a table, as Figure 4 shows. The primary key names may vary, but an entity should have the same primary key value throughout a generalization. The discriminator (activityType) is an attribute that indicates the appropriate specific record for each general record. Applications must enforce the partition between specific entities because an RDBMS does not. For example, an RDBMS would let an Activity record have both a FlightActivity record and an OtherActivity record. An RDBMS will not stop such a multiple reference.

Figure 4 Generalization. Create separate tables for the general entity type and each specific entity type.


The final step is to tune the database by adding indexes. Most RDBMSs create indexes as a side effect of SQL primary-key and candidate-key constraints. You should also create an index for each foreign key that is not subsumed by a primary-key or candidate-key constraint.

These indexes are important. Indexes on foreign keys and primary keys let you combine tables quickly. Without these indexes, users will become frustrated. Indexes should be an integral part of a database design because they are straightforward to include, and there is no good reason to defer them.

The database administrator (DBA) may define additional indexes for frequent queries. The DBA may also use product-specific tuning mechanisms.

Normal Forms

A normal form is a guideline for relational database design that increases data consistency. Because tables satisfy higher levels of normal forms, they are less likely to store redundant data and contradictory data. Normal forms are not fiat rules. Developers can violate them for good cause, such as to increase performance for a bottleneck or for a database that is read and seldom updated. Such a relaxation is called denormalization. The important issue with normal forms is to violate them deliberately and only when necessary.

Normal forms were first used in the 1970s and 1980s. At that time, developers designed databases by creating a list of desired fields, which they then had to organize into meaningful groups before storing them in a database. That was the purpose of normal forms.

Normal forms organize fields into groups according to dependencies between fields. For example, both the airline and account number are needed to determine the current balance of Frequent Flyer points. Unfortunately, it is easy to overlook such dependencies. If any are missed, the resulting database structure may be flawed.

Modeling provides a better way to prepare databases. Instead of focusing on the fine granularity of fields, developers think in terms of entity types, which naturally organize fields into meaningful groups. Models do not diminish the validity of normal forms—normal forms apply regardless of the development approach.

However, modeling does eliminate the need to check normal forms. If developers build a sound model, it will intrinsically satisfy normal forms. The converse also holds—a poor model is unlikely to satisfy normal forms. Furthermore, if developers cannot build a sound model, they will probably be unable to find all the dependencies that are required for checking normal forms. It is less difficult to build models than to find all the dependencies.

The bottom line is that developers can still check normal forms if they want after modeling, but such a check is unnecessary.


Figure 5 summarizes the mapping rules for RDBMSs.

Figure 5 Summary of RDMS mapping rules.

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information

To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.


Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.


If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information

Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.


This site is not directed to children under the age of 13.


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information

If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information

Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents

California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure

Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact

Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice

We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020