Study guide
14.3 Files, Databases, and Storage Requirements: Scale, Redundancy, and Backup
Praxis Computer Science 5652
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Praxis 5652 Exam Overview and ETS Pseudocode
1.1 Praxis 5652 Test Facts, Scoring, and Registration 1.2 Official ETS Pseudocode Notation and Tracing Strategy
2 Chapter 2: Impacts of Computing: Innovation, Access, and Effects
2.1 Computing for Creativity, Problem Solving, Communication, and Innovation 2.2 Equal Access, the Digital Divide, and Accessibility 2.3 Beneficial and Harmful Effects of Computing Innovations
3 Chapter 3: Impacts of Computing: Intellectual Property, Ethics, Privacy, and Security
3.1 Intellectual Property: Copyright, Open Source, and Creative Commons 3.2 Ethical and Unethical Computing Practices and Their Implications 3.3 Privacy, Security, Data Collection, and Local vs. Cloud Storage
4 Chapter 4: Algorithms and Computational Thinking: Abstraction, Decomposition, Number Bases, and Representation
4.1 Abstraction and Abstraction Hierarchies 4.2 Decomposition, Pattern Recognition, and Developing Algorithms 4.3 Number Bases: Binary, Octal, Decimal, and Hexadecimal 4.4 Algorithm Formats: Natural Language, Flowcharts, Pseudocode, and Tracing
5 Chapter 5: Algorithms: Efficiency, Limits of Computing, and Randomization
5.1 Algorithm Efficiency: Linear, Quadratic, Exponential, and Logarithmic Growth 5.2 Limits of Computing: Unsolvable Problems, Intractability, and Heuristics 5.3 Randomization, Random vs. Pseudorandom Numbers, and Scaling to a Range
6 Chapter 6: Algorithms: Searching, Sorting, and Recursion
6.1 Searching Algorithms: Linear Search and Binary Search 6.2 Sorting Algorithms: Tracing, Comparisons, Correctness, and Efficiency 6.3 Recursion: Base Cases, Tracing, Errors, and Iterative Equivalents
7 Chapter 7: Programming: Variables, Data Types, Strings, and Expressions
7.1 Variables, Data Types, and Type Conversion 7.2 Strings and String Operations 7.3 Operators, Precedence, Expressions, and Formulas 7.4 Boolean Expressions, Truth Tables, and Boolean Algebra
8 Chapter 8: Programming: Selection, Iteration, and Writing Code
8.1 Sequence and Selection: if, else, Chained and Nested Conditions 8.2 Iteration: for, while, do … while, and repeat … until Loops 8.3 Reading, Completing, and Modifying Code
9 Chapter 9: Programming: Procedures, Arrays, and Data Structures
9.1 Procedures, Parameters, Return Values, Nested Calls, and Scope 9.2 Arrays, Lists, and Two-Dimensional Arrays 9.3 Stacks, Queues, and Dictionaries (Maps)
10 Chapter 10: Programming: Correctness, Errors, Testing, and Code Quality
10.1 Program Correctness: Preconditions, Postconditions, Invariants, and Testing vs. Proof 10.2 Error Types and Debugging Techniques 10.3 Choosing Useful Test Cases: Boundaries, Partitions, Coverage, and Regression 10.4 Extensibility, Modifiability, and Reusability: Constants and Parameterization 10.5 Documentation, Code Reviews, Peer Feedback, and End-User Feedback
11 Chapter 11: Programming: Events, Usability, Input Validation, and APIs
11.1 Event-Driven Programming, Asynchronous Events, and Concurrency 11.2 Usability, Meaningful Error Messages, and Input Validation vs. Verification 11.3 Libraries and APIs: Reading Definitions, Making Calls, and Weighing Trade-offs
12 Chapter 12: Programming: Languages, Tools, Paradigms, and Object-Oriented Design
12.1 Low- and High-Level Languages, Compilers and Interpreters, and IDEs 12.2 Programming Paradigms: Procedural, Object-Oriented, and Others 12.3 Classes, Objects, Instance Variables, Methods, and Encapsulation 12.4 Inheritance, Polymorphism, and Overloading vs. Overriding
13 Chapter 13: Data: Bits, Encoding, Compression, and Encryption
13.1 Bits and Bytes: Why Binary, Storage Calculations, and Signed Integers 13.2 Encoding Text, Images, and Sound 13.3 Lossless and Lossy Compression: Run-Length Encoding, Huffman Coding, and Media Formats 13.4 Encoding vs. Encryption, Symmetric and Public-Key Encryption, and Their Trade-offs
14 Chapter 14: Data: Analysis Tools, Simulation, Storage, and Collection
14.1 Analyzing Data with Spreadsheets: Cleaning, Transforming, and Visualizing 14.2 Simulation and Modeling 14.3 Files, Databases, and Storage Requirements: Scale, Redundancy, and Backup 14.4 Collecting, Aggregating, and Generating Data: Public Data Sets, Surveys, Sensors, and Crowdsourcing
15 Chapter 15: Computing Systems: Hardware, Operating Systems, and Computing Environments
15.1 Hardware Components and the Fetch–Decode–Execute Cycle 15.2 Operating Systems, Software Components, and Resource Issues 15.3 Embedded Systems, the Internet of Things, and Types of Computing Systems 15.4 Local, Network, and Cloud Computing and Storage; How Binary Data Are Stored
16 Chapter 16: Networks, the Internet, the Web, and Cybersecurity
16.1 Network Types and Wired and Wireless Communication 16.2 Network Hardware and Layered Network Models (OSI and TCP/IP) 16.3 Network Performance: Bandwidth, Latency, Load, and Estimating Needs 16.4 How the Internet Works: Protocols, IP Addressing, DNS, URLs, and Reliability 16.5 The Web: HTTP, HTML and Markup Languages, Browsers, Servers, and Clients 16.6 Cybersecurity: The Five Pillars, Strong Passwords, Security Strategies, and Trade-offs
14.3 Files, Databases, and Storage Requirements: Scale, Redundancy, and Backup
Key Takeaways Explain This Topic AI
A file is a named collection of data on storage; a database is an organized collection of related data managed by software that supports queries, concurrent users, and integrity rules.
In a relational database, a table holds records (rows) with fields (columns); a primary key uniquely identifies each record, and a foreign key links to a record in another table.
Unplanned redundancy (the same fact stored in many places) wastes space and causes inconsistencies, while planned redundancy (mirrored drives, replicas, backups) protects against failure.
A common backup guideline is 3-2-1: keep three copies of important data, on two different types of media, with one copy off-site.
Storage planning must account for scale: how much data each item needs, how many items there are, and how fast they grow, plus room for backups and copies.
Last updated: September 2026
What this competency asks
ETS asks you to be familiar with methods to store, manage, and manipulate data :
Use terminology and concepts of files and databases .
Identify measures of file size (byte, kilo, mega, giga, tera, peta). Section 13.1 covers the units.
Identify issues connected with the storage requirements of computing applications, including scale, redundancy, and backup .
Files
A file is a named collection of data stored on a device. The operating system organizes files in a hierarchy of folders (directories) and records metadata about each one: size, type, dates, and permissions.
- Concept Meaning
- Text file Human-readable characters (.txt, .csv, .html, source code)
- Binary file Data in a non-text format (.jpg, .mp3, executables); needs a program that understands the format
- File format / extension Tells programs how to interpret the bytes (.png, .docx, .json)
CSV "Comma-separated values": one record per line, with fields separated by commas; a simple way to exchange tables
- Path A file's location, such as /home/ms-lee/grades/period3.csv
- Open, read, write, close The basic operations programs perform on files
- Sequential vs. random access Reading from the start in order vs. jumping directly to a position
Files work well for documents and simple data. When many users need to search, update, and relate large amounts of structured data at the same time, a database is the better tool.
Databases
A database is an organized collection of related data, managed by a database management system (DBMS) . Compared with loose files, a DBMS offers fast queries , safe concurrent access by many users, integrity rules, security, and recovery tools.
Relational terminology
A relational database stores data in tables (relations).
- Term Meaning Example
- Table A set of records about one kind of thing Students
- Record (row) One item One student
- Field (column, attribute) One property grade
- Primary key Field(s) whose value uniquely identifies each record; never null studentId
- Foreign key A field that refers to a primary key in another table Enrollments.studentId
- Query A request for data "All 10th graders, sorted by name"
- Schema The design: tables, fields, types, keys
Relationships: one-to-many links are made with a foreign key (one teacher has many classes). Many-to-many links use a junction table (students and courses, linked through Enrollments ).
- Querying with SQL
- SQL is a declarative language (Section 12.2): you state what you want. SELECT name
- FROM Students
- WHERE grade = 10
- ORDER BY name;
Given the rows (Maya, 10), (Leo, 11), (Ava, 10), (Zoe, 10), and (Ben, 9), the result is Ava, Maya, Zoe .
WHERE filters rows, and ORDER BY sorts them.
COUNT , SUM , and AVG with GROUP BY summarize groups. HAVING filters the groups.
JOIN combines tables on matching keys. For example, join Enrollments to Courses to list course titles for a student. A LEFT JOIN keeps every row of the left table even when there is no match.
Avoiding unplanned redundancy
Storing the same fact in many places causes update anomalies . Suppose a teacher's room number is copied into every student's record. Change the room, miss one copy, and the data now disagree. Normalization organizes tables so each fact is stored once and referenced by key. For example, room numbers live in a Teachers table, and student records refer to the teacher by ID.
- Storage requirements: scale, redundancy, and backup
- Scale
Estimate storage by multiplying the size per item by the number of items, then projecting growth:
30 teachers × 180 days × 2 short videos per day × 50 MB = 540,000 MB ≈ 540 GB per year .
Five years of retention needs about 2.7 TB, before backups. Each backup copy adds that much again.
At large scale, you also must consider performance (searching billions of records needs indexes), cost , bandwidth for moving data, and retention policies , meaning which data you are allowed or required to keep, and for how long.
Redundancy: two very different meanings
Kind Example Good or bad?
Unplanned data redundancy The same address typed into three tables Bad: wastes space and causes inconsistency
Planned (fault-tolerant) redundancy Mirrored drives (RAID 1), database replicas in two data centers, multiple power supplies Good: the system keeps running when one component fails
When a question mentions redundancy "to protect against hardware failure," it means planned redundancy. When it mentions "inconsistent copies of data," it means unplanned redundancy.
Backup
A backup is a separate copy that can restore data after deletion, corruption, device failure, theft, ransomware, or disaster.
3-2-1 guideline: 3 copies of important data, on 2 different types of media, with 1 copy off-site (or in the cloud).
Full vs. incremental: a full backup copies everything; an incremental backup copies only what changed since the last backup. Incremental backups are faster and smaller, but a restore needs the chain of backups.
Versioning keeps older versions, so a file corrupted or encrypted by ransomware can be rolled back.
Test restores. A backup that has never been restored is not proven to work.
Sync is not backup. A synchronized folder faithfully copies deletions and corruption to every device. A true backup keeps separate, older copies.
Mirroring (RAID) protects against a drive failure but not against accidental deletion or ransomware, because the mirror copies those changes instantly.