Need for multiple access paths, Database Management System

Assignment Help:

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.

Related Discussions:- Need for multiple access paths

Attributes and tuple, Before we talk about the relational model in more det...

Before we talk about the relational model in more detail, let us first define some very basic terms used in this model. Tuple Every row in a table shows a record and is cal

Define the boyce-codd normal form, Define the Boyce-Codd Normal Form with i...

Define the Boyce-Codd Normal Form with instance and also Compare BCNF and 3NF.  Ans: BCNF: For each functional dependency X->Y in a set F of functional dependencies over relati

Explain the recoverable schedule, Explain the Recoverable Schedule A r...

Explain the Recoverable Schedule A recoverable schedule is one in which for each pair of transactions Ti and Tj such that Tj reads a data item formerly written by Ti, the comm

Prepare a data flow diagram for computing the volume, Prepare a data flow d...

Prepare a data flow diagram for computing the volume and surface area of a cylinder. Inputs are the height and radius of the cylinder. Outputs are the volume and surface area of th

Equijoin, When every condition appears with equality condition (=) only. c)...

When every condition appears with equality condition (=) only. c)   Natural join (denoted by R*S) When two join attributes have the similar name in both relations. (Tha

Datawarehouse, 1) Define a job scheduling strategy that will meet business ...

1) Define a job scheduling strategy that will meet business requirement of reporting availability by 6am CST for the following cubes? Show the job scheduling dependencies in a pict

The structured query language, The Structured Query Language INTRODUCT...

The Structured Query Language INTRODUCTION Database is an organised set of information about an entity having controlled redundancy and serves numerous applications. DBMS

#title., losers with new information systems

losers with new information systems

Define assertions in sql, Define Assertions in SQL a. An assertion is a...

Define Assertions in SQL a. An assertion is a predicate that is expressing a condition we wish the database to always satisfy.  b. Domain constraints, functional dependency

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd