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

Explain the static or conservative two phase locking, Explain the Static or...

Explain the Static or conservative Two Phase Locking: Static (or conservative) Two Phase Locking: In this type of scheme, all the data items are locked earlier than any opera

Physical records, Physical Records These are the records that are store...

Physical Records These are the records that are stored in the secondary storage devices. For the database relation, physical records are the group of fields kept in adjacent me

Explain a data dictionary, What is a data dictionary? Data Dictionary ...

What is a data dictionary? Data Dictionary is a main source of data in a data management system.  Its major function is to carry the creation and management of data definition

What is called remapping of bad sectors, What is called remapping of bad se...

What is called remapping of bad sectors? If the controller detects that a sector is injured when the disk is initially formatted, or when an attempt is made to write the secto

Explain the ansi -sparc schema architecture, (a) Differentiate between info...

(a) Differentiate between information and data . (b) List and briefly explain five potential benefits of the database approach compared to conventional file systems. (c) Diff

Describe the static hash file with buckets and chaining, Describe the stati...

Describe the static hash file with buckets and chaining and show how insertion, deletion and modification of a record can be performed. In static hash file organization, the wo

The users who use easy-to-use menu are called, The users who use easy-to-us...

The users who use easy-to-use menu are called ? The users who use easy to use menu are called as Naïve users.

State the objectives of object design, Determine the OBJECTIVES of  object ...

Determine the OBJECTIVES of  object design After passing through this unit, you should be able to: describe and apply concept of generalisation; understand and appl

Normalization-e-r mapping , Normalize the following table upto and includin...

Normalize the following table upto and including the 3NF. Submit a 1 page printout of only the final set of normalized tables in Data Architect. Just use Data Architect to do the t

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