UNIT-IV OBJECT ORIENTED DESIGN

Preface This unit deals with axioms, designing classes, object Interoperability. The objects discovered during analysis can serve as the framework for design. The classs attributes, methods, and associations identified during analysis must be designed for implementation as a data type expressed in the implementation language. Introduction ew classes must be introduced to store intermediate results during program execution. !mphasis shifts from the application domain to implementation and computer concepts such as user interfaces or view layer and access layer. "uring the analysis, we look at the physical entities or business objects in the system# that is, who the players are and how they cooperate to do the work of the application. These objects represent tangible elements of the business, these objects could be individuals, organi$ations, machines, or whatever else makes sense in the context of the real-world system. "uring the design phase, we elevate the model into logical entities, some of which might relate more to the computer

domain &such as user interfaces or the access layer' than the real world or the physical domain &such as people or employees'. The goal here is to design the classes that we need to implement the system.

OBJECT-ORIENTED DESIGN AXIOMS:

(y definition, an axiom is a fundamental truth that always is observed to be valid and for which there is no counterexample or exception. ) theorem is a proposition that may not be self-evident but can be proven from accepted axioms ) corollary is a proposition that follows from an axiom or another proposition that has been proven. The author has applied *uhs design axioms to object-oriented design. )xiom I deals with relationships between system components &such as classes, re+uirements, and software components', and )xiom , deals with the complexity of design.

)xiom %- The independence a io!. .aintain the independence of components. )xiom ,- The in"o#!a$ion a io!% .inimi$e the information content of the design.

&IGURE The origin of corollaries. /orollaries %, ,, and 0 are from both axioms, whereas corollary 1 is from axiom % and corollaries 2 and 3 are from axiom ,. CORO''ARIES /orollaries may be more useful in making specific design decisions, since they can be applied to actual situations more easily than the original axioms. They even may be called de(ign #)le(* and all are derived from the two basic axioms-

/orollary %- Unco)pled de(ign +i$h le(( in"o#!a$ion con$en$% 4ighly cohesive objects can improve coupling because only a minimal amount of essential information need be passed between objects. /orollary ,- Single p)#po(e% !ach class must have a single, clearly defined purpose. 5hen you document, you should be
0

able to easily describe the purpose of a class in a few sentences. /orollary 0- 'a#ge n)!,e# o" (i!ple cla((e(% 6eeping the classes simple allows reusability. /orollary 1- S$#ong !apping% There must be a strong association between the physical system &analysiss object' and logical design &designs object'. /orollary 2- S$anda#di-a$ion% 7romote standardi$ation by designing interchangeable components and reusing existing classes or components. /orollary 3- De(ign +i$h inhe#i$ance% /ommon behavior &methods' must be moved to super classes. The super classsubclass structure must make logical sense.

Co#olla#. /% Unco)pled De(ign +i$h 'e(( In"o#!a$ion Con$en$ The main goal here is to maximi$e objects cohesiveness among objects and software components in order to improve coupling because only a minimal amount of essential information need be passed between components. Co)pling: Coupling is a measure of the strength of association established by a connection from one object or software component to another.

In addition to minimi$ing the complexity of message connections, also reduce the number of messages sent and received by an object.

Cohe(ion /oupling deals with interactions between objects or software components. 5e also need to consider interactions within a single object or software component, called cohe(ion%

Co#olla#. 0: Single 1)#po(e !ach class must have a purpose. !very class should be clearly defined and necessary in the context of achieving the systems goals.

 Co#olla#. 2: 'a#ge N)!,e# o" Si!ple# Cla((e(* Re)(a,ili$. ) great benefit results from having a large number of simpler classes. The smaller are your classes, the better are your chances of reusing them in other projects. 8arge and complex classes are too speciali$ed to be reused.

Co#olla#. 3: S$#ong Mapping 9bject-oriented analysis and object-oriented design )s the model progresses from analysis to

are based on the same model. the same. :or example, during analysis we might identify a class !mployee. "uring the design phase, we need to design this class design its methods, its association with other objects, and its view and access classes. ) strong mapping links classes identified during analysis and classes designed during the design phase &e.g., view and access classes'. implementation, more detail is added, but it remains essentially

Co#olla#. 4: S$anda#di-a$ion To reuse classes, you must have a good understanding of the classes in the object-oriented programming environment you

are using. .ost object-oriented systems, such as *malltalk, ;ava, / <+, or 7ower(uilder, come with several built-in class libraries. *imilarly, object-oriented systems are like organic systems, meaning that they grow as you create new applications. The knowledge of existing classes will help you determine what new classes are needed to accomplish the tasks and where you might inherit useful behavior rather than reinvent the wheel. Co#olla#. 5: De(igning +i$h Inhe#i$ance 5hen you implement a class, you have to determine its ancestor, what attributes it will have, and what messages it will understand. Then, you have to construct its methods and protocols.

DESIGNING CLASSES: REFINING ATTRIBUTES

)ttributes identified in object-oriented analysis must be refined with an eye on implementation during this phase. In the analysis phase, the name of the attribute was sufficient. 4owever, in the design phase, detailed information must be added to the model. The main goal of this activity is to refine existing attributes or add attributes that can elevate the system into implementation.

 A$$#i,)$e $.pe( The three basic types of attributes are %. *ingle-value attributes. ,. .ultiplicity or multivalue attributes. 0. >eference to another object, or instance connection.

)ttributes represent the state of an object. 5hen the

state of the object changes, these changes are reflected in the value of attributes. The single-value attribute is the most common

attribute type. It has only value or state. :or example, attributes such as name, address, or salary are of the single-value type. The multiplicity or multivalue attribute is the opposite

of the single-value attribute since, as its name implies, I can have a collection of many values at any point in time. Instance connection attributes are re+uired to provide

the mapping needed by an object to fulfill its responsibilities, in other words, instance connection model association.

:or example, a person might have one or more bank

accounts. ) person has $ero to many instance connections to

?

account&s'

UM' A$$#i,)$e( p#e(en$a$ion: 9/8 can be used during the design phase to define the class attributes. The following is the attribute presentation suggested by @.8Vi(i,ili$. na!e : $.pe-e p#e((ion 6 ini$ial-7al)e 5here visibility is one of the following-

< public visibility A protected visibility - private visibility

Type-expression is a language-dependent specification of the implementation type of an attribute. Initial-value is a language-dependent expression for the initial value of a newly created object. The initial value is optional. !xamplenamesB%CD- *tring pointsB,..ED- 7oint

DESIGNING METHODS AND PROTOCOLS :

The main goal of this activity is to specify the algorithm for methods identified so far. ) class can provide several types of methods-

Constructor : .ethod that creates instances &objects' of the class. Destructor : The method that destroys instances. Conversion method : The method that converts a value from one
unit of measure to another.

Copy method : The method that copies the contents of one

instance to another instance.

Attribute set. The method that sets the values of one or more
attributes.

Attribute get. The method that returns the values of one or more
attributes.

I/O methods. The methods that provide or receive data to or from

a device.

Domain speci ic. The method specific to the application.

The re+uirement of simplification, while retaining functionality, seems to lead to increased utility. 4ere are five rules-

%C

%. If it looks messy, then its probably a bad design. ,. If it is too complex, then its probably a bad design. 0. If it is too big, then its probably a bad design. 1. If people dont like it, then its probably a bad design. 2. If it doesnt work, then its probably a bad design.

De(ign I(()e(: A7oiding De(ign 1i$"all( Gour goal should be maximum reuse of what you have to avoid creating new classes as much as possible. 6eep a careful eye on the class design and make sure that an objects role remains well defined. If an object loses focus, you need to modify the design. )pply /orollary , &single purpose'. .ove some functions into new classes that the object would use. )pply /orollary % &uncoupled design with less information content'. (reak up the class into two or more classes. )pply /orollary 0 &large number of simple classes'. >ethink the class definition based on experience gained.

UM' Ope#a$ion 1#e(en$a$ion The following operation presentation has been suggested by the @.8. The operation syntax is this%%

visibility name: !parameter"list#: return"type"expression 5here visibility is one of< public visibility &accessibility to all classes'.

A protected visibility &accessibility to subclasses and operations of the class'. H private visibility &accessibility only to operations of the class'.

4ere, name is the name of the operation. $arameter"list: is a list of parameters, separated by commas, each specified by name: type"expression 6 de ault value &where name is the name of the parameter, type-expression is the languagedependent specification of an implementation type, and defaultvalue is an optional value'.

%eturn"type"expression: is a language-dependent specification of the implementation of the value returned by the method. If returntype is omitted, the operation does not return a value# for example,

8ge$Na!e9:: aNa!e 8ge$Acco)n$N)!,e# 9acco)n$: $.pe:: acco)n$ N)!,e#

%,

 C'ASS

VISIBI'IT;:

DESIGNING

<E''%DE&INED

1UB'IC* 1RIVATE* AND 1ROTECTED 1ROTOCO'S In designing methods or attributes for classes, you are confronted with two problems. 9ne is the p#o$ocol* or interface to the class operations and its visibility# and the other is how it is implemented. 9ften the two have very little to do with each other. :or example, you might have a class (ag for collecting various objects that counts multiple occurrences of its elements. 9ne implementation decision might be that the (ag class uses another class, say, "ictionary &assuming that we have a class "ictionary', to actually hold its elements.

*ubclass &IGURE
%0

7ublic protocols define the functionality and external messages of an object, while private protocols define the implementation of an object. The private protocol !visibility# of the class, includes messages that normally should not be sent from other objects# it is accessible only to operations of that class. In private protocol, only the class itself can use the method. &he public protocol !visibility# defines the stated behavior of the class as a citi$en in a population and is important information for users as well as future descendants, so it is accessible to all classes. In a protected protocol !visibility#, subclasses the can use the method in addition to the class itself. The problem of encapsulation lea'age occurs when details about a classs internal implementation are disclosed through the interface.

/% 1#i7a$e and 1#o$ec$ed 1#o$ocol 'a.e#(: In$e#nal Items in these layers define the implementation of the object. 0% 1),lic 1#o$ocol 'a.e#: E $e#nal Items in this layer define the functionality of the object. 4ere are some things to keep in mind when designing class protocols Iood design allows for polymorphism.

%1

ot all protocol should be public# again apply design axioms and corollaries.

OBJECT

STORAGE

AND

OBJECT

INTERO1ERABI'IT;:

INTRODUCTION ) database management system &"(.*' is a set of programs that enables the creation and maintenance of a collection of related data. ) "(.* and associated programs access, manipulate, The fundamental purpose of a "(.* is to provide a protect, and manage the data. reliable, persistent data storage facility and the mechanisms for efficient, convenient data access and retrieval. ) database is supposed to represent a real-world situation as completely and accurately as possible. The data model incorporated into a database system defines a framework of concepts that can be used to express an application.

$ersistence refers to the ability of some objects to outlive

the programs that created them. 9bject lifetimes can be short, as for local objects &these objects are transient', or long, as for objects stored indefinitely in a database &these objects are persistent'.
%2

.ost

object-oriented

languages

do

not

support

seriali$ation or object persistence, which is the process of writing or reading an object to and from a persistent storage medium, such as a disk file. !ven though a reliable, persistent storage facility is the

most important aspect of a database, there are many other aspects as well. 7ersistent object stores do not support +uery or interactive user interface facilities, as found in fully supported object-oriented database management systems.

:urthermore, controlling concurrent access by users,

providing ad-hoc +uery capability, and allowing independent control over the physical location of data are examples of features that differentiate a full database from simply a persistent store.
OBJECT STORE AND 1ERSISTENCE: AN OVERVIE<

) program will create a large amount of data throughout its execution. !ach item of data will have a different lifetime. )tkinson et al. I j describe six broad categories for the lifetime of data%. Transient results to the evaluation of expressions. ,. Jariables involved in procedure activation &parameters and variables

%3

5ith a locali$ed scope'. 0. Ilobal variables and variables that are dynamically allocated. 1. "ata that exist between the executions of a program. 2. "ata that exist between the versions of a program. 3. "ata that outlive a program. OBJECT-ORIENTED S;STEMS: "atabase management systems have progressed from indexed files to network and hierarchical database systems to relational systems. The re+uirements of traditional business data processing applications are well met in functionality and performance by relational database systems focused on the needs of business data processing applications. 4owever, as many researchers observed, they are inade+uate for a broader class of applications with unconventional and complex data type re+uirements. These re+uirements along with the popularity of objectoriented programming have resulted in great demand for an object-oriented "(.* &99"(.*'. Therefore, the interest in 99"(.* initially stemmed from DATABASE MANAGEMENT

%=

the

data

storage

re+uirements

of

design

support

applications &e.g., /)", /)*!, office information systems'. The ob(ect"oriented database management system is a marriage of object oriented programming and database technology to provide what we now call object-oriented databases.

The object-oriented database management system is a marriage of object-oriented programming and database technology. /ategories can be broadly divided into ob(ect"oriented language properties and database re+uirements. :irst, the rules that make it an object-oriented system are as follows%. The system must support complex objects. ) system must provide simple atomic types o ob(ects &integers, characters, etc.' from which complex objects can be built by applying constructors to atomic objects or other complex objects or

%?

both. ,. Object identity must be supported. ) data object must have an identity and existence independent of its values. 0. Objects must be encapsulated. )n object must encapsulate both a program and its data. !ncapsulation embodies the separation of interface and implementation and the need for modularity. 1. The system must support types or classes. The system must support either the type concept &embodied by /<<' or the class concept &embodied by *malltalk'. 2. The system must support inheritance. /lasses and types can participate in a class hierarchy. The primary advantage of inheritance is that it factors out shared code and interfaces. 3. The system must avoid premature binding. This feature also is known as late binding or dynamic binding. *ince classes and types support encapsulation and inheritance, the system must resolve conflicts in operation names at run time. =. The system must be computationally complete. )ny computable function should be expressible in the data manipulation language &".8' of the system, thereby allowing expression of any type of operation.

%F

?. The system must be extensible. The user of the system should be able to create new types that have e+ual status to the systems predefined types. F. It must be persistent, able to remember an object state. The system must allow the programmer to have data survive beyond the execution of the creating process for it to be reused in another process. %C. It must be able to manage very large databases. The system must efficiently manage access to the secondary storage and provide performance features, such as indexing, clustering, buffering, and +uery optimi$ation. %%. It must accept concurrent users. The system must allow multiple concurrent users and support the notions of atomic, seriali$able transactions. %,. It must be able to recover from hardware and software failures. The system must be able to recover from software and hardware failures and return to a coherent state. %0. ata !uery must be simple. The system must provide some high-level mechanism for ad-hoc browsing of the contents of the database. ) graphical browser might fulfill this re+uirement sufficiently. These database re+uirements are met by the majority of existing database systems. :rom these two sets of definitions it can
,C

be argued that an 99"(.* is a "(.* with an underlying objectoriented model. O,=ec$-O#ien$ed Da$a,a(e( 7e#()( $#adi$ional Da$a,a(e( The scope of the responsibility of an 99"(.* includes definition of the object structures, object manipulation, and recovery, which is the ability to maintain data integrity regardless of system, network, or media failure. :urthermore, 99"(.*s like "(.*s must allow for sharing# secure, concurrent multiuser access# and efficient, reliable system performance. 9ne obvious difference between the traditional and objectoriented databases ii derived from the objects ability to interact with other objects and with itself. The objects are an KactiveL component in an object-oriented database, in contrast to conventional database systems, where records play a passive role. Get another distinguishing feature of object-oriented database is inheritance. >elational database systems do not explicitly provide inheritance of attributes and methods. 9bject-oriented databases, on the other hand, represent relationships explicitly, supporting both navigational and associative access to information. )s the complexity of interrelationships between information within the database increases, so do the advantages of representing relationships explicitly.

,%

 )nother benefit of using explicit relationships is the improvement in data access performance over relational value-based relationships. 9bject-oriented databases also differ from the more traditional relational databases in that they allow representation and storage of data in the form of objects. !ach object has its own identity, or object-I &as opposed to the purely value-oriented approach of traditional databases'. The object identity is independent of the state of the object. :or example, if one has a car object and we remodel the car and change its appearance, the engine, the transmission, and the tires so that it looks entirely different, it would still be recogni$ed as the same object we had originally. 5ithin an object-oriented database, one always can ask whether this is the same object I had previously, assuming one remembers the objects identity. 9bject identity allows objects to be related as well as shared within a distributed computing network. )ll these advantages point to the application of objectoriented databases to information management problems that are characteri$ed by the need to manage

) large number of different data types. ) large number of relationships between the objects. 9bjects with complex behaviors.

,,

)pplication areas where this kind of complexity exists include engineering, manufacturing, simulations, office automation, and large information systems &K o .ore :ishing for "ataL is a realworld example of this'.

O,=ec$-Rela$ion Mapping ) tuple &row' of a table contains data for a single entity that correlates to an object &instance of a class' in an objectoriented system. In addition, a stored procedure in a relational database may correlate to a method in an objectoriented architecture. ) stored procedure is a module of precompiled *M8 code maintained within the database that executes on the server to enforce rules the business has set about the data. :or a tool to be able to define how relational data maps to and from application objects, it must have at least the following mapping capabilities &note all these are two-way mappings, meaning they map from the relational system to the object and from the object back to the relational system'-

Table-class mapping. Table-multiple classes mapping. Table-inherited classes mapping.

,0

 Tables-inherited classes mapping.

&IGURE Table-class mapping. !ach row in the table represents an object instance and each column in the table corresponds to an object attribute. %e erential integrity means making sure that a dependent tables foreign key contains a value that refers to an existing valid tuple in another relation. Ta,le-Cla(( Mapping Table-class mapping is a simple one-to-one mapping of a table to a class and the mapping of columns in a table to properties in a class. In such mapping, it is common to map all the columns to properties. Ta,le-M)l$iple Cla((e( Mapping In the table-multiple classes mapping, a single table maps to multiple non-inheriting classes. Two or more distinct, non-inheriting classes have properties that are mapped to columns in a single table. )t run time, a mapped
,1

table row is accessed as an instance of one of the classes, based on a column value in the table. Ta,le-Inhe#i$ed Cla((e( Mapping In table-inherited classes mapping, a single table maps to many classes that have a common super class. This mapping allows the user to specify the columns to be shared among the related classes. The super class may be either abstract or instantiated. Table-multiple classes mapping. The custI" column provides the discriminant. If the value for custI" is null, an !mployee instance is created at run time# otherwise, a /ustomer instance is created. Ta,le(-Inhe#i$ed Cla((e( Mapping )nother approach here is tables-inherited classes mapping, which allows the translation of is-a relationships that exist among tables in the relational schema into class inheritance relationships in the object model. 1e#(on Ta,le

name address ss n

wage salary

,2

&IGURE Table-inherited classes mapping. Instances of *alaried!mployee can be created for any row in the 7erson table that has a non null value for the salary column. It salary is null, the row is represented by an 4ourly!mployee instance.

,3

name

addres s

ss n

wage

salar y

&IGURE Table-inherited classes mapping. Instances of *alaried !mployee can be created for any row in the 7erson table that has a non null value for the salary column. It salary is null# the row is represented by an 4ourly !mployee instance.

>E; TERMS

)tomicity /9>() 9/8 :oreign key Tuples !ncapsulation 8eakage .eta data

/%

9/8 *tands for NNNNNNNNNNNNNNNNNNN.

0%

NNNNNNNNNNNNNNNoccurs when details about a class internal implementation are disclosed through the interface.

2%

"ata about the data is called NNNNNNNNNNNNN

3%

The ability of transaction ensures NNNNNNNNNNNNNNNof change that maintain the database in a consistent state .

4%

NNNNNNNNNNNNis a standard proposed as a means to integrate distributed , heterogeneous business applications and data .

5%

IT is a primary key of one table that is embedded in another table to link the tables is NNNNNNNNNNNN.

Te t !our Under tandin"

%. It is a fundamental truth always is observed to be valid a. Theorem b. /orollary c. )xiom d. one

,.

) NNNNNNNNNNNNNNis a proposition that may not be self evident but

can be proven from accepted axioms. a.)xiom b. Theorem /. /orollary d. one

0.

5hich axiom maintains the independence of componentsO a. Independence b. Information c. /orollary d. one

1.

5hich axiom minimi$e the information content of the designO a.*ingle axiom b. Independence c. Information d. /orollary

2.

NNNNNNNis a measure of strength of association established by a connection from one object to another. a./ohesion b. /oupling c. Inheritance d. one

3.

It deals with interactions between objects or software components a. /oupling b. cohesive c. /ontrol coupling d. "ata coupling

=.

The connection involves direct reference to attributes or methods of another object. a./ommon coupling b. /ontent coupling c. *tamp coupling

d. /ontrol coupling

?.

NNNNNN are devices that allow systems to share knowledge about their design a.7attern template b. 7attern c. "esign patterns d. one

F.

9/8 *tands for a.9bject constraint language b. 9bject control language c. 9bject class 8anguage d. one

%C. NNNNN is a combination of one or more attributes whose value unambiguously locates each row in the table a.:oreign key b. 7rimary key c. Tuples d. one

?)e($ion Ban@ 90 MAR>S: %. "efine 9bject storage ,. 8ist the object oriented design axioms and corollaries 0. 5hat are 9perational attributesO 1. 5hat is forwardingO 2. "efine *calability. 3. 5hat is a 7roxy patternO =. "efine 9"8. ?. "efine 99"(.*. F. 5hat is object storeO %C. 5hat is the use of an abstract classO Iive an example.

%%. 5hat is meant by axiomO 8ist the two design axioms of object oriented design %,. 5hat are the main activities in design processO %0. 5hat are the two types of couplingO %1. 5hat do you mean by cohesionO Iive the types of cohesion. %2. "ifferentiate coupling and cohesionO %3. 5hat do you mean by design patternsO %=. 5hat do you mean by expressionsO Iive the syntax for some common expressions. %?. 5hat are private, public and protected protocolsO %F. 5hat is encapsulation leakageO ,C. 5hat are the three basic types of attributesO

?)e($ion Ban@ 9/5 MAR>S:

%. !xplain the access layer and object interoperability. ,. (riefly explain how design axioms help to avoid design pitfalls. 0. !xplain the principles and metrics of good object oriented design. 1. "escribe in detail about 9bject oriented database management systemsO 2. *tate the differences between 99"(.* and traditional database. "escribe object-relational systemsO 3. !xplain the steps involved in designing the view layer classesO =. "escribe the purpose of view layer interfaceO

Re"e#ence Boo@9(::

%. (ooch I.,L9bject 9riented )nalysis )nd "esignL,)ddison- 5esley 7ublishing /ompany,%FF1. ,. >ambaugh ;, (laha... 7remeriani, 5., !ddy : and 8oresen 5., K9bject 9riented .odeling and "esignL, 74I, %FF=.