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

Find out the names of all employees from database, Find out the names of al...

Find out the names of all employees who work for first Bank Corporation from database. SELECT EMPLOYEE_NAME FROM WORKS WHERE COMPANYNAME = ‘First Bank Corporation';

Replication-design of distributed databases, Replication : It is definite a...

Replication : It is definite as a copy of a relation. Every replica is stored at a dissimilar site. The alternative to replication is to store only single copy of a relation which

RDM & ER Modelling, #questiRegional Gardens has many nurseries, including W...

#questiRegional Gardens has many nurseries, including Wagga Wagga, Bathurst, Albury, Orange, and Dubbo. Each nursery is known by its campus code, eg WW, B, A, O and D respectively.

Data warehousing and business intelligence, I need help with data warehousi...

I need help with data warehousing and business intelligence course project about designing a data warehouse for a jewelry company that does not have one

What is a phantom deadlock, What is a Phantom Deadlock? In distributed...

What is a Phantom Deadlock? In distributed deadlock detection, the delay in propagating local information might cause the deadlock detection algorithms to recognize deadlocks

What is relational algebra, What is Relational Algebra? Relational algebr...

What is Relational Algebra? Relational algebra is a Procedural query Language?

Distributed transaction atomic-consistent-isolated, A distributed transacti...

A distributed transaction consists of subtransactions that execute at different sites and access local DBMSs at those sites. For example, a distributed transaction that transfers m

Weak entity, An example of a weak entity is Staff because the availabilityI...

An example of a weak entity is Staff because the availabilityID cannot be uniquely identified unless it is used in conjunction with the foreign key known as availabilityID in the A

Answer, Describe multi key files

Describe multi key files

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