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
|
BorgHash
========
Memory-efficient hashtable implementations as a Python library implemented in Cython.
HashTable
---------
``HashTable`` is a fairly low-level implementation; usually one will want to use the ``HashTableNT`` wrapper. Read on for the basics...
Keys and Values
~~~~~~~~~~~~~~~
The keys MUST be perfectly random ``bytes`` of arbitrary but fixed length, like from a cryptographic hash (SHA-256, HMAC-SHA-256, ...).
The implementation relies on this "perfectly random" property and does not implement its own hash function; it just takes 32 bits from the given key.
The values are ``bytes`` of arbitrary but fixed length.
The lengths of the keys and values are defined when creating a ``HashTable`` instance; thereafter, the lengths must always match the defined size.
Implementation details
~~~~~~~~~~~~~~~~~~~~~~
To have little memory overhead overall, the hashtable only stores ``uint32_t``
indices into separate keys and values arrays (short: kv arrays).
A new key is appended to the keys array. The corresponding value is appended to the values array. After that, the key and value do not change their
index as long as they exist in the hashtable and the ht and kv arrays are in
memory. Even when kv pairs are deleted from ``HashTable``, the kv arrays never
shrink and the indices of other kv pairs don't change.
This is because we want to have stable array indices for the keys/values, so the
indices can be used outside of ``HashTable`` as memory-efficient references.
Memory allocated
~~~~~~~~~~~~~~~~
For a hashtable load factor of 0.1 – 0.5, a kv array growth factor of 1.3, and
N kv pairs, memory usage in bytes is approximately:
- Hashtable: from ``N * 4 / 0.5`` to ``N * 4 / 0.1``
- Keys/Values: from ``N * len(key + value) * 1.0`` to ``N * len(key + value) * 1.3``
- Overall: from ``N * (8 + len(key + value))`` to ``N * (40 + len(key + value) * 1.3)``
When the hashtable or the kv arrays are resized, there will be brief memory-usage spikes. For the kv arrays, ``realloc()`` is used to avoid copying data and to minimize memory-usage spikes, if possible.
HashTableNT
-----------
``HashTableNT`` is a convenience wrapper around ``HashTable``:
- Accepts and returns ``namedtuple`` values.
- Implements persistence: can read the hashtable from a file and write it to a file.
Keys and Values
~~~~~~~~~~~~~~~
Keys: ``bytes``, see ``HashTable``.
Values: any fixed ``namedtuple`` type that can be serialized to ``bytes``
by Python's ``struct`` module using a given format string.
When setting a value, it is automatically serialized. When a value is returned,
it will be a ``namedtuple`` of the given type.
Persistence
~~~~~~~~~~~
``HashTableNT`` has ``.write()`` and ``.read()`` methods to save/load its
contents to/from a file, using an efficient binary format.
When a ``HashTableNT`` is saved to disk, only the non-deleted entries are
persisted. When it is loaded from disk, a new hashtable and new, dense
kv arrays are built; thus, kv indices will be different!
API
---
HashTable / HashTableNT have an API similar to a dict:
- ``__setitem__`` / ``__getitem__`` / ``__delitem__`` / ``__contains__``
- ``get()``, ``pop()``, ``setdefault()``
- ``items()``, ``len()``
- ``read()``, ``write()``, ``size()``
Example code
------------
::
# HashTableNT mapping 256-bit key [bytes] --> Chunk value [namedtuple]
Chunk = namedtuple("Chunk", ["refcount", "size"])
ChunkFormat = namedtuple("ChunkFormat", ["refcount", "size"])
chunk_format = ChunkFormat(refcount="I", size="I")
# 256-bit (32-byte) key, 2x 32-bit (4-byte) values
ht = HashTableNT(key_size=32, value_type=Chunk, value_format=chunk_format)
key = b"x" * 32 # the key is usually from a cryptographic hash function
value = Chunk(refcount=1, size=42)
ht[key] = value
assert ht[key] == value
for key, value in ht.items():
assert isinstance(key, bytes)
assert isinstance(value, Chunk)
file = "dump.bin" # giving an fd of a file opened in binary mode also works
ht.write(file)
ht = HashTableNT.read(file)
Building / Installing
---------------------
::
python setup.py build_ext --inplace
python -m build
pip install dist/borghash*.tar.gz
Want a demo?
------------
Run ``borghash-demo`` after installing the ``borghash`` package.
It will show you the demo code, run it, and print the results for your machine.
Results on an Apple MacBook Pro (M3 Pro CPU) look like:
::
HashTableNT in-memory ops (count=50000): insert: 0.042s, lookup: 0.045s, pop: 0.043s.
HashTableNT serialization (count=50000): write: 0.014s, read: 0.010s.
State of this project
---------------------
**API is still unstable and expected to change as development continues.**
**As long as the API is unstable, there will be no data migration tools,
e.g., for reading an existing serialized hashtable.**
There might be missing features or optimization potential; feedback is welcome!
Borg?
-----
Please note that this code is currently **not** used by the stable release of
BorgBackup (aka "borg"), but it might be used by Borg's master branch in the future.
License
-------
BSD license.
|
