Need for multiple access paths, Database Management System

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:

  • Teller
  • Loan officers
  • Brach manager
  • Account holders

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

Account

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:

  • By Replicating Data
  • By providing indexes.
Posted Date: 3/8/2013 6:16:31 AM | Location : United States







Related Discussions:- Need for multiple access paths, Assignment Help, Ask Question on Need for multiple access paths, Get Answer, Expert's Help, Need for multiple access paths Discussions

Write discussion on Need for multiple access paths
Your posts are moderated
Related Questions

What is a B+-Tree index? A B+-Tree index takes the form of a balanced tree in which each path from the root of the root of the root of the tree to a leaf of the tree is of the

Given the following relations Vehicle (Reg_no, make, colour) Person(eno, name, address) Owner(eno, reg_no) Write expressions in the relational algebra to answer the following

Differance between procedural and non procedural DML? Procedural and non procedural DML Procedural DML exactly what data is require and how to obtain those data. Non procedural

Convert the following ER - diagram (Entity Relationship Diagram) into a relational database (the primary keys are underlined): 2160_Convert the following ER - diagram into a

How can Redundant Associations be done It can be done by asking questions: i)  Is there a specific arrangement of network which would optimize critical aspects of completed

Explain Relational model and their use in DBMS? Relational Model - The relational model was first introduced through E.F. Codd of the IBM Research in the year of 1970. The mode

Consider the following database containing five transactions. Let min_sup = 60%. Mine all frequent itemsets using Apriori and FP-growth algorithm. Compare the efficiency of the t

Consider the relations EMP(ENO,ENAME,AGE,BASIC_SALARY) WORK_IN(ENO,DNO) DEPT(DNO,DNAME,CITY) Express the following queries in SQL (i) Find names of employees who work in a dep

I want an iPad app that is a simple 1 page form to complete with text. The Objective is to allow a few dozen people of the same organization (they're all on iPad) to open the app,