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

Shared lock or read lock, Shared lock or Read Lock It is requested ...

Shared lock or Read Lock It is requested by a transaction that needs to just read the value of data item. A shared lock on a data item does not permit an exclusive lock

List the string operations supported by sql, List the string operations sup...

List the string operations supported by SQL? 1) Pattern matching Operation 2) Concatenation 3) Extracting character strings 4) Converting among uppercase and lower cas

What is conceptual schema, What is conceptual schema? The schemas at th...

What is conceptual schema? The schemas at the view level are known as subschema that describe dissimilar views of the database.

ER diagrams, explain exhaustively the problems associated with ER diagrams....

explain exhaustively the problems associated with ER diagrams. include illustrations in your answer

Lossless-join decomposition, Lossless-Join Decomposition   Let us sh...

Lossless-Join Decomposition   Let us show an intuitive decomposition of a relation. We require a better basis for deciding decompositions since intuition may not always be r

Eer diagram, Design an EER schema for the following application and transla...

Design an EER schema for the following application and translate the EER schema into relational schemas (and constraints). It is possible that some requirements cannot be captured

What is identity, What is Identity? Identity (or AutoNumber) is a colum...

What is Identity? Identity (or AutoNumber) is a column that automatically produces numeric values. A start and increment value can be set, but most DBA leave these at 1. A GUID

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

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