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

How the one-to-one associations have to be implemented, Discuss how the one...

Discuss how the one-to-one associations have to be implemented. Some of properties of associations can be implemented directly by providing suitable declarations of the data me

Explain object oriented model, Explain Object oriented Model ? Object ...

Explain Object oriented Model ? Object Oriented Model - This model is based on the object-oriented programming language paradigm. It involves the features of OOP such as inhe

Query evolution, what is query processing ,query optimization and performan...

what is query processing ,query optimization and performance turring?

Referential integrity, It can be easily defined as: The database must no...

It can be easily defined as: The database must not have any unmatched foreign key values. The term "unmatched foreign key value" means a foreign key value for which there doe

Normalization assigment, what would go in order patient#, patient name, pat...

what would go in order patient#, patient name, patien address, surgeon#, surgeon name, surgery date, surgery type, drug admin

#cursor, #what is cursor its uses ? Explain it

#what is cursor its uses ? Explain it

Assignment, Research Value: 7% Due Date: 17-Sep-2018 Return Date: 11-Oct-2...

Research Value: 7% Due Date: 17-Sep-2018 Return Date: 11-Oct-2018 Length: 700 words Submission method options: Alternative submission method Task back to top You are required to

Fragmentation, let us consider a table having 2200 records and the fixed si...

let us consider a table having 2200 records and the fixed size of the table to be considered as 25.then how many numbers of table is requredto perform horizontal fragmentation

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