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

Design an entity relation model, Funky Festivals Specification Funky Fe...

Funky Festivals Specification Funky Festivals organise music festivals which take place at various venues throughout the UK.  A venue needs to be booked before a Festival can t

Please answer me., gyan gurukul is a software company that provides softwar...

gyan gurukul is a software company that provides software related solution.

Write short notes on tuple relational calculus, Write short notes on tuple ...

Write short notes on tuple relational calculus. The tuple relational calculation is anon procedural query language. It defines the desired information without giving a particul

Data flow diagram of structured analysis and design, From SAD to OOAD (Stru...

From SAD to OOAD (Structured Analysis and Design (SAD) to Object Oriented Analysis and Design (OOAD). We will find here how we can map various models in SAD to different model

Describe database state in details, Describe Database state in details? ...

Describe Database state in details? Database state: The actual data within the database at a particular moment in time is known as a database state.

Database Management System, Assume that you are responsible for selecting a...

Assume that you are responsible for selecting a new DBMS product for Sohar Hospital

What is a query tree, What is a query tree?     Ans:  A query tree, as ...

What is a query tree?     Ans:  A query tree, as well known as operator graph, is a tree data structure that corresponds to a relational algebra expression. It denotes the inpu

Backward recovery (undo), Backward Recovery (UNDO): In this system the unco...

Backward Recovery (UNDO): In this system the uncommitted changes made by a transaction to a database are undone.  Instead the system is reset to the last consistent state of databa

What are the general transformation rules, What are the General Transformat...

What are the General Transformation Rules for Relational operations?  Ans: The transformation rules transform one relational algebra expression to AN EQUIVALENT ONE  1. E

Explain deadlock detection and recovery, Explain Deadlock detection and rec...

Explain Deadlock detection and recovery Deadlock Detection - A deadlock is said to take place when there is a circular chain of transaction, every waiting for the release of 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