1.

Object Containment

1. Each component in a design may contain other components

2. Can be modeled as containment of objects. Objects containing; other objects are called
composite objects.
3. Multiple levels of containment create a containment hierarchy
 links interpreted as is-part-of, not is-a.
4. Allows data to be viewed at different granularities by different users.

2.
Object-Oriented Data Model

1. Loosely speaking, an object corresponds to an entity in the E-R model.

2. The object-oriented paradigm is based on encapsulating code and data related to an
object into single unit.
3. The object-oriented data model is a logical data model (like the E-R model).
4. Adaptation of the object-oriented programming paradigm (e.g., Smalltalk, C++) to
database systems.

Relational Model and Types

 Data type completeness: each type constructor can be applied uniformly to types in
the type system.
 In the basic relational model:
 There is only one type constructor (i.e. relation).
 That type constructor cannot be applied to itself.
 Incorporating data type completeness to the relational model gives nested relations.
 In addition, the type relation is essentially:
 Bag < Tuple >.
 Separating out these type constructors provides further flexibility, such as tuple-
valued attributes.

3. COMPONENTS OF JDBC
 JDBC has four Components:
1. The JDBC API.
2. The JDBC Driver Manager.
3. The JDBC Test Suite.
4. The JDBC-ODBC Bridge.

4. What is the diff between RDO and ADO?

RDO is Hierarchy model where as ADO is Object model. ADO can access data
from both flat files as well as the data
bases. I.e., It is encapsulation of DAO, RDO , OLE

RDO (Remote Data Objects) is an application program interface (API) from

Microsoft that lets programmers writing Windows applications get access to and
from both Microsoft and other database providers. In turn, RDO statements in a
program use Microsoft's lower-layer Data Access Objects (DAO) for actual access
to the database. Database providers write to the DAO interface.
RDO has evolved into ActiveX Data Objects (ADO) which is now the program
interface Microsoft recommends for new programs. ADO also provides access to
nonrelational databases and is somewhat easier to use.

5.Decision tree

A decision tree is a decision support tool that uses a tree-like graph or model of decisions and
their possible consequences, including chance event outcomes, resource costs, and utility. It is
one way to display an algorithm. Decision trees are commonly used in operations research,
specifically in decision analysis, to help identify a strategy most likely to reach a goal. Another
use of decision trees is as a descriptive means for calculating conditional probabilities. When the
decisions or consequences are modelled by computational verb, then we call the decision tree a
computational verb decision tree[1].

A decision Tree consists of 3 types of nodes:-

1. Decision nodes - commonly represented by squares

2. Chance nodes - represented by circles
3. End nodes - represented by triangles
Decision tree learning, used in data mining and machine learning, uses a decision tree as a
predictive model which maps observations about an item to conclusions about the item's target
value. More descriptive names for such tree models are classification trees or regression trees.
In these tree structures, leaves represent classifications and branches represent conjunctions of
features that lead to those classifications.

6.query processing
1. (computing) Processing of a specific set of instructions for extracting particular data.
2. (computing) Processing to extract data from a database and present it for use.

The query processor turns user queries and data modification commands into a query plan - a
sequence of operations (or algorithm) on the database
-from high level queries to low level commands
Decisions taken by the query processor
-Which of the algebraically equivalent forms of a query will lead to the most
efficient algorithm?
-For each algebraic operator what algorithm should we use to run the operator?
How should the operators pass data from one to the other? (eg, main memory buffers, disk
buffers

7.Temporal database
A temporal database is a database with built-in time aspects, e.g. a temporal data model and
a temporal version of Structured Query Language.
More specifically the temporal aspects usually include valid-time and transaction-time. These
attributes go together to form bitemporal data.

 Valid time denotes the time period during which a fact is true with respect to the real
world.
 Transaction time is the time period during which a fact is stored in the database.
 Bitemporal data combines both Valid and Transaction Time.

What is temporal DB?

  Temporal databases, encompass all DB applications that require some aspect of time
when organizing their information.
 They exhibit the need for developing a set of unifying concepts for application
developers to use.
 Temporal DB applications have been developed since the early days of database
usage. However, in creating these applications, it was mainly left to the application
developers to discover, design, program, and implement the temporal concepts.

8.Crash recovery

Transactions (or units of work) against a database can be interrupted unexpectedly. If a failure
occurs before all of the changes that are part of the unit of work are completed and committed,
the database is left in an inconsistent and unusable state. Crash recovery is the process by
which the database is moved back to a consistent and usable state. This is done by rolling back
incomplete transactions and completing committed transactions that were still in memory
when the crash occurred (Figure 2). When a database is in a consistent and usable state, it has
attained what is known as a "point of consistency".

multi-threaded server (MTS)

A server that is configured to allow many user processes to share very few server processes, so
the number of users that can be supported is increased. With MTS configuration, many user
processes connect to a dispatcher. The dispatcher directs multiple incoming network session
requests to a common queue. An idle shared server process from a shared pool of server
processes picks up a request from the queue. This means a small pool of server processes can
server a large amount of clients.

or
The new multithreaded server approach is better for multiuser access to a central database
because each client request (for an object) can get its own thread. Using multiple threads is
faster than starting a process to handle each IO request, Woods said.

Client/Server Technology

Client/Server technology is computer architecture for separating the application’s functions

into two or more distinct parts. Client/Server technology divides functions into client
(requestor) and server (provider) subsystems, with standard communication methods (such as
TCP/IP and z39.50). To facilitate the sharing of information between them, it divides the
functions. On the desktop computer the client presents and manipulates data. To store and
retrieve protected data the server acts like a mainframe.
Or
Client/Server technology is a means for separating the functions of an application into two or more
distinct parts. The client presents and manipulates data on the desktop computer. The server acts like
a mainframe to store and retrieve protected data. Together each machine can perform the duties it is
best at.