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.
Using SQL create a view RS for the relations R and S. The view consists of the columns A and D renamed as X and Y in that order. Insert a tuple into it. Show the contents of t
What is relationship instance ? Relationship Instance - A relationship is a relation between two or more entities. An instance of relationship set is a set of relationships.
normal forms
Example :; transfers transfer_amount from x's account to y's account ; Supposes x&y both accounts exist TRANSACTION (x, y, transfer_amount) Start transaction IF X AND Y
Before we talk about the relational model in more detail, let us first define some very basic terms used in this model. Tuple Every row in a table shows a record and is cal
a. Define the term "deadlock". There are four conditions that must hold before deadlock is possible. Name them. b. Outline an algorithm that detects whether there is a deadlock.
What is conceptual model ? A conceptual model is a independent of both hardware and software.
Server Control It is usual to control access to the data via the front end application, for example by displaying data as ‘read only'. This part of the assignment illustrates ho
Event Occurrence of a process is called event. In other words, the object can receive many input instructions. The changes which occur due to these instructions are known as e
The ABC Bank authority now wants to create a database for their customers. So you are requested to modify your program of Assignment A3 as follows. The main program first displa
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