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

Single-valued dependencies, Single-Valued Dependencies A database is a ...

Single-Valued Dependencies A database is a collection of related information and it is therefore inevitable that some items of information in the database would depend on some

Define hash files organization, Define Hash files organization a. Hashi...

Define Hash files organization a. Hashing includes computing the address of a data item by calculating a function on the search key value.   b. A hash function h is a functi

What are domain constraints, What are domain constraints? A domain is a...

What are domain constraints? A domain is a set of values that might be assigned to an attribute .all values that appear in a column of a relation must be taken from the similar

Express the queries in relational algebra, Question: This question refe...

Question: This question refers to the database schema. a) Express the following queries in SQL: (i) Write the SQL code that will create the table Company. Your answer sh

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

Consider relational schema and construct algebra query, Consider the follow...

Consider the following relational schema: PERSON (SS#, NAME, ADDRESS) CAR (REGISTRATION_NUMBER, YEAR, MODEL) ACCIDENT (DATE, DRIVER, CAR_REG_NO) OWNS (SS#, LICENSE) Constru

Two phase locking technique, growing phase and shrinking phase are disjoint...

growing phase and shrinking phase are disjoint, why ?

Project, write a database program for concurrency transaction in a bank

write a database program for concurrency transaction in a bank

Explain the paths in the association network, Explain the paths in the asso...

Explain the paths in the association network We can analyze use of paths in the association network as given below: Calculate each operation Find associations whic

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