Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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.
Assignment #1 Data Management The questions on this exam are based on the Baxter Aviation case scenario. 1. (5 points) The systems analyst proposes the following two relationshi
Define Sequence A sequence is a set of integers 1, 2, 3 that are generated in order on demand. Sequences are regularly used in databases because lots of applications require ev
Consider the join of a relation R with relation S. If R has m tuples and S has n tuples, then the maximum size of join is: If R has m tuples and S has n tuples then maximum siz
What is data model? Explain object based and record based data models? Ans: A data model is an abstract model in which describes how data is represented and accessed. (i)
Explain the term - Handling Boundary Condition These are some circumstances that to be handled in any system initialization and termination. Describes how system is bro
need to get answer for questions 3&4 on this page in part 1
We define a view in SQL through using the create view command. To describe a view, we must provide the view a name and must state the query in which computers the view. The form of
How are tables stored on Disk? We realise that every record of a table can have different amounts of data. This is due to in some records; some attribute values may be "zero".
Show a centralised schema to support the operation of the system you have chosen, including in particular: the product catalogue; the outlets and respective stocks; customer record
What are the two types of blocks in the fixed -length representation? Define them. Anchor block: Have the first record of a chain. Overflow block: Have the records other tha
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd