Explain the paths in the association network, Database Management System

Assignment Help:

Explain the paths in the association network

We can analyze use of paths in the association network as given below:

  • Calculate each operation
  • Find associations which it must pass through to get information. Associations could be bi-directional (generally by more than one operation) or unidirectional which can be implemented as pointers.

  For each and every operation, we must know the followings:

  • How frequently is operation needed and how much will it cost?
  • What is fan-out along a path through network? To find fan-out of complete path, multiply average count of each "many" associations found in path with individual fan-outs.
  • What are the objects which satisfy selection criteria (if specified) and are operated on? When most of objects are rejected during traversal for some reason, then a simple nested loop can be inefficient at finding target objects.

 


Related Discussions:- Explain the paths in the association network

A file manipulation command that extracts some records, A file manipulation...

A file manipulation command that extracts some of the records from a file is called ? A file manipulation command that extracts some of the records from a file is called SELECT

Explain i command in qbe, Explain I command in QBE ? I : It is the co...

Explain I command in QBE ? I : It is the command in QBE that is used to insert tuple (s) into the database

What are advantages of object-oriented programming paradigm, What is the ma...

What is the major advantage of object-oriented programming paradigm? The ability to modify the explanation of an object without affecting the rest of the system is the main adv

Designing the hierarchy of a ldb?, What sorts of tables one can se in desig...

What sorts of tables one can se in designing the hierarchy of a LDB? Tables, which are having Foreign Key relations.

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

Why is database redesign necessary, Why is database redesign necessary? ...

Why is database redesign necessary? Database redesign is essential for two reasons. First, redesign is essential both to fix mistakes made during the initial database design. S

What is waterfall model, Waterfall model is the linear model. The process i...

Waterfall model is the linear model. The process is completed by step by step. We couldn't stop in between of the process. Prototype model: after get the model by low cost budget o

What is a super key, What is a super key? A super key is a set of one o...

What is a super key? A super key is a set of one or more attributes that collectively permits us to recognize uniquely an entity in the entity set.

What is the state machine engine, What is the State Machine Engine The...

What is the State Machine Engine The straightest approach to implement control is to have any way of explicitly representing and executing state machines. With the help of thi

Define shadow paging, Define shadow paging. An alternative to log-based...

Define shadow paging. An alternative to log-based crash recovery method is shadow paging. This technique requires fewer disk accesses than do the log-based methods.

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