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:
Describe five main functions of a database administrator. Ans: A database administrator (DBA) is a person who is accountable for the environmental aspects of a database. Genera
what is file organization? what are file organization techniques.explain in detail? explain random file organization technique, multikey file organization technique?what is indexin
Functional Dependency Consider a relation R that has 2 attributes A and B. The attribute B of the relation is functionally dependent on the attribute A if and only if for every
Entity types that do not have any key attribute, and therefore cannot be identified independently, are known as weak entity types. A weak entity can be recognized uniquely only by
Distributed And Client Server Databases Introduction This unit tells the distributed database systems which are primarily relational and one important execution model: the
Multiple column Queries: Syntax: SELECT COLUMN1, COL2,...... FROM TABLE WHERE (COLUMN1, COL2, ...) IN (SELECT COLUMN1, COL2,.... FROM TABLE WHERE );
how to calculate frequency count of algorithm
What are called jukebox systems? Jukebox systems have a few drives and numerous disks that can be loaded into single of the drives automatically.
What is the full form of ODBC ? ODBC stands for Open Database Connectivity.
What is a hash index? A hash index organizes the search keys, with their associated pointers, into a hash file structure.
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