Describe analysis of access paths, Database Management System

Assignment Help:

Describe analysis of access paths

To describe analysis of access paths, consider an example of the design of a company's employee skills database. A part of the object model from analysis phase is shown in Figure. The operation Company:: find-skill returns a group of persons in company with a given skill. Like, we may ask for data of all employees who speak Japanese.

2350_Chain of associations between objects.png

                                                               Figure: Chain of associations between objects

 

For this example, suppose that company has 1000 employees, each of one has 10 skills on average. A simple nested loop will traverse Employs 1000 times and has-skill 10,000 times. If only 5 employees in fact speak Japanese, then test-to-hit ratio is 2000. 

Now, let us check whether this figure can be improved or not. Actually, we could make many possible improvements in this Figure. First, Has-skill need not to be implemented as an unordered list a hashed set. The hashing can be performed during fixed interval of time so that cost of testing whether a person speaks Japanese is constant or not, provided a unique skill object represents speaks Japanese. This rearrangement decreases number of tests from 10,000 to 1,000, or one per employee.

For those cases where number of hits from a query is less (since only a fraction of objects satisfy test) we can build the index to improve access to objects which must be frequently retrieved. For instance, we can add a qualified association Speaks language from Company to Employee, where qualifier is the language spoken. This permits us to straight away access all employees who speak particular language with no wasted accesses. But there is a cost to index: "It requires extra memory and it must be updated every time base associations are updated". The object designer should select that when it is useful to build the indexes. Here, we have to consider case where most queries return all of objects in search path, then an index really does not save much since test-to-hit ratio in this case is very close to 1.

 

173_Index for personal skills database.png

Figure: Index for personal skills database


Related Discussions:- Describe analysis of access paths

Define garbage collection, Define garbage collection. Garbage may be fo...

Define garbage collection. Garbage may be formed also as a side effect of crashes. Periodically, it is essential to find all the garbage pages and to add them to the list of fr

MULTI-LIST FILE ORGANIZATION, sir, could anybody help me in getting complet...

sir, could anybody help me in getting complete information about the mentioned topic

Ans the following, discuss the array implementation of a stack.

discuss the array implementation of a stack.

Insert - referential integrity, The insertion of a tuple in the aim of refe...

The insertion of a tuple in the aim of reference does not cause any destruction. Though, insertion of a tuple in the relation in which, we has the foreign key, for instance, in ASS

Problems of concurrent transactions-lost updates, Lost Updates : Suppose th...

Lost Updates : Suppose the two transactions T3 and T4 run simultaneously and they happen to be interleaved in the following way (suppose the initial value of X as 10000):

Increases efficiency-data fragmentation, Increases efficiency : Data is sto...

Increases efficiency : Data is stored close to most often used site, therefore retrieval would be faster. Also, data that is not required by local applications is not stored, there

Properties of a transaction , Properties of a Transaction        A tra...

Properties of a Transaction        A transaction has four main properties. These are: Atomicity Consistency Isolation or Independence Durability or Permanen

Describe the four main ways of optimising disk block access, Describe the f...

Describe the four main ways of optimising disk block access. Ans: a. Disk  b. Non-volatile writes buffers c. File organization (Clustering) d. Log-based file system

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