Skip to content
tezvyn:

Top 30 Storage Interview Questions and Answers

30 multiple-choice questions on Storage, drawn from 30 bites out of the 58 tagged Storage on Tezvyn. Answer them here or read straight down. Every question carries the correct option, why it is correct, and a link to the bite it came from.

30 questions. Pick an answer, or open “Show the answer” to read it.

Answers are graded in your browser. Nothing is saved, and no XP or streak is earned here. The app keeps score.

  1. Question 1 of 30

    Which statement best captures the mechanical cost of maintaining multiple indexes on a write-heavy table?

    Show the answer

    Answer: c · Every table write typically triggers random I/O to update each index's B-Tree, plus node splits and log overhead

    The card explains that every write likely updates every index, causing extra random I/O, node splits, and WAL overhead. Option B reflects the common misconception that binary search trees are the classic disk structure, while D confuses hash indexes with the standard B-Tree approach.

    Read the full bite: Explain database indexes, the classic data structure, and write-heavy trade-offs

  2. Question 2 of 30

    Which statement correctly describes the relationship between OCI image layers and OverlayFS in container runtime?

    Show the answer

    Answer: b · OCI specifies layer tarballs and manifests, while OverlayFS is the in-kernel driver that assembles them at runtime

    OCI governs the packaging and distribution of images as tarballs and manifests, while OverlayFS is solely a Linux kernel filesystem driver that mounts those layers at runtime. Distractor B is a common misconception that conflates the runtime driver with the image specification itself.

    Read the full bite: Explain layered filesystems like OverlayFS and their efficiency vs monolithic models

  3. Question 3 of 30

    What is the primary reason Union File Systems, like Docker's OverlayFS, can exhibit performance overhead for write-intensive applications?

    Show the answer

    Answer: a · Each modification to an existing file from a lower layer triggers a copy-on-write operation.

    The card states that "The copy-on-write mechanism adds performance overhead for every initial write to a file that exists in a lower layer." This means files from read-only layers must first be copied to the writable layer before they can be modified, which is an extra I/O operation. Distractor A is incorrect because lower layers are read-only and not re-merged on write; changes are isolated to the top writable layer.

    Read the full bite: Union File Systems: Docker's Layered Magic

  4. Question 4 of 30

    Which scenario best highlights the primary benefit of using a data lake compared to a data warehouse?

    Show the answer

    Answer: b · Storing vast amounts of diverse, unprocessed data for future machine learning model training.

    The card states that data lakes are ideal for storing "massive volumes of diverse, unstructured data cheaply, without having to define its structure or purpose upfront" and for "data scientists and machine learning engineers who need access to raw data for exploratory analysis and model training." Option B directly reflects this core advantage. Option C describes a use case better suited for a data warehouse, which is optimized for consistent, high-performance reporting.

    Read the full bite: Data Lake vs. Data Warehouse: Raw vs. Refined Data

  5. Question 5 of 30

    Which scenario is the most appropriate use case for sessionStorage?

    Show the answer

    Answer: a · Temporarily saving progress on a multi-page form within a single browser tab.

    sessionStorage is ideal for temporary data tied to a single tab, such as partially filled form data that should persist across page refreshes but not after the tab closes. Storing sensitive data like authentication tokens is explicitly advised against for any Web Storage, and large datasets are better handled by IndexedDB.

    Read the full bite: Web Storage API: Browser Key-Value Stores

  6. Question 6 of 30

    Which storage type is the appropriate backing for a relational database that needs low-latency random reads and writes?

    Show the answer

    Answer: b · Block storage, because it provides a raw low-latency volume to a single instance

    Databases need fast in-place random I/O on a volume attached to one host, which is exactly what block storage provides. Object storage reads and writes whole objects over HTTP and is unsuitable for transactional workloads.

    Read the full bite: Object vs block vs file storage

  7. Question 7 of 30

    You mount a named volume at the Postgres data directory, then run docker compose down. Why does the data survive?

    Show the answer

    Answer: a · Named volumes are managed independently of containers, so removing containers leaves them intact

    Named volumes have a lifetime separate from containers, so down (which removes containers) leaves the volume and its data; there is no snapshot, and down does remove containers unless you add -v which would also delete the volume.

    Read the full bite: Persist PostgreSQL data across compose down

  8. Question 8 of 30

    Which characteristic best describes a data lake's approach to data storage and usage?

    Show the answer

    Answer: d · Raw data is stored in its native format, with structure applied during analysis.

    A data lake's defining characteristic is its "store now, structure later" approach, where raw data is kept in its native format and a schema is applied only when the data is read for analysis (schema-on-read). This provides maximum flexibility for future analysis, unlike data warehouses which impose structure upon ingestion.

    Read the full bite: Data Lake: Store Raw Data Now, Analyze It Later

  9. Question 9 of 30

    In a typical web-plus-database Compose setup, which storage choice fits each service best?

    Show the answer

    Answer: b · Bind mount the source code in dev; named volume for the database data

    Bind mounts suit live-reloading source in development, while named volumes give Docker-managed, portable durability ideal for database data; bind-mounting production DB files couples data to a fragile host path.

    Read the full bite: Bind mounts versus named volumes

  10. Question 10 of 30

    Why is object storage generally not recommended for applications requiring frequent, small updates to data, such as a transactional database?

    Show the answer

    Answer: d · Objects are immutable, meaning even a small modification necessitates replacing the entire object.

    The card explicitly states that objects are immutable, making object storage unsuitable for frequent updates because changing even one byte requires re-uploading the entire object. While other options might seem plausible, the immutability is the direct and primary reason given in the card.

    Read the full bite: Object Storage: Data Without a File Hierarchy

  11. Question 11 of 30

    Why can a table have only one clustered index but many non-clustered indexes?

    Show the answer

    Answer: a · Rows can be physically ordered only one way, and the clustered index defines that order

    A clustered index sets the single physical ordering of the table's rows, so only one can exist; non-clustered indexes are separate structures with pointers, so a table can have many. Clustered indexes in fact excel at range queries, making that option wrong.

    Read the full bite: Clustered versus non-clustered indexes

  12. Question 12 of 30

    Before a cloud server's operating system can store files on a newly provisioned block storage volume, what essential step must be performed?

    Show the answer

    Answer: a · It must be formatted with a filesystem and then mounted to a directory.

    The card states that block storage is like a raw, unformatted SSD, and it's 'up to you to format it with a filesystem... and mount it' before use. Option B is incorrect because block storage is designed for single-server attachment, not for simultaneous access by multiple servers.

    Read the full bite: Block Storage: Your Virtual Hard Drive in the Cloud

  13. Question 13 of 30

    For which scenario is cloud file storage the most suitable solution?

    Show the answer

    Answer: c · Enabling multiple servers or users to access a shared, hierarchical file system.

    Cloud file storage is designed for scenarios requiring a shared, traditional file system accessible by multiple clients or servers, as stated in the card. Storing vast unstructured data is better suited for object storage, and high-performance databases typically use block storage.

    Read the full bite: Cloud File Storage: A Shared Drive on the Internet

  14. Question 14 of 30

    A cloud storage service advertises 99.999999999% durability but only 99.9% availability. What does this primarily indicate?

    Show the answer

    Answer: b · While your data is extremely unlikely to be permanently lost, it may experience periods where it cannot be accessed.

    High durability (11 nines) means the data is extremely unlikely to be permanently lost or corrupted. However, 99.9% availability implies that the data might be temporarily unreachable, as availability refers to reachability, not data preservation. Option C is incorrect because 99.9% availability does not guarantee accessibility at all times.

    Read the full bite: Data Durability vs. Availability: Lost vs. Unreachable

  15. Question 15 of 30

    What is the primary drawback of storing data that requires frequent, low-latency access in a cold or archive storage tier?

    Show the answer

    Answer: d · It will incur significant retrieval costs and access delays.

    The card states that retrieving cold data unexpectedly is slow and costly, and that retrieval fees and time delays will quickly make it more expensive than keeping it in a standard tier. Cold storage is for long-term retention, not automatic deletion.

    Read the full bite: Cloud Storage Tiers: Match Cost to Access Frequency

  16. Question 16 of 30

    Which statement accurately describes the storage behavior of block storage snapshots?

    Show the answer

    Answer: a · Subsequent snapshots only store the data blocks that have changed since the previous snapshot, referencing older data.

    The card states that subsequent snapshots only store changed data blocks and reference older data from previous snapshots, making them incremental. This also means deleting an older snapshot does not necessarily free up all its space if newer snapshots still depend on its data, making option D incorrect.

    Read the full bite: Block Storage Snapshots Are Incremental Backups

  17. Question 17 of 30

    A developer configures Cross-Region Replication (CRR) for an existing S3 bucket. What is a critical behavior they should be aware of regarding the replication process?

    Show the answer

    Answer: b · Objects already present in the source bucket before CRR activation will not be replicated.

    The card explicitly states that CRR "does not replicate objects that were present before replication was configured." It only applies to new objects or updates made after CRR is enabled. Option A is incorrect because the card describes CRR as an "asynchronous" feature.

    Read the full bite: Cross-Region Replication (CRR): Geographic Data Copying

  18. Question 18 of 30

    Which scenario highlights a key limitation of encryption at rest?

    Show the answer

    Answer: d · An authorized application, compromised by an attacker, reads sensitive data from storage.

    The card explicitly states that encryption at rest "doesn't stop a compromised app with valid keys from reading" and advises "Do not rely on it to protect data from a compromised application with valid credentials." While encryption can have performance implications, the card notes that "performance overhead on modern systems is negligible."

    Read the full bite: Encryption at Rest: Securing Your Data When It's Not Moving

  19. Question 19 of 30

    You are running JupyterLab in Docker and need to persist both active notebook development and multi-gigabyte datasets across container restarts. Which approach best follows Docker best practices?

    Show the answer

    Answer: a · Use a bind mount for notebooks and a named volume for datasets, mounting the dataset read-only when appropriate

    Bind mounts let host notebook edits sync immediately into the container, while named volumes persist datasets without tying them to a specific host path and remain portable across environments. Swapping them ignores the need for live code syncing, and COPY requires image rebuilds on every change.

    Read the full bite: How do you persist notebooks and artifacts in Docker?

  20. Question 20 of 30

    With Object Versioning enabled, what is the immediate effect of a PUT request that would normally overwrite an existing file?

    Show the answer

    Answer: a · A new version of the file is created, and the previous version remains accessible.

    The card explicitly states that when versioning is enabled, a PUT request 'you're not replacing it; you're creating a new version' while the old version is retained. Option D describes the behavior of storage without versioning, which is precisely what versioning aims to prevent.

    Read the full bite: Object Versioning: A Safety Net for Cloud Files

  21. Question 21 of 30

    Why do databases read and write whole pages rather than individual rows directly to disk?

    Show the answer

    Answer: d · Block-oriented I/O has a high fixed cost per operation, so whole pages amortize it across many rows

    Each disk or SSD operation carries a large fixed cost no matter how few bytes are moved, so transferring a whole page spreads that cost over many rows. The other options misstate row sizes and conflate storage with security or ACID.

    Read the full bite: What is a database page?

  22. Question 22 of 30

    Why would an application use a presigned URL instead of proxying a private file download through its own server?

    Show the answer

    Answer: d · To reduce server load and improve efficiency by offloading file transfer.

    The card states that proxying large files through the server is "inefficient and costly" and that presigned URLs allow the browser to download "directly from cloud storage," meaning the server doesn't handle the file stream, thus reducing server load. Option C is incorrect because the client doesn't authenticate with the cloud provider; the presigned URL itself contains the necessary authentication for that specific request.

    Read the full bite: Presigned URLs: Temporary Access to Private Files

  23. Question 23 of 30

    What fundamental problem does a storage gateway primarily solve in a hybrid cloud setup?

    Show the answer

    Answer: d · Bridging the protocol gap between on-premise applications and cloud storage APIs.

    A storage gateway's core function is to translate traditional on-premise storage protocols (like NFS or iSCSI) into cloud-native API calls (like REST), allowing legacy applications to use cloud storage without modification. It does not eliminate all local storage, nor is it suitable for latency-sensitive applications.

    Read the full bite: Storage Gateway: Your On-Prem to Cloud Translator

  24. Question 24 of 30

    Why can inserting rows with random primary-key values degrade a clustered (index-organized) table more than a heap?

    Show the answer

    Answer: a · Clustered tables must place each row in key order, causing mid-tree page splits and fragmentation

    A clustered table physically orders rows by key, so random keys force insertions into the middle and trigger page splits, while a heap simply appends. The last option reverses the definitions; heaps are unordered.

    Read the full bite: Heap file versus clustered index

  25. Question 25 of 30

    What is the key security benefit of attaching a role to a VM instead of placing access keys on it?

    Show the answer

    Answer: b · The VM receives short-lived, auto-rotating credentials with no stored secret

    An attached role delivers temporary, auto-rotating credentials via the metadata service, so no long-lived secret exists to leak. The other options either remove access control or reintroduce the static-key risk.

    Read the full bite: Granting a VM scoped storage access without static keys

  26. Question 26 of 30

    After locating the leaf page holding the lower bound, how does a B+ Tree efficiently return the rest of a range?

    Show the answer

    Answer: a · It follows the sorted linked list between leaf pages, reading consecutive leaves until the upper bound

    Leaf pages are linked in sorted order, so the engine simply walks that chain from the start key onward, avoiding repeated root descents. Re-traversing per row or loading the whole tree would be far more expensive.

    Read the full bite: B+ Tree range queries across pages

  27. Question 27 of 30

    A 10,000-GPU training cluster expects a hardware failure roughly every nine hours. Which checkpointing approach best balances throughput protection with recovery reliability?

    Show the answer

    Answer: c · Asynchronous checkpoints every tens of minutes using atomic finalization and tiered storage

    Asynchronous writes prevent GPU stalls, an MTBF-driven cadence of tens of minutes bounds lost work to an acceptable window, and atomic finalization with tiered storage guarantees valid recoverable states. Option D is a common anti-pattern: synchronous daily checkpoints destroy throughput and risk losing a full day of compute, which is economically untenable at this scale.

    Read the full bite: Robust checkpointing strategy for multi-day training jobs and seamless resumption

  28. Question 28 of 30

    Why would a database administrator choose different storage engines for various tables within the same database?

    Show the answer

    Answer: c · To optimize each table's performance based on its specific data access patterns and workload.

    The card states that "Different engines optimize for different tasks" and provides the example of MySQL using InnoDB for transactional safety and MyISAM for faster reads, indicating engine choice is driven by workload optimization. Option D describes a logical database design function, not a storage engine's primary role.

    Read the full bite: Storage Engine: The Database's Filing System

  29. Question 29 of 30

    A business intelligence team needs to frequently run queries that calculate the average order value across all customers and product types. Which database storage organization would be most efficient for this task?

    Show the answer

    Answer: a · Column-oriented, as it allows the database to read only the necessary columns (e.g., order value, customer ID, product type) across many rows, reducing I/O.

    Column-oriented storage is designed for Online Analytical Processing (OLAP) tasks like calculating averages over many records, as it stores column data contiguously, allowing the system to read only the specific columns required, thus minimizing disk I/O. Row-oriented storage, while efficient for retrieving entire records, would be inefficient here because it would force the system to read all columns for every row, even if only a few are needed for the calculation.

    Read the full bite: Row vs. Columnar Storage: Organizing Data for Speed

  30. Question 30 of 30

    What is the primary reason database engines utilize fixed-size pages for data storage?

    Show the answer

    Answer: b · To optimize disk I/O by performing fewer, larger read and write operations.

    The card states that pages exist to "minimize the number of slow disk operations" by grouping data into "larger, more efficient chunks" for I/O. Option A is incorrect because the card explicitly mentions "the physical order of rows on a page is not guaranteed."

    Read the full bite: Database Pages: The Building Blocks of Your Data

Could you explain these out loud?

That is what an interview actually tests. Tezvyn gives you questions like these with what the interviewer is really checking, the answer that lands, and the mistake that ends the conversation, in the four minutes before your next meeting.

The iPhone app is on the way

We are building it. Until it lands, nothing here is held back from you: every interview card, your saved cards, streaks and the job board all work in Safari, plus hundreds of free practice quizzes of thirty questions each. Sign in and it all carries over to the app the day it arrives.

Want it as an icon? Tap Share at the bottom of Safari, then Add to Home Screen. It opens full screen and the cards you have read stay available offline.

Get it on Google PlayiPhone app coming soon