Chapter 12 (File Management) Flashcards
What are some desirable properties of files?
Long-term existence
Shareable between processes
Structure
What operation allows a process to perform functions on a file?
Open
What is a field?
Basic element of data containing a single value
T/F A field can only be fixed length
F, fixed or variable length
What is a record?
Collection of related fields treated as a unit
T/F A record cannot be variable length
F, it can
What is a file?
Collection of similar records treated as a single entity
What is a database?
Collection of related data (1 or more files)
What are the criteria for choosing a file organization?
Rapid access
Ease of update
Economy of storage
Simple maintenance
Reliability
List the five fundamental file organizations
Pile
Sequential file
Indexed sequential file
Indexed file
Direct or hashed file
How does pile collect data?
In the order it arrives
How is data accessed in pile?
Exhaustive search
What is the purpose of pile?
Accumulate a mass of data and save it
Which file organization may be useful to store data prior to processing it?
Pile
T/F In a sequential file, some fields are different
F, all are the same
What are the attributes of a sequential file?
Field names and lengths
Where are new records placed for a sequential file?
Log file or transaction file
Where is a sequential file useful?
Batch processing
How can additions be handled in an indexed sequential file?
Overflow file
What’s special about an indexed sequential file?
Reduces time to access a single record while still providing sequential processing
What’s the difference between a partial and exhaustive index?
Partial index only has pointers to records having the field of interest. Exhaustive index has pointers to every record
When are direct or hash file mostly useful?
If records are only accessed one at a time
How are indexes often implemented?
B-trees
What’s the primary benefit of the B-tree for indexes?
Fewer disk accesses