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

Explain nonclustered indexes, What is the difference between SQL Server 200...

What is the difference between SQL Server 2000 clustered and nonclustered indexes? With a clustered index, the data are kept in the bottom level of the index and in the similar

Advantages of data distribution, Advantages of Data Distribution The pr...

Advantages of Data Distribution The primary benefit of distributed database systems is the ability to access and share data in a reliable and efficient manner.

What are metrics for choosing the best algorithm, What are metrics for choo...

What are metrics for choosing the best algorithm? Matrices for choosing the best algorithms are as below: Computational complexity Ease of understand ability and im

What is the use of group by clause, What is the use of group by clause? ...

What is the use of group by clause? Group by clause is used to be relevant aggregate functions to a set of tuples. The attributes given in the group by clause are used to shape

Distinguish among a datareader class and a dataset class, Question (a) ...

Question (a) Concurrent access to data from a database is a normal part of application program usage. Describe three approaches to concurrency control (b) Distinguish among

Describe specialsation and generalization, Describe Specialsation and gener...

Describe Specialsation and generalization? Specialisation /generalization: This is a top down and bottom up approach to the design of database. It displays the IS_A relation

Insert - referential integrity, The insertion of a tuple in the aim of refe...

The insertion of a tuple in the aim of reference does not cause any destruction. Though, insertion of a tuple in the relation in which, we has the foreign key, for instance, in ASS

Explain transaction manager and their work, Explain Transaction manager and...

Explain Transaction manager and their work? Transaction Manager: Ensure the database remains in a constant (correct) state despite system failure, and in which concurrent trans

Define rotational latency time, Define rotational latency time. The ti...

Define rotational latency time. The time spent waiting for the sector to be accessed to appear under the head is known as the rotational latency time.

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