Adding redundant associations for efficient access, Database Management System

Assignment Help:

Adding Redundant Associations for Efficient Access

Redundant associations do not add any type of information, therefore during design we should actually examine structure of object model for implementation and try to establish whether we could optimize critical parts of completed system. New associations can be added? Or old associations can be removed? The derived association does not require adding any information to the network, they help increasing model information in efficient mode.

 


Related Discussions:- Adding redundant associations for efficient access

Sequential file organisation, Sequential File Organisation The most nec...

Sequential File Organisation The most necessary way to organise the collection of records in a file is to use sequential Organisation. Records of the file are stored in series

Define instance and schema, Define instance and schema?  Instance:  C...

Define instance and schema?  Instance:  Collection of  data  kept in the  data  base  at  a  particular  moment  is  known as an Instance of the database.  Schema: The o

Define the schema at the intermediate level of abstraction, Define Accordin...

Define According to the levels of abstraction, the schema at the intermediate level is called  Ans: As per to the levels of abstraction, the schema at the intermediate level is

Relational database management, For this application, we will consider IBM ...

For this application, we will consider IBM DB2 catalog data (i.e., metadata) for IBM's enterprise-class servers running the z/OS (formerly OS/390 or MVS) operating system.  One of

Concept of foreign key, Fundamentals of Database Management 1. Explai...

Fundamentals of Database Management 1. Explain the concept of Foreign Key. How a foreign key differs from a Primary Key? Can the Foreign Key accept nulls? 2. With a necess

What is candidate key, What is candidate key? Candidate Key - A candi...

What is candidate key? Candidate Key - A candidate key of an entity set is a minimal superkey, which uniquely identifies each row in the relation.

Data models, why older data models are being replaced by new data models....

why older data models are being replaced by new data models.

Explain the concept of a data model, Explain the concept of a data model ? ...

Explain the concept of a data model ? Data Model - Model is an abstraction procedure which hides irrelevant details although highlighting details relevant to the application

Describe the two alternatives for specifying structural, Describe the two a...

Describe the two alternatives for specifying structural constraints on relationship kinds? Relationship kinds have certain constraints in which limit the possible combination o

Vertical fragmentation, Vertical Fragmentation- Vertical fragmentation grou...

Vertical Fragmentation- Vertical fragmentation groups together only those attributes in a relation that are used jointly by various important transactions. A vertical fragment is d

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