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:
File Organisation And Its Types Just as arrays, trees, lists and other data structures are used to execute data Organisation in main memory, a number of planning's are used to
Explain natural join? Natural Join - Similar as equi-join except in which the join attributes (having similar names) are not involved in the resulting relation. Only one sets
Define instance and schema? Instance: Collection of data stored in the data base at a certain moment is Schema: The overall design of the data base is known as the data base
Define the Canonical cover Ans: A canonical cover F c for F is a set of dependencies like F logically implies all dependencies in F c , and F c logically entails all dependen
Exclusive lock It is asked for by a transaction on a data item that it wants to update. No other transaction can put either a shared lock or an exclusive lock on a dat
Illustrate about the advanced object design Advanced object design is a complex task. The objects discovered through analysis serve as a skeleton of design. The operations reco
Consider a relation s over the attributes A and B with the following characteristics: 5,000 tuples with 10 tuples per page A 2-level B+ tree index on attribute
What are the properties of transaction? There are three properties of transactions :- A) Atomicity B) Consistency C) Isolation
Benefits of Hashed file Organisation 1. Insertion or search on hash-key is quick. 2. Best if equality search is required on hash-key. Drawbacks of Hashed file
What are the ways of obtaining the connection parameters? Hardwire the parameters into the program. Ask for the parameters interactively. Get the parameters
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