Which sorting technique is used to sort databases, Database Management System

Assignment Help:

Which sorting technique is used to sort databases, whose sizes are very big?  Give one such algorithm.  Why do sorting techniques like quicksort, insertion sort, etc.  not applied on very big databases?    

 Ans:  To sort a large database or file, the sort-merge (or k-way merge) algorithm is extensively used. This is one of the external sorting algorithms. External sorting algorithm considers to sorting algorithms that are appropriate for large file of records stored on disk that do not fit completely in main memory, like most database files. The sort-merge algorithm begins by sorting small subfiles --called runs - of the main file and then merges the sorted runs, making larger sorted subfiles which are merged in turn. Such as other database algorithms, it needs buffer space in main memory, in which the actual sorting and merging of the runs is performed. This algorithm contains two phases:

(1) the sorting phase, and

(2) the merging phase.

 The sorting methods like quick sort, insertion sort, etc. are not applied on large databases as these are internal sorting algorithms, which need buffer space in main memory. The space complexities of these algorithms are O (n) and require a large buffer space in major memory to sort the large database. Hence, internal sorting algorithms are not applied on large databases.


Related Discussions:- Which sorting technique is used to sort databases

What are the aggregate objects in the data dictionary, What are the aggrega...

What are the aggregate objects in the data dictionary? Views Match codes Lock objects.

Describe association design of an object, Describe association design of an...

Describe association design of an object by giving one suitable example of it. The Design of Associations Associations are "glue" of advanced object oriented analysis and

What is message switching, What is Message switching Message switching ...

What is Message switching Message switching transmits data units which can be arbitrarily long. Packet switching has a utmost packet size, if any message longer than that, it s

Explain hierarchical model, Explain Hierarchical Model ? Hierarchical ...

Explain Hierarchical Model ? Hierarchical Model - It was established to model several kinds of hierarchical organizations which exist in the real world. It uses tree structur

What are the overlapping elements, What are the Overlapping elements O...

What are the Overlapping elements Overlapping elements can be found by scanning all the elements in front of deleted element in priority list for the sheet and comparing them

Explain view in rdbms, Explain view in RDBMS? View - A view is a relati...

Explain view in RDBMS? View - A view is a relation (virtual rather than base) and could be used in query expressions, which is, queries can be written by using the view as a re

What is functional dependency, A Functional dependency is described by ...

A Functional dependency is described by X Y between two groups of attributes Y and X that are subsets of R specifies a constraint on the possible tuple that can make a relation

Logical operators-logical operators, Logical Operators Rules of Preced...

Logical Operators Rules of Precedence: Order evaluated Operator 1 All comparison operators 2

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