Oracle:: Distinct Features of Oracle

ORACLE:
INTRODUCTION:
Oracle is a relational database management system, which organizes data in the
form of tables. Oracle is one of many database servers based on RDBMS model, which
manages a seer of data that attends three specific things-data structures, data integrity and
data manipulation. With oracle cooperative server technology we can realize the benefits
of open, relational systems for all the applications. Oracle makes efficient use of all
systems resources, on all hardware architecture; to deliver unmatched performance, price
performance and scalability. Any DBMS to be called as RDBMS has to satisfy
Dr.E.F.Codd’s rules.
DISTINCT FEATURES OF ORACLE:
• ORACLE IS PORTABLE:
The Oracle RDBMS is available on wide range of platforms ranging from PCs to
super computers and as a multi user loadable module for Novel NetWare, if you develop
application on system you can run the same application on other systems without any
modifications.
• ORACLE IS COMPATIBLE:
Oracle commands can be used for communicating with IBM DB2 mainframe
RDBMS that is different from Oracle, that is Oracle compatible with DB2. Oracle
RDBMS is a high performance fault tolerant DBMS, which is specially designed for
online transaction processing and for handling large database applications.
• MULTITHREADED SERVER ARCHITECTURE:
Oracle adaptable multithreaded server architecture delivers scalable high

performance for very large number of users on all hardware architecture including
symmetric multiprocessors (sumps) and loosely coupled multiprocessors. Performance is
achieved by eliminating CPU, I/O, memory and operating system bottlenecks and by
optimizing the Oracle DBMS server code to eliminate all internal bottlenecks.
FEATURES OF ORACLE:
Most popular RDBMS in the market because of its ease of use

• Client/server architecture.
• Data independence.
• Ensuring data integrity and data security.
• Managing data concurrency.
• Parallel processing support for speed up data entry and online transaction
processing used for applications.
• DB procedures, functions and packages.
Dr.E.F.CODD’s RULES
These rules are used for valuating a product to be called as relational database
management systems. Out of 12 rules, a RDBMS product should satisfy at least 8
rules +rule called rule 0 that must be satisfied.
RULE 0: FOUNDATION RULE:
For any system that is to be advertised as, or claimed to be relational DBMS. That
system should manage database with in it self, with out using an external language.
RULE 1.INFORMATION RULE

All information in relational database is represented at logical level in only one way
as values in tables.
RULE 2.GUARANTEED ACCESS:

Each and every data in a relational database is guaranteed to be logically accessibility
by using to a combination of table name, primary key value and column name
RULE 3.SYSTEMATIC TREATMENT OF NULL VALUES

Null values are supported for representing missing information and inapplicable
information. They must be handled in systematic way, independent of data types.
RULE 4 DYNAMIC ONLINE CATALOG BASED RELATION MODEL:

The database description is represented at the logical level in the same way as
ordinary data so that authorized users can apply the same relational language to its
interrogation as they do to the regular data.
RULE 5: COMPRHENSIVE DATA SUB LANGUAGE

A relational system may support several languages and various models of terminal
use. However there must be one language whose statement can express all of the
following:
Data Definitions, View Definitions, Data Manipulations, Integrity, Constraints,
Authorization and transaction boundaries.
RULE 6.VIEW UPDATING

Any view that is theoretical can be updatable if changes can be made to the tables that
effect the desired changes in the view.
RULE 7.HIGH LEVEL UPDATE, INSERT and DELETE

The capability of handling a base relational or derived relational as a single operand
applies not only retrieval of data also to its insertion, updating, and deletion.
RULE 8.PHYSICAL DATA INDEPENDENCE
Application program and terminal activities remain logically unimpaired whenever
any changes are made in either storage representation or access method.
RULE 9.LOGICAL DATA INDEPENDENCE

Application programs and terminal activities remain logically unimpaired whenever
any changes are made in either storage representation or access methods.
RULE 10: INTEGRITY INDEPENDENCE:
Integrity constraints specific to particular database must be definable in the relational
data stored in the catalog, not in application program.
RULE 11: DISTRIBUTED INDEPENDENCE:
Whether or not a system support database distribution, it must have a data sub-
language that can support distributed databases without changing the application
program.
RULE 12: NON SUB-VERSION:
If a relational system has low level language, that low language cannot use to
subversion or by pass the integrity rules and constraints expressed in the higher level
relational language.
ORACLE SUPPORTS THE FOLLOWING CODD’S RULES:
Rule 1: Information Rule (Representation of information)-YES.
Rule 2: Guaranteed Access-YES.
Rule 3: Systematic treatment of Null values-YES.
Rule 4: Dynamic on-line catalog-based Relational Model-YES.
Rule 5: Comprehensive data sub language-YES.
Rule 6: View Updating-PARTIAL.
Rule 7: High-level Update, Insert and Delete-YES.
Rule 8: Physical data Independence-PARTIAL.
Rule 9: Logical data Independence-PARTIAL.
Rule 10: Integrity Independence-PARTIAL.
Rule 11: Distributed Independence-YES.
Rule 12: Non-subversion-YES.

Oracle:: Distinct Features of Oracle

Uploaded by

Oracle:: Distinct Features of Oracle

Uploaded by

ORACLE:

DISTINCT FEATURES OF ORACLE:

• MULTITHREADED SERVER ARCHITECTURE:

Oracle adaptable multithreaded server architecture delivers scalable high

Most popular RDBMS in the market because of its ease of use

RULE 0: FOUNDATION RULE:

RULE 1.INFORMATION RULE

RULE 2.GUARANTEED ACCESS:

RULE 3.SYSTEMATIC TREATMENT OF NULL VALUES

RULE 4 DYNAMIC ONLINE CATALOG BASED RELATION MODEL:

RULE 5: COMPRHENSIVE DATA SUB LANGUAGE

RULE 6.VIEW UPDATING

RULE 7.HIGH LEVEL UPDATE, INSERT and DELETE

RULE 9.LOGICAL DATA INDEPENDENCE

You might also like