How can we classify the operations on classes, Database Management System

Assignment Help:

How can we Classify the operations on classes 

This step fundamentally means all three models functional, object and dynamic (studied in last section) must be combined so that we can know what operations are to be performed on objects.

We can design a state diagram describing life history of an object. A transition is a change of the state of object and it maps into an operation on object. It helps in imagining state changes. We could associate an operation with every event received by an object. Also, sometimes an event might represent an operation on other objects too that is where one event triggers another event. Therefore, in this case, event pair must be mapped into an operation performing action and returning control provided which the events are on a single thread of control passing from one object to another object.

 


Related Discussions:- How can we classify the operations on classes

Compute natural join and outer join, For the relations R and S given below:...

For the relations R and S given below: R                      S A B C 1 4 7 2 5 8 3 6 9

Designing the fields in the data base, Designing the fields in the data bas...

Designing the fields in the data base The following are the considerations one has to remain in mind while designing the fields in the data base. Coding, compression, en

Explain the b+ tree, Explain the B + tree? B + tree is a type of tre...

Explain the B + tree? B + tree is a type of tree which denotes sorted data in a way that permits for efficient insertion, retrieval and removal of records, each of which is

What is a query tree, What is a query tree?     Ans:  A query tree, as ...

What is a query tree?     Ans:  A query tree, as well known as operator graph, is a tree data structure that corresponds to a relational algebra expression. It denotes the inpu

Define the basic operations of the relational algebra, Define the basic ope...

Define the basic operations of the relational algebra?     Ans: Basic operators of relational algebra are: 1. Union (∪) - Selects tuples which are in either P or Q or in bot

Define the query optimisation, Define the Query optimisation The query ...

Define the Query optimisation The query parser commonly generates a standard initial tree to correspond to an SQL query, with no doing any optimization. Such type of a canonica

Normalization, in case of functional dependencies how we get the higher nor...

in case of functional dependencies how we get the higher normal form.

RDBMS, DISADVANTAGES OF RDBMS

DISADVANTAGES OF RDBMS

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