1. Database schema or (ERD) which is an Entity Relationship Diagram.

The basic building

blocks of relational database are two of them. number one we’ve got tables and the tables
have fields and then these fields are related to other fields in other tables. Relational
database each table is a little flat file on its own and we know each table describes a
particular kind of entity then you have the different attributes or characteristics of each one.
Each time we have data inside a relational table, we need a way to identify each row stored
into that table, for this we need a element or group of elements that is unique for each row so
this element or elements is/are the primary key and
to define a relationship or link between two tables, you use a Foreign key for the dependent
table. This foreign key is the primary key of the "parent" table. The rule to use is Every non-
null foreign key value must match an existing primary key value.
3. relational algebra describes how data is naturally organized into sets of data, aptly so as data
is the documentation of a real life person, place or thing and the events or transactions
between them at a point in timeTo organize the data, first the redundant data and repeating
groups of data are removed, which we call normalized. By doing this the data is organized or
normalized into what is called first normal form (1NF). Typically a logical data model
documents and standardizes the relationships between data entities (with its elements). A
primary key uniquely identifies an instance of an entity, also known as a record.
Once the data is normalized and in sets of data (entities and tables), the main operations of
the relational algebra can be performed which are the set operations (such as union,
intersection, and cartesian product), selection (keeping only some lines of a table) and the
projection (keeping only some columns The tuple relational calculus is based on specifying a
number of tuple variables. Each tuple variable usually ranges over a particular database
relation, meaning that the variable may take as its value any individual tuple from that relation.
For example this simple tuple relational calculus query is of the form
{t | COND(t)} where t is a tuple variable and COND (t) is a conditional expression involving t.
The result of such a query is the set of all tuples t that satisfy COND (t) and Another variation
of relational calculus called the domain relational calculus, or simply, domain calculus is
equivalent to tuple calculus and to relational algebra The language used is called QBE
(Query-By-Example) An expression of the domain calculus is of the form
{ x1, x2, . . ., xn | COND(x1, x2, . . ., xn, xn+1, xn+2, . . ., xn+m)}
where x1, x2, . . ., xn, xn+1, xn+2, . . ., xn+m are domain variables that range over domains (of
attributes) and COND is a condition or formula of the domain relational calculus.

4. an "entity relationship" model is just a way to think about & visualize the relationships between
your data. For example: if you have an application that keeps track of people, phone numbers and
birthdays, then you could say (for example) that there is a one-to-one relationship between phone
numbers and people (assuming that each person has their own mobile phone), and a one-to-many
relationship between people and birthdays (several people can have a birthday on May 1st.) But
your model should make it clear that for sanity's sake, there shouldn't be a relationship between
phone numbers and birthdays. ER diagrams often use symbols to represent three different types
of information. Boxes are commonly used to represent entities. Diamonds are normally used to
represent relationships and ovals are used to represent attributes. For example, to describe
information needs and/or the type of information that is to be stored in the database during the
requirements analysis.

5. Normalization is the process of efficiently organizing data in a database. There are two goals
of the normalization process: eliminating redundant data (for example, storing the same data
in more than one table) and ensuring data dependencies make sense (only storing related
data in a table). Both of these are worthy goals as they reduce the amount of space a
database consumes and ensure that data is logically stored When you normalize a table you
are actually splitting the table so that you can easily identify and segregate data based upon
your need and ease of access and use.
The basic idea is to enable easier search and faster access.
different Normal forms like 1st, 2nd, 3rd, 4th , Boyce-Codd are available and each depends
on how simple / complex your database is.

11. One X blocked process is waiting to complete the transaction of the Y process and the same

time, Y process is blocked because it is also waiting to complete the transaction of the X

process.This is called as Deadlock situation.Deadlock is a next stage of the blocking situation

so if you want to avoid Deadlock situation, you should first find the blocked transaction and

tried to remove internal dependency of the transactions.

10. Atomicity - "All or nothing" .. entire transaction fails if part of a query fails
Consistency - Only valid data is written to database
Isolation - Multiple simultaneous transactions don't impact each other
Durability - Transactions committed to database will never be lost

It's a set of goals written by database programmers to ensure the integrity of data within a database. That
way, when you request data from a database, you know you will always get good quality data. The
downfall of ACID compliant databases is performance. In order to implement an ACID compliant
database properly, performance is sacrificed. So, you have to beef up the hardware system in order to
overcome the performance degradation for all of the checking constraints needed to ensure ACID
compliance.