Name the metrics for selecting top algorithm, Database Management System

Assignment Help:

Name the metrics for selecting top algorithm

There are a number of metrics for selecting top algorithm:

i) Computational complexity: Computational complexity refers to efficiency. The processor time increases as a function of size of data structure. But small factors of inefficiency are unimportant if they improve clarity.

ii) Ease of use: a simple algorithm, which is easy to use and understand, could be used for less important operations.

iii)  Flexibility: The fully optimized algorithm is normally less readable and very hard to implement. The solution for this is to provide two implementations of the crucial operations: 

  • A complicated but very proficient algorithm.
  • A simple but unproductive algorithm.

 


Related Discussions:- Name the metrics for selecting top algorithm

Replicating data, Replicating Data One approach that may support effici...

Replicating Data One approach that may support efficient access to dissimilar applications as above may be to give access to every of the applications from dissimilar replicate

What is the use of union and intersection operation, What is the use of Uni...

What is the use of Union and intersection operation? Union: The result of this operation contains all tuples that are either in r1 or in r2 or in both r1 and r2.Duplicate tuple

Create an er diagram completely with attributes, A database is to be constr...

A database is to be constructed to remain track of the teams and games of a sport league. A team has a number of players, not all of whom participate in every game. It is desired

Describe the algorithm for updating indices, Describe the algorithm for upd...

Describe the algorithm for updating indices for a single level index when a record is    (i) Inserted  (ii)  deleted What will be the modification if there are multilevel in

What are the disadvantages of relational data, What are the disadvantages o...

What are the disadvantages of relational data ? Disadvantages • Performance - If the number of tables among that relationships to be established are large and the tables t

#, How to use Oracle

How to use Oracle

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.

What are the time stamps associated with each data item, What are the time ...

What are the time stamps associated with each data item? W-timestamp (Q) denotes the largest time stamp if any transaction that implemented WRITE (Q) successfully. R-timesta

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.

Relation and relational schema, A relation has: Relational Schema ...

A relation has: Relational Schema Relation instance Relational Schema: A relational schema shows the relation's name, its attributes and the domain of every a

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