Design a versioned key-value store

Q: Design a versioned key-value store

This question evaluates proficiency in designing time-versioned key-value stores, focusing on appropriate data structures, temporal query semantics, API design, and time/space complexity analysis within the Coding & Algorithms domain.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Design and implement a versioned key-value store that supports set(key, value, timestamp) and get(key, timestamp) to retrieve the most recent value at or before timestamp. Discuss data structures, time/space complexity, and how to handle out-of-order timestamps, large timestamp ranges, and memory limits. Extend the API to support delete, range queries by time, and background compaction.

Design a versioned key-value store

Overview

Comments (0)