Method of analyzing association traversal, Database Management System

Assignment Help:

Analyzing Association Traversal

Till now, we have supposed that associations are bi-directional. But in the case of traversal, it is in only one direction in any application, implementation becomes easier.

Though, for finding unidirectional associations we require to be extra cautious, as any new operation added later can be required to traverse association in the opposite direction also. The bi-directional association makes expansion or modification easier.

To change our decision of implementation strategy with least effort, we should hide implementation, using access operations to traverse and update association.

 


Related Discussions:- Method of analyzing association traversal

Schema, difference between internal schema and external schema in DBMS

difference between internal schema and external schema in DBMS

Give an example of operations from the functions of a bank, Give an example...

Give an example of Operations from the functions of a bank. For creation of a saving account, you can write: bank::: create -savings-account (customer)->account. For oper

Differance between ddl and sdl, Differance between DDL and SDL? DDL and...

Differance between DDL and SDL? DDL and SDL - The data definition language (DDL) is used through DBA and database designers to describe internal schema, conceptual schema, and

Implementation of integrity rules, Question 1 Describe the following- ...

Question 1 Describe the following- Clustering Indexing Question 2 Explain the following with suitable real time examples- Implementation of Integrity rules

What is the difference between primary key and a unique key, What's the dif...

What's the difference between a primary key and a unique key? Both primary key and unique key enforces uniqueness of the column on which they are explained. But by default prim

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

Explain the term - control as concurrent tasks, Explain the term - Control ...

Explain the term - Control as Concurrent Tasks As we know, any object can be implemented as a task in programming language or operating system. This is the most general approa

Each statement should have a where clause, Submit SQL SELECT Statements to ...

Submit SQL SELECT Statements to demonstrate several reports off your database, according to the following guidelines: You must submit at least 5 SELECT Statements. Each

Why were functional methods fashionable in early days, Why were functional ...

Why were functional methods fashionable in early days? These are inspired directly by computer architecture and thus popular among computer scientist in early days. The divisio

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