How to rearrange classes and operations, Database Management System

Assignment Help:

Rearrange Classes and Operations

Sometimes, the similar operation is defined across different classes and can easily be inherited from a familiar ancestor, but more often operations in several classes are similar, but not the same. By slightly altering the definitions of operations or classes, the operations could often be made to match so that they could be covered by a single inherited operation. The following types of adjustments can be made to increase chance of inheritance:

  • We will find that some operations can have fewer arguments than others. The missing arguments can be added but normally ignored. Such as, a draw operation on a monochromatic display does not require a colour parameter, but parameter can be accepted and ignored for uniformity with colour displays.
  • Some operations can have fewer arguments since they are special cases of more common arguments. In this case, you can implement special operations by calling general operation with appropriate parameter values. Such as, appending an element to list is a special case of inserting an element; here the insert point just follows the last element.
  • Same attributes in different classes can have different names. Give attributes the same name and move them to a common ancestor class, then operations that access attributes will match better. Also, watch for same operations with different names. You should note that a reliable naming strategy is significant to avoid hiding similarities.
  • An operation can be defined on many different classes in a group, but be undefined on other classes. Define it on a common ancestor class and declare it as a no-op on classes which do not care about it. For instance, in OMTool the begin-edit operation places some figures, for example class boxes, in a special draw mode to authorize rapid resizing while the text in them is being edited. Other figures do not have special draw mode, so begin-edit operation on these classes has no effect.

 


Related Discussions:- How to rearrange classes and operations

Update operations in dbms - insert operation, Update Operations and Dealing...

Update Operations and Dealing with Constraint Violations There are three basic operations to be executes on relations: Insertion Deletion Update The INSER

Wait-die scheme -deadlock prevention, Wait-die" scheme : The idea is based ...

Wait-die" scheme : The idea is based on non-preventive method. It is based on a simple rule:                                 If Ti requests a database resource that is held by T

Example of equijoin, Example: Consider the following relations: ...

Example: Consider the following relations: ROLLNO NAME ADDRESS COURSE_ID 100 Ka

Money making supermarket chain problem, Consider the ER schema below for th...

Consider the ER schema below for the MoneyMaking supermarket chain problem. Translate the given ER schema into SQL CREATE TABLE statement.

Task partitioning, Task Partitioning, Sequencing and Project Planning T...

Task Partitioning, Sequencing and Project Planning The tasks required for the service might be broadly partitioned into: 0.      Set up database tables and account file

Lack of standards and experience, Lack of standards and experience: The la...

Lack of standards and experience: The lack of standards has considerably limited the potential of distributed DBMSs. As well, there are no tools or methodologies to help users cha

Functional dependency in entities, FDs in Entities : Student entity : ...

FDs in Entities : Student entity :                                                Enrolment number →  Student name, Address Course Entity :

Text mining, Text Processing: Use readLines to read SOU.txt into R. Cr...

Text Processing: Use readLines to read SOU.txt into R. Create a vector called Pres containing the names of the presidents giving each speech. To do this, rst identify the lin

Relation instance or relation state, A relation instance indicates as r is ...

A relation instance indicates as r is a collection of tuples for a given relational schema at a exact point of time. A relation state r of the relation schema R (A 1 ,A 2 ,.....

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd