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!
Need for Multiple Access Paths
In practice, most of the online information systems need the support of multi-key files. For example, consider a banking database application having a lot of different kinds of users such as:
All of these users access the bank data though in a diverse way. Let us suppose a sample data format for the Account relation in a bank as:
Account Relation:
Account
Number
Holder Name
Branch
Code
Account type
Balance
Permissible
Loan Limit
A teller may access the record over to check the balance at the time of withdrawal. One needs to access the account on the basis of account number and branch code. A loan approver may be interested in searching the potential customer by accessing the records in declining order of permissible loan limits. A branch manager may need finding the top ten most preferred customers in each category of account so may access the database in the order of balance and account type. The account holder may be interested in his/her own record. Therefore, all these applications are trying to refer to the similar data but using dissimilar key values. Therefore, all the applications as above need the database file to be accessed in dissimilar order and format. What may be the most efficient way to give faster access to all such applications? Let us talk about two approaches for this:
(a) Differentiate between information and data . (b) List and briefly explain five potential benefits of the database approach compared to conventional file systems. (c) Diff
projects?
What are the three data anomalies that are likely to occur as a result of data redundancy? Can data redundancy be completely eliminated in database approach? Why or why not? A
Explain Foreign Key? Foreign Key - Let there are two relations (tables) R and S. Any candidate key of the relation R that is referred within the relation S is known as the fo
Although, the essential features of E-R diagrams are enough to design many database situations. Though, with more difficult relations and advanced database applications, it is need
What are the advantages of creating a table from existing table?
what are the reasons having variable length records
Log based recovery: Let us first describe the term transaction log in the context of DBMS. A transaction log is a record in DBMS that remains track of all the transactions of a dat
In tuple relational calculus P1 → P2 is equivalent to ? A In tuple relational calculus P1→ P2 is equivalent to ¬P1 V P2. (The logical implication expression A B, meaning
write-set(T): Each data items that are written by a transaction T
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