Need senior oracle database administrator, Database Management System

Assignment Help:

Project Description:

Oracle Certified Professional with 20 years of practice, Oracle version 6.0.34, 7.3, 8.0, 8i, 9i, 10G, 11G, 12C.

Crossplatform migration, Informix, MSSqlServer, MySQL, PostGreSQL, MSAccess, DB2 to any Oracle version.

Backup policy definition, tools such as RMAN, DataGuard, Oracle Standby.

Database and instance performance tuning, pl/sql and SQL performance tuning.

EBS DBA.

OBIEE performance tuning

OAS, iAS configuration and installation.

PL/SQL developer and Oracle APEX.

Certified SAP Netweaver Administrator

Lot of expertise on AIX, HP-UX, Solaris, Linux flavors and windows servers.

Skills required are Database Administration, Linux, Oracle, Project Management, UNIX

Related Discussions:- Need senior oracle database administrator

Explain the hierarchical database model, Problem: (a) Briefly explain t...

Problem: (a) Briefly explain the ‘Hierarchical Database Model' using appropriate diagram. (b) List and briefly describe five potential benefits of the database approach comp

What is a built-in, What is a Built-in A notation of identity is built-...

What is a Built-in A notation of identity is built-into the data model or programming language and no user-supplied identifier is needed. This form of identity is used in objec

What are the benefits of decomposing a system, What are the benefits of dec...

What are the benefits of decomposing a system? The benefits of decomposing a system into subsystems are that after decomposition, each individual component become smaller and e

Define transitive dependencies, What do you understand by transitive depend...

What do you understand by transitive dependencies? Define with an example any two problems that can take place in the database if transitive dependencies are available in the datab

In tuple relational calculus p1- p2 is equivalent to, In tuple relational ...

In tuple relational calculus P1 → P2 is equivalent to ? A In tuple relational calculus P1→ P2 is equivalent to ¬P1 V P2. (The logical implication expression A B, meaning

Define- relational algebra, Define- relational algebra. The relational ...

Define- relational algebra. The relational algebra is a procedural query language. It having of a set of operations that take one or two relation as input and make a new relati

Determine the strong and weak entity, Determine the Strong and Weak Entity ...

Determine the Strong and Weak Entity Based on the method of foreign key, there might be arise a situation when we have to relate an entity having a primary key of its own and a

Define decision tree classifiers, Define decision tree classifiers? As ...

Define decision tree classifiers? As the name suggests decision tree classifiers use a tree: Every leaf node has an associated class, and every internal node has a predicate as

What is meant by heuristic optimisation, What is meant by heuristic optimis...

What is meant by heuristic optimisation? Discuss the main heuristics that are applied during query optimisation. Ans: In heuristic optimization, heuristics are employed to r

Strict 2pl-two phase locking (2pl), Strict 2PL :Though, this basic 2PL suff...

Strict 2PL :Though, this basic 2PL suffers from the trouble that it can result into loss of isolation / atomic property of transaction as theoretically speaking once a lock is rele

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages