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

Create a table to record a passengers information, Given the following rela...

Given the following relations TRAIN (NAME, START, DEST) TICKET (PNRNO., START, DEST, FARE) PASSENGER (NAME, ADDRESS, PNRNO.) Write SQL expressions for the following queries: No

Fire department, The State of Newyork certifies firefighters throughout sta...

The State of Newyork certifies firefighters throughout state keep track all of them, as well as the state’s of fire departments. Each fire department has unique department number

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

Explain the concepts of relational data model, Explain the concepts of rela...

Explain the concepts of relational data model? Relational Data Model - The relational model was first introduced through Prof. E.F. Codd of the IBM Research in the year 1970

BCA, Ask qu. Write a XML with database with book details (Book ID, Title, A...

Ask qu. Write a XML with database with book details (Book ID, Title, Author, subject, published year, language, vendor, and price).estion #Minimum 100 words accepted#

What is class diagram, Class Diagram A class diagram is required to su...

Class Diagram A class diagram is required to support functional necessity of system. In a static design view, class diagram is used to model vocabulary of the system, simple c

Why containment is important in oosystems, Why containment is important in ...

Why containment is important in oosystems? Containment is an significant concept in oosystems because it allows dissimilar users to view data at different granularities.

Define query optimization, Define query optimization. Query optimizatio...

Define query optimization. Query optimization refers to the process of search the lowest -cost method of evaluating a given query.

Data warehouse, #queDefine a job scheduling strategy that will meet busines...

#queDefine a job scheduling strategy that will meet business requirement of reporting availability by 6am CST for the following cubes? Show the job scheduling dependencies in a pic

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