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

What is hashing file organization, What is hashing file organization? ...

What is hashing file organization? In the hashing file organization, a hash function is computed on some attribute of every record. The result of the hash function specify in

Define radix conversion method, Define Radix conversion method  One cle...

Define Radix conversion method  One clever way to transform binary numbers to BCD notation (binary-coded decimal) is the "double dabble algorithm". It can be adapted to transfo

Process of implementing system design in dynamic models, Process of impleme...

Process of implementing system design in dynamic models There are three essential approaches to implementing system design in dynamic models. These approaches are as below:

Which method of access uses key transformation, Which method of access uses...

Which method of access uses key transformation? A Hash method of access uses key transformation.

Illustrate the diagram - association as a cache, Association as a cache ...

Association as a cache This association must be updated when any new element is added to it, but testing for overlap using association is more efficient.    Figure:

Enforce referential integrity, Use Access 2007 to create a database calle...

Use Access 2007 to create a database called UniLib.mdb. - this file should be created on your personal drive at the university (or C: if you're using Access 2007 at home) and t

MULTI-LIST FILE ORGANIZATION, sir, could anybody help me in getting complet...

sir, could anybody help me in getting complete information about the mentioned topic

What is an index as defined in oracle, Normal 0 false false ...

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Define 3nf normal form, 3NF Normal Form A relation schema R is in 3NF ...

3NF Normal Form A relation schema R is in 3NF if it is in 2NF and for each FD X A either of the following is true X is a Super-key of R. A is a prime attribute of R

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