|
51
|
1 # Question: In-Memory Key-Value Store with Nested Transactions
|
|
|
2 #
|
|
|
3 # Design an in-memory key-value database that supports the following commands and fully handles nested transactions.
|
|
|
4 # Core Operations:
|
|
|
5
|
|
|
6 # SET <key> <value>: Sets the value for a key.
|
|
|
7
|
|
|
8 # GET <key>: Returns the value for a key.
|
|
|
9
|
|
|
10 # UNSET <key>: Removes the key and its value.
|
|
|
11 #
|
|
|
12 # Transaction Operations:
|
|
|
13
|
|
|
14 # BEGIN: Starts a new transaction scope. If a transaction is already active, this starts a nested transaction.
|
|
|
15
|
|
|
16 # COMMIT: Applies all changes made in the current transaction scope and all its active nested transactions to the parent scope (or to the main database state if no parent exists). After a successful commit, the transaction scope is closed.
|
|
|
17
|
|
|
18 # ROLLBACK: Discards all changes made in the current transaction scope and all its active nested transactions, restoring the state to what it was when the BEGIN command was issued for the current scope. After a successful rollback, the transaction scope is closed.
|
|
|
19
|
|
|
20 # Implementation Goal:
|
|
|
21 # Design the primary data structures and outline the logic for SET, COMMIT, and ROLLBACK to ensure nested transactions operate correctly. Explain how the state of the database is managed across multiple transaction layers.
|
|
|
22
|
|
|
23
|
|
|
24 class Database:
|
|
|
25 def __init__(self):
|
|
|
26 self.global_db = {}
|
|
|
27 self.queue = []
|
|
|
28
|
|
|
29 def commit(self):
|
|
|
30 copy_db = self.queue.pop()
|
|
|
31 if self.queue:
|
|
|
32 self.queue[-1].merge(copy_db)
|
|
|
33 else:
|
|
|
34 self.global_db |= copy_db
|
|
|
35
|
|
|
36 def set(self, key, value):
|
|
|
37 if self.queue:
|
|
|
38 curr_db = self.queue[-1]
|
|
|
39 curr_db[key] = value
|
|
|
40 else:
|
|
|
41 self.global_db[key] = value
|
|
|
42
|
|
|
43 def get(self, key):
|
|
|
44 if self.queue:
|
|
|
45 for copy_db in reversed(self.queue):
|
|
|
46 if key in copy_db:
|
|
|
47 return copy_db[key]
|
|
|
48
|
|
|
49 return self.global_db[key]
|
|
|
50
|
|
|
51 def unset(self, key):
|
|
|
52 if self.queue:
|
|
|
53 curr_db = self.queue[-1]
|
|
|
54 del curr_db[key]
|
|
|
55 else:
|
|
|
56 del self.global_db[key]
|
|
|
57
|
