Free 1Z0-006 Practice Test Questions and Answers (2026) Practice Questions

Storage mapping is the aspect of physical model mapping that specifically deals with how data is physically stored and organized on disk, which directly impacts storage management and retrieval efficiency. This includes defining tablespaces, data files, and storage parameters for database objects like tables and indexes. By specifying these physical storage characteristics, designers can control data placement, manage space allocation, and optimize I/O performance. This is distinct from table mapping, which defines the logical structure of tables, or index mapping, which focuses solely on creating access paths.

A. Table mapping focuses on translating logical entities into physical table definitions (columns, data types, constraints), not their storage on disk.

B. Entity-Relationship mapping is part of the logical design phase, defining entities and their relationships, not physical storage.

D. Index mapping is a specific part of performance tuning that creates indexes for faster data retrieval, a subset of the broader storage and retrieval concern.

1. Oracle Corporation. (2021). Oracle Database Concepts

21c. Chapter 2

"Data Blocks

Extents

and Segments". This chapter explains the physical storage hierarchy (tablespaces

segments

extents

blocks) that is defined during storage mapping.

2. Oracle Corporation. (2023). Oracle Database SQL Language Reference

23c. "CREATE TABLE" statement documentation

specifically the storageclause and tablespace clause

which are used to implement storage mapping.

3. Teorey

T. J.

Lightstone

S. S.

& Nadeau

T. (2011). Database Modeling & Design: Logical Design (5th ed.). Morgan Kaufmann. Chapter 10

"Physical Database Design

" discusses the allocation of objects to storage (storage mapping).

Normalization is a systematic database design process used to organize columns and tables in a relational database to minimize data redundancy and improve data integrity. It involves decomposing larger, problematic tables into smaller, well-structured tables and defining relationships between them. This restructuring prevents data modification anomalies (insertion, update, and deletion issues) and makes the database more efficient for storage and retrieval by ensuring data is stored logically and without unnecessary duplication.

A. Storing data in multiple databases is a characteristic of a distributed database architecture, which is a different concept from normalization.

B. This describes the basic structure of a relational database in general, not the specific, formal process of normalization which refines that structure.

C. Deleting unnecessary data is a data maintenance or cleansing activity, not the structural design process of normalization.

1. Codd

E. F. (1970). A Relational Model of Data for Large Shared Data Banks. Communications of the ACM

13(6)

377–387. https://doi.org/10.1145/362384.362685. This foundational paper introduces the concepts that normalization is built upon

aiming for data independence and reduction of redundancy.

2. Date

C. J. (2003). An Introduction to Database Systems (8th ed.). Addison-Wesley. Part 3

"The Relational Model"

Chapters 10-12

provides a comprehensive definition of normalization as a process to eliminate redundancy and associated update anomalies.

3. Stanford University. (n.d.). CS145 Introduction to Databases

Lecture 10: Functional Dependencies. Retrieved from https://web.stanford.edu/class/cs145/notes/10-fds.pdf. The lecture defines normalization as the process of decomposing relations to eliminate anomalies caused by functional dependencies.

Considering data access patterns—how data is queried, updated, and accessed by users and applications—is critical for enhancing query performance. During physical model mapping, this analysis informs decisions on creating appropriate indexes, choosing table partitioning strategies, clustering data, and denormalizing tables. Each of these physical design choices is made with the primary goal of minimizing query execution time for the most frequent or critical database operations, thereby directly improving performance.

A. to optimize data storage: While some physical design choices affect storage, the primary driver for analyzing access patterns is performance, not storage minimization.

B. to enforce constraints: Constraints are business rules defined in the logical model to ensure data integrity; they are not determined by access patterns.

C. to improve data integrity: Data integrity is established through constraints (like primary and foreign keys) during logical design, not based on how data is accessed.

1. Oracle Corporation. (2023). Oracle Database Performance Tuning Guide, 19c. Part II, "SQL Tuning". This section emphasizes understanding application design and data access patterns as a prerequisite for effective SQL tuning and physical design choices like indexing.

2. Oracle Corporation. (2023). Oracle Database Concepts, 19c. Chapter 2, "Data Modeling". The section on Physical Data Models explains that this stage translates the logical model into a schema, considering performance characteristics like query patterns.

3. Coronel, C., & Morris, S. (2016). Database Systems: Design, Implementation, and Management (12th ed.). Cengage Learning. Chapter 6, "Database Design," details how physical design uses information about data access frequency to make decisions about indexing and data placement.

Data integrity refers to the overall accuracy, completeness, and consistency of data. In a database context, it means ensuring that data is reliable and correct throughout its lifecycle. This is achieved by implementing a set of rules and procedures, such as constraints (e.g., primary keys, foreign keys, check constraints), which prevent the entry of invalid or inconsistent data, thereby maintaining the database's validity.

B: The size of the database is a measure of storage and is unrelated to the correctness or quality of the data it contains.

C: The type of data (e.g., NUMBER, VARCHAR2) is a mechanism used to enforce integrity but is not the definition of integrity itself.

D: The speed of data retrieval is a measure of database performance, which is a separate concern from data accuracy and consistency.

- Oracle Database Concepts

19c

Chapter 5

"Data Integrity

" Section: "About Data Integrity". This section defines data integrity as the enforcement of business rules on the data.

- Elmasri

R.

& Navathe

S. B. (2017). Fundamentals of Database Systems (7th ed.). Pearson. Chapter 3

"The Relational Data Model and Relational Database Constraints

" Section 3.3

"Relational Integrity Constraints

" p. 71.

A constraint is a rule enforced on data in a table to ensure data accuracy and reliability. Constraints limit the type of data that can go into a table. For example, a CHECK constraint can enforce that a value in a GENDER column must be either 'M' or 'F', and a NOT NULL constraint ensures a column cannot have a null value. Both of these actions define the allowed values for a column, thereby enforcing business rules and data integrity.

A. The number of columns is part of the table's fundamental structure, defined during table creation, not by a constraint.

B. A primary key is a specific type of constraint used for unique identification, not the general definition of what all constraints do.

C. The order of rows is not guaranteed in a relational database and is not controlled by constraints; it is specified using an ORDER BY clause.

- Oracle Database SQL Language Reference

21c

"Constraints". The documentation states

"Constraints are rules that you can define for a table... to enforce business rules and to ensure the integrity and accuracy of the data." The description of CHECK constraints directly supports the idea of defining allowed values.

- "Database System Concepts

7th Edition" by Silberschatz

Korth

and Sudarshan. Chapter 3

"Introduction to SQL

" discusses integrity constraints

including check(P)

which ensures that a predicate P is satisfied

effectively limiting allowed values. (ISBN: 978-0078022159

Section 3.6).

In the three-schema architecture of database design (conceptual, logical, physical), the physical model represents the actual implementation of the database using a specific Database Management System (DBMS). It translates the logical model into a concrete schema, defining all necessary implementation details such as specific data types (e.g., VARCHAR2, NUMBER), indexing strategies, table partitioning, and storage allocation. It is the final blueprint before database creation.

A. Table relationships are primarily defined in the logical model, though they are implemented in the physical model.

C. Database constraints are specified in the logical model; the physical model defines the specific syntax for implementing them in a given DBMS.

D. The database schema is the result of implementing the physical model, but the term "physical model" refers to the design and details, not the resulting object collection.

1. Oracle Corporation. (2023). Oracle Database Data Warehousing Guide

21c. Chapter 3

Logical and Physical Database Design

Section: "About Physical Design". It states

"Physical design is the process of transforming the logical design into the actual physical database."

2. Coronel

C.

& Morris

S. (2016). Database Systems: Design

Implementation

and Management (12th ed.). Cengage Learning. Chapter 4

The Relational Database Model. The text distinguishes the physical model as describing the "database-specific implementation details." This textbook is widely used in university database courses.

A primary key is a core concept in relational database design. It is a specific choice of a minimal set of attributes (columns) that uniquely specifies a tuple (row) in a relation (table). The primary key's main features are that it must contain a unique value for each row of data, and it cannot contain NULL values. This ensures that every record in the table can be reliably and uniquely identified.

A: This is a non-technical and literal interpretation of the word "key" and is irrelevant to database concepts.

B: A foreign key is a field in one table that uniquely identifies a row of another table, creating a link between them.

D: A primary key constraint automatically creates a unique index, but the key itself is a logical constraint, not just a physical index structure.

1. Oracle Database Concepts

19c

"Chapter 5: Schema Objects"

Section "Overview of Constraints". This section describes the primary key as a constraint that enforces the uniqueness of rows.

2. Stanford University

CS 145 Introduction to Databases

Course Notes

"Relational Model and Keys". The course material defines a primary key as an underlined attribute in the schema that uniquely identifies tuples.

The fundamental purpose of a primary key is to enforce entity integrity within a table. It achieves this by uniquely identifying each record, ensuring two critical rules: first, the primary key value must be unique for each row, and second, it cannot contain NULL values. This guarantees that every row in a table is distinct and reliably identifiable, which is a cornerstone of data integrity in a relational database.

A: Data organization or alphabetical sorting is not the function of a primary key; this is handled by indexes or the ORDER BY clause.

C: Database access control is managed through security mechanisms like users, roles, and privileges (DCL), not by primary keys.

D: While the unique index automatically created for a primary key does speed up data retrieval, this is a secondary benefit. Its primary purpose is integrity.

Oracle Database Concepts, 11g Release 2 (11.2), E25789-01, Chapter 5, "Data Integrity", section "Types of Integrity Constraints". This section explicitly states, "The primary key uniquely identifies each row in a table."

Oracle Database SQL Language Reference, 11g Release 2 (11.2), E26088-01, Chapter 2, "Basic Elements of Oracle SQL", section "Constraints", subsection "PRIMARY KEY Constraints". This section details how a primary key enforces uniqueness and the NOT NULL constraint.

The relational, hierarchical, and NoSQL models are all types of database models that define how data is structured, stored, and manipulated. A "Logical" model, however, is not a type of database model in this context. Instead, it is a stage in the database design process that describes the data, relationships, and constraints, independent of any specific database management system or storage technology. The logical model is implemented physically using a specific database model like the relational model.

A. NoSQL is a broad category of modern database models (including document, key-value, and graph) that do not follow the strict relational model.

C. The relational model, based on tables with rows and columns, is the most widely used type of database model.

D. The hierarchical model is an early database model that structures data in a tree-like format with parent-child relationships.

1. Elmasri

R.

& Navathe

S. B. (2017). Fundamentals of Database Systems (7th ed.). Pearson. Chapter 1

Section 1.4

"Data Models

Schemas

and Instances

" distinguishes between data models (like relational

network

hierarchical) and the three-schema architecture (internal

conceptual

external)

where the logical model resides.

2. Oracle Database Data Warehousing Guide

19c

Chapter 3

"Logical Modeling and Physical Design". This guide clearly separates the "Logical Modeling" phase from the "Physical Design" phase

showing they are steps in a process

not alternative database model types.

3. Garcia-Molina

H.

Ullman

J. D.

& Widom

J. (2008). Database Systems: The Complete Book (2nd ed.). Pearson. Chapter 2

Section 2.1

"The Relational Model

" introduces the concept of a data model and contrasts it with levels of abstraction in a DBMS architecture.

ACID is a foundational concept in database systems, representing a set of properties that guarantee the reliability of database transactions. The acronym stands for Atomicity (an entire transaction takes place at once or doesn't happen at all), Consistency (the database remains in a valid state), Isolation (concurrent transactions do not affect each other), and Durability (once a transaction is committed, it remains so). These properties ensure data integrity.

A: These are terms associated with business intelligence or data analysis, not the properties of a database transaction.

B: These are general attributes of a system but do not correspond to the specific, formal properties of the ACID model.

C: These terms describe components of a software application's architecture, not the guarantees provided by a database transaction.

- Oracle Database Concepts

19c

Chapter 9

"Data Concurrency and Consistency

" Section: "Transaction Properties (ACID)". This section explicitly defines Atomicity

Consistency

Isolation

and Durability as the properties of a transaction.

- Ramakrishnan

R.

& Gehrke

J. (2003). Database Management Systems (3rd ed.). McGraw-Hill. Chapter 16

"Transaction Processing

" Section 16.2

"The ACID Properties

" pp. 513-515.