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:
What are the reasons for having variable length records? What are the various ways to store variable length records? Variable-length records arise in a database in various wa
Consider the following frequency counts of some itemsets in a transaction database r : freq({A}, r) = 0.405 freq({B}, r) = 0.510 freq({C}, r) = 0.303 freq({A
Define decision tree classifiers? As the name suggests decision tree classifiers use a tree: Every leaf node has an associated class, and every internal node has a predicate as
Inconsistent Analysis : The problem as given with transactions T1 and T2 where two transactions interleave to make incorrect result during an analysis by Audit is the instance of s
Example: Consider the following relations: ROLLNO NAME ADDRESS COURSE_ID 100 Ka
wh
Explain the utilities which help the DBA to manage the database? Every DBA uses database utilities to maintain and control their databases. But there is a lot of confusion wit
Clustering Indexes It may be an excellent idea to keep data of the students in the order of the programme they have registered as most of the data file accesses may need studen
Failures and Recovery In practice various things might occur to prevent a transaction from completing. Recovery methods are used to bring database, which does not satisfy consi
Define data model? A data model is a collection of conceptual tools for explaining data, data relationships, data semantics and consistency constraints.
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