Database Design for Mere Mortals: A Hands-On Guide to Relational Database Design

A snippet of programming code that executes a particular type of mathematical aggregation on a set of data and returns a single value.

A view used to display information produced by aggregating a particular set of data in a specific manner.

A candidate key that has not been designated as a primary key.

A type of database that stores static data and is used when there is a need to track trends, view statistical data over a long period of time, or make tactical or strategic business projections; it is typically associated with OLAP.

A commercial or custom-built software program that is typically used to provide a user -friendly interface for a database.

The process of designing and creating an application that will serve as the user interface for a database.

Commercial or custom-built software that serves as the user-interface to a database.

A rule that imposes constraints that you must establish within the physical design of the database or within the design of the database application.

A field created for the sole purpose of serving as a candidate key. It's existence is due to an absence of any "naturally occurring" candidate keys within the table.

The relational model's equivalent of a field.

Tables that form the basis of a view.

Represents all of the characteristics of a business rule, such as the rule statement, the constraint it imposes, the structures it affects, and so on.

Restrictions or limitations on certain aspects of a database based on the ways an organization perceives and uses its data.

A field that contains a concatenated text value or the result of a mathematical expression.

A list of fields that can be defined only within an RDBMS. (Recall that you cannot define calculated fields within a table structure.)

The type of relationship that exists between a pair of tables in a relational database.

Within a given relationship, a table containing records that are explicitly dependent upon the existence of records in the related table.

A type of RDBMS in which data resides on a computer acting as a database server and users interact with the data through applications residing on their own computer, known as the database client.

A question that has a definitive, finite set of answers. This type of question leaves little opening for further follow-up questions.

A set of one or more symbols indicating the area within an operating system or command-driven software program in which a user can enter and execute commands. For example, C:\> is a command prompt within the MS-DOS operation system, and R> is the command prompt within R:BASE Technologies' R:BASE database software.

A primary key composed of two or more fields.

The values stored in the database.

Every occurrence of a given field value throughout the entire database is exactly the same.

A screen within an application program used to gather and collect data.

A set of rules or guidelines that governs the validity, consistency, and accuracy of the data in a database. There are four types of data integrity: table-level, field-level, relationship-level , and business rules.

A particular construct used to store data, such as a field or table.

A table that stores data used to supply information; it is the most common type of table in a relational database.

A view used to examine and manipulate data from one or more base tables.

A person who designs and implements a database.

The set of actions required to design the logical structure of a database.

A rule that imposes constraints that you can establish within the logical design of the database.

A software program that is used to create, maintain, modify, and manipulate a database.

Considering a given relationship between a pair of tables within a relational database, this is the minimum and maximum number of records that one table can have associated with a single record in the related table.

A rule that determines what the RDBMS should do when a user places a request to delete a given record in the parent table of a relationship.

A nonprimary key value that appears in more than one table within the database.

A field that appears in two or more tables for any of these reasons: It is used to relate a set of tables together; it indicates multiple occurrences of a particular type of value; or there is a perceived need for supplemental information.

Data that changes constantly and always reflects up-to-the-minute information.

This is a set of guidelines used to determine whether a given field is fit to serve as a candidate key.

This is a set of guidelines used to determine whether a given field is fit to serve as a foreign key.

This is a set of guidelines used to determine whether a given candidate key field is fit to serve as a primary key.

A set of guidelines used to create sound field structures and to help identify poorly designed fields.

A set of guidelines used to create sound table structures and to help identify poorly designed tables.

A person who uses and works with a database or database application program.

Commercial or custom-built software that serves as the user interface to a database.

Something that occurs at a given point in time (such as a doctor's appointment or stock transaction) that can be represented by a table.

Information that is clearly stated within the response to a given question.

Additional data types provided by many RDBMS programs that go beyond those specified by the SQL Standard.

The smallest structure in the database. It represents a characteristic of the subject of the table to which it belongs and is the only structure that actually stores data within the database.

Represents all of the general, physical, and logical elements of a field. (This is traditionally known as a domain.)

This type of data integrity warrants the following: the identity and purpose of a field is clear and all of the tables in which it appears are properly identified; field definitions are consistent throughout the database; the values of a field are consistent and valid; and the types of modifications, comparisons, and operations that can be applied to the values in the field are clearly identified.

A rule that imposes constraints on the elements of a field specification for a given field.

A set of one or more constraints imposed on a view that causes it to return a specific set of information.

This list contains key information ( name , type, and description) on every table in the database.

One of the two branches of mathematics upon which the relational model is based.

A database in which data is structured hierarchically and is typically diagrammed as an inverted tree.

The set of actions required to take a logical database design and incorporate it within a specific RDBMS.

Information that is not expressly stated within a response to a given question; you must derive it from your examination of the response.

A structure within an RDBMS program that can be used to improve data processing.

Data that is processed in a manner that makes it meaningful and useful to the person working with it or viewing it.

Information that must be supported by the data in the database in order for the organization to function properly, effectively, and efficiently .

Special fields that play very specific roles within a table; the type of key determines its purpose within the table. There are four significant types of key: candidate, primary, alternate, and foreign.

A database that has been in existence and in use for several years or more.

A table that helps to establish a many-to-many relationship between a given pair of tables.

A collection of nouns that imply various attributes of the items on the List of Subjects.

A collection of nouns that represent subjects that may be of interest to the organization.

A group of computers and peripherals located within a relatively limited geographical area that share services and resources.

A relationship that exists between a given table in one hierarchical database and another table in a second hierarchical database.

Changes made to the logical design of the database will not adversely affect the applications built upon the database.

A large, high-end, extremely powerful computer designed to handle literally millions of highly intensive computations simultaneously .

A relationship between a pair of tables in a relational database in which a single record in the first table can be related to many records in the second table and a single record in the second table can be related to many records in the first table.

The subordinate node in a given relationship within a network database.

A data value that has not been entered into a given field due to human error.

A statement that represents a general task that a user will perform against the data in the database.

A statement that establishes the purpose of the database and provides a distinct focus for your design work.

This incorporates two or more of the following: field-level integrity, table-level integrity, relationship-level integrity, and business rules.

A field that contains more than one type of distinct value.

A field that contains multiple instances of the same type of value.

A database in which data is structured hierarchically and is typically diagrammed as an inverted tree. Unlike the hierarchical database, however, it can contain several inverted trees that share branches.

A given collection of records within a network database.

A field that does not serve as a candidate, primary, alternate, or foreign key.

A specific set of rules that can be used to test a table structure to ensure that it is sound and free of problems.

The process of decomposing large tables into smaller ones in order to eliminate redundant data and duplicate data.

This represents a missing or unknown value; it does not represent a zero or a text string of one or more blank spaces.

A tangible item (such as a person, place, or thing) that can be represented by a table.

A method of presenting data from an analytical database in which the data is summarized and presented in the form of a table or cube.

A system for processing transactions as soon as the computer receives them and updating master files immediately in a database-management system.

A relationship between a pair of tables in a relational database in which a single record in the first table can be related to many records in the second table, but a single record in the second table can be related to only one record in the first table.

A relationship between a pair of tables in a relational database in which a single record in the first table is related to only one record in the second table, and a single record in the second table is related to only one record in the first table.

A question that can be answered in a variety of ways and can lead to further follow-up questions.

The complete set of software required to manage and provide services for the computer's hardware, peripheral equipment (such as printers and scanners ), and all other software programs. The computer cannot function without the operating system.

A type of database that stores dynamic data and is used in situations where there is a need to collect, modify, and maintain data on a daily basis; it is typically associated with OLTP.

Given two related tables, this is a record in one table that is not associated with any record in the other table.

The main node in a given relationship within a network database.

A type of relationship in a network database in which an owner table can be associated with one or more member tables, but a single member table must be associated with a specific owner table.

A loose collection of forms, index cards, manila folders, and so on, used to collect and maintain data.

A type of relationship in a hierarchical database in which a parent table can be associated with one or more child tables, but a single child table can be associated with only one parent table.

Within a given relationship, a table containing records that are not dependent upon the existence of records in the related table.

To decompose a given data value into smaller, distinct parts .

Changes the database software vendor makes to the physical implementation of the database will not adversely affect the applications built upon the database.

A mechanism that explicitly links a parent table to a child table in a hierarchical database.

A list of fields that represents the organization's fundamental data requirements and constitutes the core set of fields that must be defined in the database.

The core set of tables that must be defined in the database.

A field or group of fields that uniquely identifies each record within a table.

The combination of a given computing platform (PC, client/server, mainframe, etc.), operating system, and programming language.

A software program that can be used to define sets of instructions that will ultimately be processed and executed by the computer.

A request for information posed to the database via an SQL query statement.

A tool within a database software program that allows a user to build a query via an easy-to-use graphical interface.

A software program that is used to create, maintain, modify, and manipulate a relational database.

A structure that is composed of a complete set of singular values (regardless of whether any are null) for every field within a table and represents a unique instance of the table's subject.

A value that is repeated in a field as a result of the field's participation in relating two tables or as a result of some field or table anomaly.

The relational model's equivalent of a table.

A type of database that stores data in relations (perceived by the user as tables). Each relation is composed of tuples (records) and attributes (fields).

A data model based on set theory and first-order predicate logic invented by Dr. Edgar F. Codd.

An interdependence that exists between two tables when records in the first table can in some way be associated with records in the second table. There are three types of relationships in a relational database: one-to-one, one-to-many, and many-to-many.

A graphic representation of the relationship between a given pair of tables or between a given set of records within a table.

A type of data integrity that ensures that the relationship between a pair of tables is sound and that the records in the tables are synchronized whenever data is entered into, updated in, or deleted from either table.

A rule that imposes constraints that affect the characteristics of a relationship.

Any hand-written , typed, or computer-generated document used to arrange and present data in such a way that it is meaningful to the person or people viewing it.

The topmost table in a hierarchical database structure.

A series of screens that discuss various topics in an organized manner.

A relationship that exists when a given record in a table can be related to one or more other records within the table and one or more records can themselves be related to the given record.

A relationship that exists when a given record in a table can be related to one or more other records within the table.

A relationship that exists when a given record in a table can be related to only one other record within the table.

A relationship that exists between the records within a table. Similar to its dual-table counterpart , a self-referencing relationship can be one-to-one, one-to-many, or many-to-many.

A transparent construction that establishes and represents a relationship within a network database.

One of the two branches of mathematics upon which the relational model is based.

A standardized language used to create, maintain, modify, and query relational databases.

Data that is never (or very rarely) modified.

A set of rules or guidelines that governs the manner in which fields, tables, and views are defined.

A table that represents a subordinate subject of a particular data table.

The chief structure in a database. It is composed of fields and records and always represents a single, specific subject.

A statement that provides a clear definition of the subject represented by the table and states why the subject is important to the organization.

This type of data integrity ensures that a table is free of duplicate records and that the values of the table's primary key are unique, never null, and exclusively identify the table records.

The relational model's equivalent of a record.

The manner in which a table participates within a given relationship in a relational database. The type of participation can be either mandatory or optional.

The manner in which a given pair of tables can be related (one-to-one, one-to-many, many-to-many).

A value for a specific field that has yet to be determined or defined.

An acronym for Uniform Resource Locator. It represents an address for a given resource on the Internet, such as http://www.ForMereMortals.com.

A table that stores data specifically used to implement data integrity. (This is also known as a lookup table.)

A view used specifically to implement data integrity.

A virtual table composed of fields from one or more base tables in the database.

Represents all of the characteristics of a view, such as the name, type, base tables, and so on.

A document consisting of a Hypertext Markup Language (HTML) file and associated support files that can be accessed via the Internet.

A group of computers and peripherals located over a widespread geographic area that depends on various communications devices to share services and resources.

Two consecutive single quotes with no space in between them.