Database Fundamentals: Key Concepts and Structures
Database Fundamentals
1. It is a set of fields that belong to the same entity.
R = log
2. It is an attribute or set of attributes that uniquely identifies a record.
R = key
3. It is a homogeneous set of records containing information on a subject.
R = file
Database Users
4. How many types of database users are there?
R = 3
Transactions
5. What is a transaction?
It is a set of orders executed as a unit of work.
VSAM Blocks
6. How are blocks in VSAM called?
a) control intervals
Virtual Memory
7. What is the goal of virtual memory?
b) Ensure private address space for each process
8. What is the acronym for advanced translation buffer?
a) TLB
9. How are elements identified within a segment?
d) for the journey
10. It is a contiguous area of storage with fixed length, representing a physical unit of transfer between memory and external storage.
d) control intervals
11. What type of file can you access through a random search in a log file?
a) Indexed Sequential File
Primary Key
12. What is the primary key?
a) It is the number or group of unique characters that identifies each record in the file.
Index Features
13. What features does a key have?
a) Have a record called index data, dense and sparse index
B-Tree
14. What is a B-tree?
a) It is a special class that allows multipath tree, retrieval, deletion, and insertion of records in a file.
15. What makes up a B-tree?
a) A block in the root node, node blocks to the branches, leaf node blocks
16. Allows running programs or processing data exceeding available memory space and/or running several programs at once using segmentation/paging on demand, keeping only the executing portion in main memory.
b) virtual memory
17. The routine exchange of pages in the OS is called:
c) swapping
18. It is faster than main memory and applies the principle of locality: the latest data stored in main memory is consulted for future reference.
b) cache
Memory Management
19. Dividing programs into smaller parts or pages, and memory into pieces the same size as pages called page frames, minimizing internal fragmentation and preventing external fragmentation.
b) memory paging system
20. Dividing memory into variable-length segments defined by the program segment size.
d) segmentation system
File Access
21. What is a small file that can be accessed quickly by a program or website?
a) Direct File
22. Each record in a direct organization file is referenced by an address number indicating its distance from the source file.
Structure of a direct file
23. When a file is divided into segments to be accommodated on the disk, leading to fragmentation.
a) Defragmentation
24. A logically related set of records whose access sequence is determined by its ranking.
a) a sequentially organized file
25. A program designed to detect, locate, and correct errors in another program.
a) Debugging files
File Organization
26. Records are stored adjacent to each other according to a key, such as employee number or account number.
a) sequential file organization
27. Is this organization related to files via a link and a key for faster access?
a) organization of a sequence-indexed archive
28. Using hashing techniques as a method of __________ eliminates the need for maintenance and search indexes.
a) ADDRESS
29. What is the means by which we can generate a sequence of addresses on a record?
a) 
30. Does this happen between logical data structures and physical data structures?
a) ORGANIZATION SEQUENTIAL, INDEXED
31. What file consists of records in succession so that access is determined by their order?
a) Sequential file
32. Is it okay to use sequential files for a structure containing 20,000 names with addresses and phone numbers?
a) False
33. How is information recovery classified in sequential files?
a) Interactive and generating reports
34. What should be the bigger the need for current data in the master file?
a) Updates often
35. Cite two basic types of updates that can be applied to master files.
a) Inserting a new record and modifying an existing record