How to rearrange the execution order for efficiency, Database Management System

Assignment Help:

Rearrange the Execution Order for Efficiency 

Rearranging execution order for efficiency means executing such job that requires less execution time. By rearranging the object in ascending order of their execution time, we can raise the efficiency of the system. 

After adjusting structure of the object model to optimize frequent traversals, next thing to optimize is an algorithm itself. Actually, "algorithms and data structure are directly related to each other", but we find that usually data structure should be considered first.

The way to optimize algorithm is "to remove dead paths as early as possible".

For illustration, suppose we want to find all employees who speak both Japanese and French, and presume 5 employees speak Japanese and 100 speak French. In such case, it is better to test and find Japanese speakers first, then test if they can speak French. In general, it pays to narrow search as soon as possible. Sometimes execution order of a loop must be inverted from the unusual specification in the functional model to get competent results.

 


Related Discussions:- How to rearrange the execution order for efficiency

Describe difference between a one-to-many and a many-to-many, Describe the ...

Describe the difference between a one-to-many and a many-to-many relationship. Which logical data structures comprise one-to-many and which comprise many-to-many relationship?

Differences among the candidate keys and the primary key, Discuss the diffe...

Discuss the differences among the candidate keys and the primary key of a relation. Give instance to describe your answer? A candidate key is one that can be used as primary ke

What are the uses of functional dependencies, What are the uses of function...

What are the uses of functional dependencies? To test relations to see whether they are legal under a given set of functional dependencies. To state constraints on the set

Fragmentation-design of distributed databases, Fragmentation: It is defini...

Fragmentation: It is definite as partitioning of a relation into various fragments.Every fragment can be stored at a dissimilar site.

Construct substantial data model, PART MARKING:  We will only mark TWO of t...

PART MARKING:  We will only mark TWO of the four questions below but you must submit answers to all four. We will choose the questions we mark randomly and we will supply you with

What are called jukebox systems, What are called jukebox systems? Jukeb...

What are called jukebox systems? Jukebox systems have a few drives and numerous disks that can be loaded into single of the drives automatically.

In e-r diagram how relationship type is represented, In E-R Diagram how rel...

In E-R Diagram how relationship type is represented ? In E-R Diagram relationship type is represented as a Diamond.

Relational schema for person, Example: RELATIONAL SCHEMA for PERSON: ...

Example: RELATIONAL SCHEMA for PERSON: PERSON (PERSON_ID: integer, NAME: string, AGE: integer, ADDRESS: String) RELATION INSTANCE In this instance, m = 3 and n = 4

What is a name, What is a Name? A user-supplied name is used for identi...

What is a Name? A user-supplied name is used for identity. This form of identity is used for files in file systems. The user gives every file a name that uniquely identifies it

Durability-transaction , Durability : This property necessitates that once ...

Durability : This property necessitates that once a transaction has committed, the changes made by it be never lost because of subsequent failure. Thus, a transaction is also a bas

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