Information hiding in pl/sql, PL-SQL Programming

Information Hiding 

With the information hiding, you see only the details that are significant at a given level of algorithm and data structure design. The Information hiding keeps high-level design decisions separate from the low-level design details that are more likely to be change.

Algorithms

You employ information hiding for the algorithms through top-down design. Once you define the aim and interface specifications of a low-level procedure, you can pay no attention to the implementation details. They are hidden at higher levels. For e.g., the implementation of a procedure named raise_salary is hidden. All you require is to know that the procedure will increase a specific employee's salary by a given amount. Any change in the definition of raise_salary is visible to the calling applications.

Data Structures

You implement information hiding for the data structures through data encapsulation. By developing a set of utility subprograms for a data structure, you protect it from users and other developers. In that way, the other developers know how to use the subprograms that operate on the data structure but not how the structure is represented.

With the PL/SQL packages, you can specify whether the subprograms are public or private. Therefore, the packages enforce data encapsulation by letting you put subprogram definitions in a black box. The private definition is hidden and unapproachable. Only the package, not your application, is affected if definition changes. This simplifies the maintenance and enhancement.

Posted Date: 10/2/2012 1:52:04 AM | Location : United States







Related Discussions:- Information hiding in pl/sql, Assignment Help, Ask Question on Information hiding in pl/sql, Get Answer, Expert's Help, Information hiding in pl/sql Discussions

Write discussion on Information hiding in pl/sql
Your posts are moderated
Related Questions
%NOTFOUND The %NOTFOUND is logical, opposite of the %FOUND. The %NOTFOUND yields FALSE if the last fetch returned a row, or TRUE when the final fetch failed to return a row. I

WHILE-LOOP The WHILE-LOOP statement relates a condition with the series of statements enclosed by the keywords LOOP and END LOOP, as shown: WHILE condition LOOP sequence_of_sta

Recursion versus Iteration Dissimilar the iteration, recursion is not crucial to PL/SQL programming. Any problem which can be solved using recursion can be solving using the it

Defining REF CURSOR Types To make cursor variables, you take 2 steps. At first, you define a REF CURSOR type, and then declare the cursor variables of that type. You can defin

Count Operator in SQL Example: Counting the students who have scored more than 50 in some exam (SELECT COUNT (*) FROM (SELECT DISTINCT StudentId FROM EXAM_MARK WHE

Using research notes and Oracle documentation plan and execute an upgrade of an installation of Oracle 10g to Oracle 11g release 1. To do this you must show in screen shots and wri

Structure of an Object Type: Similar to package, an object type has 2 parts: the specification and the body. The specification is the interface to your applications; it declar

ROWNUM The ROWNUM returns a number representing the order in which a row was selected from the table. The first row selected has a ROWNUM of 1; the second row has a ROWNUM of

Parameter and Keyword Description: dynamic_string: This is a string variable, literal, or expression which represents a SQL statement or the PL/SQL block. define_vari

Declaring Cursor Variables Once a REF CURSOR type is define by you, and then you can declare the cursor variables of that type in any PL/SQL block or subprogram. In the exampl