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

desirable properties of decomposition, Desirable Properties Of Decompositi...

Desirable Properties Of Decomposition Decomposition is a process of dividing a relation into its projections that will not be disjoint. Please remind the Relational projection

Define canonical cover, Define canonical cover? A canonical cover Fc fo...

Define canonical cover? A canonical cover Fc for F is a set of dependencies like F logically implies all dependencies in FC and Fc logically shows all dependencies in F.

Explain the two types of participation constraint, Explain the two types of...

Explain the two types of participation constraint.  Total: The participation of an entity set E in a relationship set R is said to be total if each entity in E participates i

The first normal form (1nf), The First Normal Form (1NF) Let us first d...

The First Normal Form (1NF) Let us first describe 1NF: Definition: A relation (table) is in 1NF if 1.      There are no duplicate tuples or rows in the relation. 2.

Determine the three views of data, Determine the Three Views of Data We...

Determine the Three Views of Data We know that the similar thing, if viewed from dissimilar angles produces difference sights. Similarly, the database that we have formed alrea

Structure of distributed database, Structure Of Distributed Database: A di...

Structure Of Distributed Database: A distributed database system haves of a collection of sites, each of which keeps a local databases system. Every site is able to process local

Differentiate between pl/sql functions and procedures, Oracle & Distributed...

Oracle & Distributed Databases 1. Differentiate between PL/SQL functions and procedures. 2. Draw the diagram of logical structure of oracle database and explain it in brief.

Heuristics, Benefits of using heuristics

Benefits of using heuristics

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