-
Notifications
You must be signed in to change notification settings - Fork 4
Expand file tree
/
Copy pathdb_model.py
More file actions
285 lines (230 loc) · 9.32 KB
/
Copy pathdb_model.py
File metadata and controls
285 lines (230 loc) · 9.32 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
from collections import defaultdict
import pickle # handle complex data types and tuples as dict keys
from typing import Dict, Set, Tuple
from pathlib import Path
from uuid import uuid4
import dbm # Python's built-in key/value store; replaces Berkeley DB
from messages import *
class DataObject:
def serialize(self):
return pickle.dumps(self.__dict__)
@classmethod
def deserialize(cls, pickled_data):
data = pickle.loads(pickled_data)
return cls(**data)
class Table(DataObject):
def __init__(
self,
table_name: str,
columns: Dict[str, str],
not_null_keys: Set[str],
primary_key: Tuple[str],
foreign_keys: Dict[str, Tuple[str, str]],
referenced_by: Set[str]=set(),
indexes: Dict[str, Dict]=None
):
self.table_name = table_name
self.columns = columns # key: column name, value: column referencing_type
self.not_null_keys = not_null_keys # set of column names
self.primary_key = primary_key # tuple of column names (order is important in this project)
self.foreign_keys = foreign_keys # key: referencing column name, value: tuple of (referenced table name, referenced column name)
self.referenced_by = referenced_by # set of table names that reference this table
self.indexes = indexes or {} # index_name -> {"column": str, "file": str}
def __str__(self):
info = "\n-----------------------------------------------------------------\n"
info += f"table_name [{self.table_name}]\n"
info += "{:<25}{:<15}{:<10}{:<10}\n".format("column_name", "type", "null", "key")
for column, column_type in self.columns.items():
null_str = 'N' if column in self.not_null_keys else 'Y'
key_str = ''
if self.primary_key and column in self.primary_key:
key_str = 'PRI'
if self.foreign_keys and column in self.foreign_keys:
key_str = 'FOR'
if self.primary_key and column in self.primary_key:
key_str = 'PRI/FOR'
info += "{:<25}{:<15}{:<10}{:<10}\n".format(column, column_type, null_str, key_str)
info += "-----------------------------------------------------------------"
return info
def __contains__(self, key: tuple):
return key in self.columns
def check_reference_primary_key(self, referenced_key: str):
return referenced_key in self.primary_key
def check_reference_type(self, referencing_type: str, referenced_key: str):
return self.columns[referenced_key] == referencing_type
def has_reference(self):
return self.referenced_by is not None and len(self.referenced_by) > 0
def get_referencing_tables(self):
if self.foreign_keys is None or len(self.foreign_keys) == 0:
return None
return [table for table, column in self.foreign_keys.values()]
def add_reference(self, table_name):
self.referenced_by.add(table_name)
def remove_reference(self, table_name):
self.referenced_by.remove(table_name)
@classmethod
def deserialize(cls, pickled_data):
data = pickle.loads(pickled_data)
data.setdefault("indexes", {})
return cls(**data)
'''
table = TableSchema(
table_name="employees",
column_names={
"id": "INTEGER",
"name": "VARCHAR(255)",
"age": "INTEGER",
"department": "VARCHAR(255)"
},
not_null_keys={"id", "name", "age"},
primary_key=("id",),
foreign_keys={
"department": ("departments", "department")
}
)
'''
class Record(DataObject):
def __init__(
self,
table_name: str,
data: Dict,
primary_value: Tuple,
referencing: Dict[Tuple, Set],
referenced_by=defaultdict(set)
):
self.table_name = table_name
self.data = data
self.primary_value = primary_value
self.referencing = referencing # {(referenced table_name, referenced column): {referenced value...}}
self.referenced_by = referenced_by # {(referencing table_name, referencing column): {referencing value...}}
def add_to_referenced_by(self, referencing_table, referencing_column, referencing_value):
self.referenced_by[(referencing_table, referencing_column)].add(referencing_value)
def remove_referenced_by(self, referencing_table, referencing_column, referencing_value):
self.referenced_by[(referencing_table, referencing_column)].remove(referencing_value)
if len(self.referenced_by[(referencing_table, referencing_column)]) == 0:
del self.referenced_by[(referencing_table, referencing_column)]
'''
row = TableRow(
table_name="employees",
data={
"id": 1,
"name": "John Doe",
"age": 30,
"department": "HR"
},
primary_value=(1,)
)
'''
class Cursor:
"""Iterates a dbm store and supports delete-at-position.
Berkeley DB handed back a native cursor; dbm has no cursor concept, so we
snapshot the keys at creation time and walk them. Snapshotting also makes it
safe to delete the current record while iterating (which delete()/select()
rely on) without disturbing the walk.
"""
def __init__(self, store):
self._store = store
self._keys = list(store.keys())
self._index = -1
self._current_key = None
def first(self):
self._index = 0
return self._read()
def next(self):
self._index += 1
return self._read()
def _read(self):
# Skip over keys that were deleted since the snapshot was taken.
while self._index < len(self._keys):
key = self._keys[self._index]
if key in self._store:
self._current_key = key
return key, self._store[key]
self._index += 1
self._current_key = None
return None
def delete(self):
if self._current_key is not None and self._current_key in self._store:
del self._store[self._current_key]
def close(self):
pass
class DB:
"""One database, One table"""
def __init__(self, db_name: str):
self.db_dir = Path("./DB")
self.db_dir.mkdir(exist_ok=True)
self.db_name = db_name
self.db_file = self.db_dir / (self.db_name + ".db")
self.DB = None
def open_db(self):
# gdbm (the typical Linux/Docker backend) takes an EXCLUSIVE lock on the
# file and refuses to open a handle that is already open, raising
# "[Errno 11] Resource temporarily unavailable". Error paths in dbms.py
# can raise between open_db() and close_db(), leaking an open handle on a
# long-lived DB object (notably the shared MetaDB); releasing any stale
# handle here keeps a subsequent statement from crashing on re-open.
# (Berkeley DB and macOS's ndbm tolerated double-opens; gdbm does not.)
self.close_db()
# 'c' opens the store for read/write, creating it if it does not exist.
self.DB = dbm.open(str(self.db_file), "c")
def close_db(self):
if self.DB is not None:
self.DB.close()
self.DB = None
def create_cursor(self):
return Cursor(self.DB)
def discard_cursor(self, cursor):
cursor.close()
def get_dbname(self):
return self.db_name
def create_key_from_value(self, primary_tuple: tuple): # if has primary key
return str(primary_tuple).encode()
def create_random_key(self): # if no primary key
return uuid4().bytes
def exists(self, key):
return key in self.DB
def get(self, key):
if key not in self.DB:
return None
dataobj = self.DB[key]
if not dataobj:
return None
return Record.deserialize(dataobj)
def put(self, key, dataobj):
self.DB[key] = dataobj.serialize()
def delete(self, key):
if key in self.DB:
del self.DB[key]
def remove_files(self):
"""Delete every on-disk file backing this store.
dbm's filename scheme is backend-specific: gdbm (typical on Linux) writes
a single file at the exact path, ndbm (macOS) appends another ".db", and
dumb (the only backend on Windows) writes ".dir"/".dat"/".bak" siblings.
Globbing the base name removes the store on every platform instead of
assuming gdbm's single-file layout.
"""
for path in self.db_dir.glob(self.db_file.name + "*"):
path.unlink()
def delete_by_cursor(self, cursor):
cursor.delete()
def keys(self):
return list(self.DB.keys())
def values(self):
return [self.DB[key] for key in self.DB.keys()]
def items(self):
return [(key, self.DB[key]) for key in self.DB.keys()]
def define_meta(self, meta):
self.meta = meta
class MetaDB(DB):
"""Metadata DB containing table schemas"""
def __init__(self, db_name="table"): # identifier
super().__init__(db_name)
def get(self, key):
if key not in self.DB:
return None
value = self.DB[key]
if not value:
return None
return Table.deserialize(value)
def create_key_from_value(self, table_name):
return table_name.encode()