Multi-key file organisation, Database Management System

Multi-Key File Organisation

In this part, we will introduce two basic file Organisation schemes that permit records to be accessed by more than one key field, therefore, allowing multiple access paths each having a dissimilar key. These are known as multi-key file Organisations. These file organisation methods are at the heart of database execution.

There are numerous methods that have been used to execute multi-key file Organisation. Most of these methods are based on building indexes to provide direct access by the key value. Two of the commonest methods for this Organisation are:

  • Multi-list file Organisation
  • Inverted file Organisation

 

Let us talk about these methods in more detail. But first let us talk about the need for the Multiple access paths.

 

 

Posted Date: 3/8/2013 6:15:37 AM | Location : United States







Related Discussions:- Multi-key file organisation, Assignment Help, Ask Question on Multi-key file organisation, Get Answer, Expert's Help, Multi-key file organisation Discussions

Write discussion on Multi-key file organisation
Your posts are moderated
Related Questions
Why do so various organizations use MySQL? Advantages: Open source Highly efficient Offers a high scalability in terms of size and connectivity. Highly prote

What is the archtetype/instance pattern? The archetype/instance pattern happens when one entity tracks occurrences of another entity. A common example is the relationship among

What is a heterogeneous distributed database? In a heterogeneous distributed database, dissimilar sites may use different schemas, and dissimilar dbms s/w. The sites may not be

What are the two types of indices? The two types of indices are:- A)     Dense index B)      Sparse index

The indices are accumulated in the index files. The data is accumulated in the data files. Indices give fast access to data items. For example, a book database may be managed in th

In tuple relational calculus P1 → P2 is equivalent to ? A In tuple relational calculus P1→  P2 is equivalent to ¬P1 V P2. (The logical implication expression A  B, meaning

Shared lock or Read Lock It is requested by a transaction that needs to just read the value of data item. A shared lock on a data item does not permit an exclusive lock

Define functional and multivalued dependencies.       Ans:  A functional dependency is a assets of the semantics of the attributes in a relation. The semantics point out how at

Hierarchical model is also known by? A hierarchical model is also known as a Tree structure.

Explain the Aggregation implies concurrency Concurrency actually is: This in objects can be identified by the way they change state. Present objects can change state independen