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!
Multi-list file Organisation
Multi-list file organisation is a multi-index linked file organisation. A linked file organisation is a logical organisation where physical ordering of records is not of concern. In linked organisation the series of records is governed by the links that verify the next record in series. Linking of records can be unordered but such a linking is very costly for searching of information from a file. Thus, it may be a good idea to link records in the order of increasing primary key. This will facilitate deletion and insertion algorithms. Also this really helps the search performance. In addition to making order during linking, search by a file can be further facilitated by producing primary and secondary indexes. All these ideas are supported in the multi-list file organisation. Let us describe these concepts further with the help of an example.
Consider the employee data as given in Figure. The record numbers are given as alphabets for better explanation. Suppose that the Empid is the key field of the data records. Let us describe the Multi-list file organisation for the data file.
Record
Number
Empid
Name
Job
Qualification
Gender
City
Married/
Single
Salary
A
800
Jain
Software
Engineer
B. Tech.
Male
New Delhi
15,000/-
B
500
Inder
Manager
Female
Married
18,000/-
C
900
Rashi
MCA
Mumbai
16,000/-
D
700
Gurpreet
12,000/-
E
600
Meena
13,000/-
Figure: Sample data for Employee file
Since, the primary key of the file is Empid, thus the linked order of records should be defined as B (500), E(600), D(700), A(800), C(900). Though, as the file size will grow the search performance of the file would deteriorate. Therefore, we can make a primary index on the file (please note that in this file the records are in the logical series and tied together using links and not physical placement, thus, the primary index will be a linked index file rather than block indexes).
notes about update opreation
joins
Foreign Keys and NULL Let us take the relation: DEPT DEPT ID DNAME BUDGET D1 M
Problem: (a) Given the following relation: Stats(Name,Sex,Children, Occupation, Salary, Tax, Audits) Write SQL code to define the following security constraints: (i) User
education.
The cross-section of twisted pair The cross-section of each and every strand of the twisted pair is π/4 square mm. A 10-km length of this type of material, with two strands per
Dependency Preservation It is obvious that the decomposition must be lossless so that we do not lose any information from the relation that is decomposed. Dependency preservati
Explain about primary key Primary Key: It is one of the candidate keys that are taken to be the recognizing key for the entire table. E.g. although there are two candidate ke
explain exhaustively the problems associated with ER diagrams. include illustrations in your answer
job scheduling for different cubes
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