Upload
bobba-leeladhar
View
206
Download
3
Embed Size (px)
Citation preview
FILE ORGANISATION
B LEELA DHARMDHM (OU) 2014-16; AIHAROLL NO 1404-01-676031(INDIA)94904-68518; [email protected]
NO BACKGROUND USED FOR UNIVERSAL USAGE
FIRST 40 SLIDES (ONLY 30- 40 MINUTES LECTURE)
PREPARED AS PER SEMESTER-3 SYLLABUS OF
HIS (HOSPITAL INFORMATION SYSTEMS) PAPER FOR
MDHM (MASTERS DEGREE OF HOSPITAL MANAGEMENT) OF
AIHA (APOLLO INSITUTE OF HOSPITAL ADMINISTRATION)
STUDENT’S PURPOSE.
FOR FULL PRESENTATION SEE AND INCLUDE ALL SLIDE AS PER INSTRUCTIONS IN THE END
INTRO
AIM TO ACQUAINT WITH FILE ORGANISATION.
PREVIEWINTRODEFINITIONS TYPESADVANTAGES &
DISADVANTAGESCONCLUSION
DEFINITIONS(RECAPITULATION - MUST KNOW INFO)
BIT (0 & 1)
BYTE (8 BITS)
ELEMENT/FIELD (ONE/MORE BYTES; PHY SPACE ON TAPE/DISK)
RECORD (C0LLECTION OF ELEMENTS)
FILE (COLLECTION OF RECORDS)
DATA BASE (SET OF INTERRELATED FILES)
FILE ORGANISATION (LOGICAL ARRANGEMENT OF DATA IN A FILE SYSTEM)
TYPES(SHOULD KNOW INFO)
SERIAL / HEAP / PILE SEQUENTIALINDEXED SEQUENTIAL /
HASHED CLUSTERED FILE SYSTEMDIRECT ACCESS /RANDOM
ACCESS
TYPES OF FILE ORG
THE HEAP FILE THE SERIAL FILE
CharacteristicsA collection of recordsStored in key
sequenceAdding/deleting
record requires making new file
Used as master files.
SERIAL / HEAP / PILE FILE ORG
MR. SUBBA MALE 35MRS. ANNA FEMA
LE 45MISS
HUSSAIN MALE 14
MR. ISSAC MALE 75MRS. RAO FEMA
LE 45MISS ARYA FEMA
LE 15
AN EXAMPLE OFSERIAL / HEAP / PILE FILE ORG
THE
SEQUEN
TIAL
FILE
CharacteristicsUsed in olden days.Records Stored as per primary
key.No direct access to individuals
is of no concern.Access is done is sequential
order until record is found.Binary access only feasible if
any other parameter is known
SEQUENTIAL FILE ORG
MR. SUBBA MALE 35 FEVER
OPD 1
MRS. ANNA FEMA
LE 45 COLD
OPD 3
MISS
HUSSAIN MALE 14 COU
GHOPD
5MR. ISSAC MALE 75 REF OPD
9MRS
. RAO FEMALE 45 REF OPD
9MISS ARYA FEMA
LE 15 EYE OPD 2
CONTINUATION OF THE SAME EXAMPLE OF SERIAL / HEAP / PILE FILE ORG FOR BETTER ASSIMILATION OF SEQUENTIAL FILE ORGANIZATION
1 MR. SUBBA MALE 35 FEVER 8AM OPD
13 MR
S. ANNA FEMALE 45 COL
D8.02 AM
OPD 3
5 MISS
HUSSAIN MALE 14 COU
GH8.05 AM
OPD 5
4 MR. ISSAC MALE 75 REF VIP OPD 9
6 MRS. RAO FEMA
LE 45 REF VIP OPD 9
2 MISS ARYA FEMA
LE 15 EYE 8.01 AM
OPD 2
CONTINUATION OF THE SAME EXAMPLE OF SERIAL / HEAP / PILE FILE ORG FOR BETTER ASSIMILATION OF SEQUENTIAL FILE ORGANIZATION
TOKEN SYSTEM, RECEPTION COUNTERS & QUEUE SYSTEM FOLLOWED. TIME GIVEN BY AUTOMATED TOKEN & DETAILS ENTERED BY BY THE DESK INCHARGE SHOWING
THE PATIENT RECORDS AT VARIED TIMES……
1 MR. SUBBA MALE 35 FEVER 8AM OPD
12 MISS ARYA FEMALE 15 EYE 8.01
AMOPD
23 MRS. ANNA FEMALE 45 COLD 8.02
AMOPD
34 MR. ISSAC MALE 75 REF VIP OPD
95 MISS HUSSAI
N MALE 14 COUGH
8.05 AM
OPD 5
6 MRS. RAO FEMALE 45 REF VIP OPD 9
CONTINUATION OF THE SAME EXAMPLE OF SERIAL / HEAP / PILE FILE ORG FOR BETTER ASSIMILATION OF SEQUENTIAL FILE ORGANIZATION SEQUENTIALLY ARRANGED AS PER THE TIME OF ENTRY AND “SERIAL NUMBERING” IS DONE ACCORDINGLY
NOTE:- PRIMARY KEY - THE TIME OF ENTRY
THE INDEXED SEQUENTIAL / HASHED FILE
CharacteristicsEach record of a file has a key field which uniquely identifies that record.An index consists of keys and addresses.An indexed sequential file is a sequential file (i.e. sorted into order of a key field) which has an index.A full index to a file is one in which there is an entry for every record.
THE INDEXED SEQUENTIAL FILE ORG
1 MR. SUBBA MALE 35 FEVER 8AM OPD
12 MISS ARYA FEMALE 15 EYE 8.01
AMOPD
23 MRS. ANNA FEMALE 45 COLD 8.02
AMOPD
34 MR. ISSAC MALE 75 REF VIP OPD
95 MISS HUSSAI
N MALE 14 COUGH
8.05 AM
OPD 5
6 MRS. RAO FEMALE 45 REF VIP OPD 9
CONTINUATION OF THE SAME EXAMPLE FOR BETTER ASSIMILATION OF THE INDEXED SEQUENTIAL / HASHED
FILE ORGANIZATION
1 MR. SUBBA MALE 35 FEVER 8AM OPD
12 MISS ARYA FEMALE 15 EYE 8.01
AMOPD
23 MRS. ANNA FEMALE 45 COLD 8.02
AMOPD
34 MR. ISSAC MALE 75 REF VIP OPD
95 MISS HUSSAI
N MALE 14 COUGH
8.05 AM
OPD 5
6 MRS. RAO FEMALE 45 REF VIP OPD 9
SEQUENTIALLY ARRANGED AS PER THE TIME OF ENTRY AND “SERIAL NUMBERING” IS DONE ACCORDINGLY
NOTE:- INDEXED KEY - THE TIME OF ENTRY
CONTINUATION OF THE SAME EXAMPLE FOR BETTER ASSIMILATION OF THE INDEXED SEQUENTIAL / HASHED
FILE ORGANIZATION
4 MR. ISSAC MALE 75 REF VIP OPD 96 MRS. RAO FEMALE 45 REF VIP OPD 91 MR. SUBBA MALE 35 FEVER 8AM OPD 15 MISS HUSSAIN MALE 14 COUGH 8.05 AM OPD 53 MRS. ANNA FEMALE 45 COLD 8.02 AM OPD 32 MISS ARYA FEMALE 15 EYE 8.01 AM OPD 2
CONTINUATION OF THE SAME EXAMPLE FOR BETTER ASSIMILATION OF THE INDEXED SEQUENTIAL / HASHED
FILE ORGANIZATION SEQUENTIALLY ARRANGED AS PER VIP & REGULAR ENTRY AND “SERIAL NUMBERING” IS DONE ACCORDINGLY
NOTE:- INDEXED KEY - VIP & REGULAR
THE CLUSTERED FILE
4 MR. ISSAC MALE 75 REF VIP OPD 96 MRS. RAO FEMALE 45 REF VIP OPD 91 MR. SUBBA MALE 35 FEVER 8AM OPD 15 MISS HUSSAIN MALE 14 COUGH 8.05 AM OPD 53 MRS. ANNA FEMALE 45 COLD 8.02 AM OPD 32 MISS ARYA FEMALE 15 EYE 8.01 AM OPD 2
CLUSTER 1VIPs
CLUSTER 2FEMALES
CONTINUATION OF THE SAME EXAMPLE FOR BETTER ASSIMILATION OF THE CLUSTER FILE ORGANIZATION
THE DIRECT / RANDOM ACCESS
THE DIRECT / RANDOM ACCESS
WHO IS THE IT CZAR?WHO IS THE RICHEST AMONGST ALL?
4 MR. ISSAC MALE 75 REF VIP OPD 96 MRS. RAO FEMALE 45 REF VIP OPD 91 MR. SUBBA MALE 35 FEVER 8AM OPD 15 MISS HUSSAIN MALE 14 COUGH 8.05 AM OPD 53 MRS. ANNA FEMALE 45 COLD 8.02 AM OPD 32 MISS ARYA FEMALE 15 EYE 8.01 AM OPD 2
CONTINUATION OF THE SAME EXAMPLE FOR BETTER ASSIMILATION OF THE DIRECT ACCESS /
RANDOM FILE ORGANIZATION
WHO IS THE GERIATRIC PATIENT?WHO IS THE FIRST PATIENT TO THE HOSPITAL?
ADVANTAGES
&
DISADVANTAGES
SERIAL / HEAP / PILE FILE ORGANISATIONADVANTAGES DIS-ADVANTAGESNEW RECORDS INSERTION FASTER
RETRIEVAL OF RECORDS TIME CONSUMING.GOOD FOR BULK LOADING UPDATING IS SLOWSIMPLE FILE ORGANISATION DELETION RESULTS UNUSED SPACESEARCH REQUIRES “ALL FILE SEARCH” – OVERLOAD ON PROCESSOR
SEQUENTIAL FILE ORGANISATIONADVANTAGES DIS-ADVANTAGES
SIMPLE FILE DESIGN ENTIRE FILE SEARCH – FOR SINGLE RECORD TOO.EFFICIENT FOR A NATURAL ORDER DATA.TRANSACTIONS HAVE TO BE SORTED BEFORE PROCESSING.STORAGE ON INEXPENSIVE DEVICES LIKE MAGNETIC TAPEOVERALL PROCESSING IS SLOW
INDEXED SEQUENTIAL / HASHED FILE ORGSNISATIONADVANTAGES DIS-ADVANTAGESFLEXIBILITY MORE STORAGEFASTER ACCESS OF VARIOUS DATA
PROCESSOR FASTER REQUIREDFASTER THAN SEQUENTIAL
CLUSTERED FILE SYSTEM FILE ORGANISATIONADVANTAGES DIS-ADVANTAGESACCESSIBILITY PROCESSOR NEEDS A SPEEDIER ONECROSS REFERENCES EASY
MORE SPACE FOR STORAGE
DIRECT ACCESS /RANDOM ACCESSADVANTAGES DIS-ADVANTAGES
ANY RECORD CAN BE ACCESSED ANY TIME.
COMPLEX THAN SEQUENTIAL
RECORD PROCESSING SPEED IS VERY FAST
NO FULL USE OF MEMORY LOCATIONS
UP-TO-DATE FILE DUE TO ONLINE UPDATING
SECURITY & BACK-UP PROBLEMS
CONCURRENT PROCESSING IS POSSIBLE
EXPENSIVE HARDWARE AND SOFTWARE REQUIRED.
TRANSACTIONS NEED NOT BE SORTED.
SYSTEM DESIGN COMPLEX AND COSTLY
FILE UPDATING DIFFICULT AS COMPARED TO SEQUENTIAL FILES.
CONCLUSION
THANK
YOU
INTRO(MOTIVATION
COULD KNOW INFO
HOW DATA GETS STORED ON CDs)
CONCLUSION
(MAY KNOW INFO)
ADVANCED SYSTEM OF FILE ORGANISATION
(MAY KNOW INFO)
FIRST FORWARD INDEX IS DEVELOPED AND THEN THE REVERSE INDEX IS DEVELOPED
VERY IMPORTANT IN BIO-INFORMATICS FIELD FOR DNA MAPPING AND REFERING.
EG 1:-WORD REFERENCES AT THE END OF BOOKS IN OLDEN TIMES, ATLASES ETC.,
EG 2 :- WORD ACCESS FILE SYSTEM.
EG 3 :- HOW A SINGLE CELL UNFOLDS INTO LARGER SPECIES IN NATURE?
INVERTED FILE ORGANISATION
EG 1 :- UNIVERSE.
MULTI RINGS FILE ORGANISATION
EG 2 :- HUMAN BODY.MULTI RINGS FILE ORGANISATION
EG 1 :- OUR OWN NATURE.
EG 2 :- AVATAR TREE CONNECTIVITY IN PANDORA.
EG 3:- DG RI (REVENUE INTELLIGENCE) MONITORING ALL TRANSACTIONS THOSE OCCUR BEYOND THE FINANCIAL LIMIT OF A PERSONS EARNING AND EXPENDING POWER THRU NETWORKING.
EG 4:- CLOUD COMPUTING .
B + - TREE FILE ORGANISATION