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!
Replicating Data
One approach that may support efficient access to dissimilar applications as above may be to give access to every of the applications from dissimilar replicated files of the data. Each of the file may be prepared in a dissimilar way to serve the requirements of a dissimilar application. For instance, for the problem over, we may give an indexed sequential account file having accounted number as the key to account holders and the bank teller. A sequential file in the order of permissible loan limit to the Loan officers and a sorted sequential file in the order of balance to branch manager.
All of these files therefore differ in the organisation and would need different replica for dissimilar applications. Though, the Data replication brings in the problems of inconsistency under updating environments. Therefore, a better approach for data access for multiple keys has been proposed.
Developer is required to do a task including: - Database Normalization - Database Analysis - ERM Diagram Details can be provided and then you can change your bid accord
What are the three data anomalies that are similarly to take place as a result of data redundancy? Can data redundancy be completely eliminated in database approach? Why or why n
Define in which normalisation form if an attribute of a composite key is dependent on an attribute of other composite key. Ans: 3NF A relation is in 3 NF if an attribute of
Explain nested relations? Nested relations The assumption of INF is a natural one in the bank examples we have considered. However, not all applications are best modelled
Express types of information available in MySQL? Information as regards the result of queries: This includes number of records affected by any SELECT or UPDATE or DELETE st
WHERE and HAVING clause in SQL ? The WHERE clause is commonly used for implementing conditions on each tuple of the relation. The HAVING clause is used in combination along wi
Explain briefly concurrent task by taking an example. Concurrent Task- The concurrent occurrence of more than one event is called concurrent task. Operating systems can handl
HOW TO SOLVE THE LP Problems by simplex method?z=x1+-3x2+2x3
The indices are accumulated in the index files. The data is accumulated in the data files. Indices give fast access to data items. For example, a book database may be managed in th
Unrepeatable reads : Assume T7 reads X twice during its implementation. If it did not update X itself it could be very disturbing to see a dissimilar value of X in its next read. B
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