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.
Objectives Define the terms RECOVERY and INTEGRITY; Define Recovery Techniques; Explain Error and Error detection techniques, and Define types of Authorisation.
Describe the Composite Key Composite Key: Sometimes one key is not enough to uniquely recognize a row. E.g. in a single class Roll is enough to search a student, but in the w
A collection of a same kind of entities is known as an Entity Set or entity type. Example: For the COLLEGE database defines earlier objects of concern are Students, Faculty,
Determine Which is not a consequence of concurrent operations? Ans: Update anomaly.
Outer Join: The use of Outer Join is that it still joins those tuples that do not have matching values in common columns are also contained in the result table. Outer join places
For each m:n relationship type R, we make a new table (say S) to represent R. We also contain the primary key attributes of both the participating entity types as a foreign key att
What are the advantages of creating a table from existing table?
Explain the Aggregation implies concurrency Concurrency actually is: This in objects can be identified by the way they change state. Present objects can change state independen
PHYSICAL DBMS ARCHITECTURE The physical architecture defines the software components used to process and enter data, and how these software components are related and interc
Define Assertions in SQL a. An assertion is a predicate that is expressing a condition we wish the database to always satisfy. b. Domain constraints, functional dependency
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