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.
Extend your CREATE TABLE statement from problem 3 with referential integrity constraints. Updates and deletes on related rows are restricted. 6. From examination of the sample data
The H. I. Topi School of Business operates international business programs in 10 locations throughout Europe. The school had its first class of graduates in 1965. The school keep
Problem Explain at least five relational algebraic operators with a suitable example. Note: All the above descriptions should be done by taking at least two examples from ou
Explain Thomas' Write rule. Show how it is different from timestamp ordering protol Ans: In timestamp-based concurrency control the thomas Write rule is a rule. Given a Timest
Ask Write the SQL code that will create the table structure for a table named EMP _1. This table is a subset of the EMPLOYEE table. The basic EMP_1 table structure is summarized in
What types of adjustments are required to increase chances of inheritance. a) Some attributes can be added or ignored in the base class operation b) Some changes can be
Hello.I have database access assignment which consist of creation Form, Subform, Calculation, Macros
What is Message switching Message switching transmits data units which can be arbitrarily long. Packet switching has a utmost packet size, if any message longer than that, it s
What are axioms? Axioms or rules of inference give a simpler technique for reasoning about
Create a new user : CREATE USER IDENTIFIED BY Example: //CREATE USER MCA12 IDENTIFIED BY W123 Grant: It is used to give database access permission to users. It is of
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