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.
what is lossless & dependency preserving decomposition ?
What was the method in which records are physically stored in a specified order according to a key field in each record ? A method in which records are physically stored within
Probelm: (a) A distributed database (DDB) is a collection of multiple, logically interrelated databases which are physically distributed over a computer network" (i) Give a
Define multivalued dependency. What do understand by trivial multivalued dependency? Ans: A multivalued dependency is a full constraint among two sets of attributes in a rela
Data Fragmentation "Fragmentation includes decomposing the data in relation to non-overlapping component relations". Why do we require fragmenting a relation?
Define check point and its impact on data base recovery. Ans: There could be hundreds of transactions handled per minute, in a large on-line database system.
Describe log based recovery The most usably structure for recording data base modification is the LOG the log is a sequence of log records recording all the update activities i
What is multiplicity in the associations? Give an example to explain multiplicity? Multiplicity in association indicate number of objects participate in any relationship. For
Project Description: Need Point of Sale software for pizza restaurant. Delivery and take out service, client's database, inventory control, order history, last order, order from
A database administrator''s responsibilities and data contents
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