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:
Q. Define a weak entity set and its identifying relationship. List the necessary conditions for a meaningful identifying relationship set of a weak entity set. Entity is a t
Create 1 experiment to demonstrate an aspect of query optimisation by using access-path structures (indexes), decomposition, or denormalisation. Once satisfied with your experiment
Process of normalization is the integral part of designing a database. Justify this statement with suitable database design
What disadvantage of ODBC does OLE DB overcome? By breaking the features and the methods of a DBMS into COM objects, OLE DB characteristic overcomes a main disadvantage of ODBC
A distributed database is defined as "a collection of multiple logically interrelated database which are physically distributed over a computer network" (a) Give any three advan
what is lossless & dependency preserving decomposition ?
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
find a name whose address is erode from student table
What is self-transition? If there is a transition which goes back to same state, it is known as "self- transition." With a trigger action exit action would be executed f
What are the advantages and disadvantages of merging an association into a class? Advantages: i) Less number of tables ii) Faster performance due to the fewer tables
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