Normalization:- In the design of a relational database management system (RDBMS),

the process of organizing data to minimize redundancy is called normalization. The goal
of database normalization is to decompose relations with anomalies in order to produce
smaller, well-structured relations. Normalization usually involves dividing large tables
into smaller (and less redundant) tables and defining relationships between them. The
objective is to isolate data so that additions, deletions, and modifications of a field can be
made in just one table and then propagated through the rest of the database via the
defined relationships.

Aggregation:- Aggregation is an important concept in database design where composite objects

can be modeled during the design of database applications. Therefore, preserving the
aggregation concept in database implementation is essential. In this paper, we propose
models for implementation of aggregation in an Object-Relational Database Management
System (ORDBMS) through the use of index clusters and nested tables. ORDBMS is a
commercial Relational Database Management Systems (RDBMS), like Oracle, which
support some object-oriented concepts. We will also show how queries can be performed on
index clusters and nested tables.

Primary Key :- The primary key of a relational table uniquely identifies each record in
the table. It can either be a normal attribute that is guaranteed to be unique (such as Social
Security Number in a table with no more than one record per person) or it can be
generated by the DBMS (such as a globally unique identifier, or GUID, in Microsoft SQL
Server). Primary keys may consist of a single attribute or multiple attributes in
combination.
Examples:
Imagine we have a STUDENTS table that contains a record for each student at a
university. The student's unique student ID number would be a good choice for a primary
key in the STUDENTS table. The student's first and last name would not be a good
choice, as there is always the chance that more than one student might have the same
name.

Join :- A SQL join clause combines records from two or more tables in a database.[1] It
creates a set that can be saved as a table or used as is. A JOIN is a means for combining
fields from two tables by using values common to each. ANSI standard SQL specifies
four types of JOINs: INNER, OUTER, LEFT, and RIGHT. In special cases, a table (base table,
view, or joined table) can JOIN to itself in a self-join. A programmer writes a JOIN
predicate to identify the records for joining. If the evaluated predicate is true, the
combined record is then produced in the expected format, a record set or a temporary
table.

Database Administrator :- A database administrator (DBA) is a person responsible

for the design, implementation, maintenance and repair of an organization's database.
They are also known by the titles Database Coordinator or Database Programmer, and
is closely related to the Database Analyst, Database Modeler, Programmer Analyst, and
Systems Manager. The role includes the development and design of database strategies,
monitoring and improving database performance and capacity, and planning for future
expansion requirements. They may also plan, co-ordinate and implement security
measures to safeguard the database.[1] Employing organizations may require that a
database administrator have a certification or degree for database systems (for example,
the Microsoft Certified Database Administrator).

1
*Some organizations have a hierarchical level of database administrators, generally:

• Data Analysts/Query designers

• Junior DBAs
• Midlevel DBAs
• DBA consultants

Personal Characteristics/Skills:

1. Strong organizational skills

2. Strong logical and analytical thinker
3. Ability to concentrate and pay close attention to detail
4. Strong written and verbal communication skills
5. Willing to pursue education throughout your career

Database administrator's activities can be listed as below

1. Transferring Data
2. Replicating Data
3. Maintaining database and ensuring its availability to users
4. Controlling privileges and permissions to database users
5. Monitoring database performance
6. Database backup and recovery
7. Database security

View :- In database theory, a view consists of a stored query accessible as a virtual

table composed of the result set of a query. Unlike ordinary tables (base tables) in a
relational database, a view does not form part of the physical schema: it is a dynamic,
virtual table computed or collated from data in the database. Changing the data in a table
alters the data shown in subsequent invocations of the view.

Views can provide advantages over tables:

• Views can represent a subset of the data contained in a table

• Views can join and simplify multiple tables into a single virtual table
• Views can act as aggregated tables, where the database engine aggregates data
(sum, average etc.) and presents the calculated results as part of the data
• Views can hide the complexity of data; for example a view could appear as
Sales2000 or Sales2001, transparently partitioning the actual underlying table
• Views take very little space to store; the database contains only the definition of a
view, not a copy of all the data it presents
• Depending on the SQL engine used, views can provide extra security
• Views can limit the degree of exposure of a table or tables to the outer world

Just as functions (in programming) can provide abstraction, so database users can create
abstraction by using views. In another parallel with functions, database users can
manipulate nested views, thus one view can aggregate data from other views. Without the
use of views the normalization of databases above second normal form would become
much more difficult. Views can make it easier to create lossless join decomposition.