-
Notifications
You must be signed in to change notification settings - Fork 10
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Implement function to do a full repack #12
Comments
This becomes even more important with the hashkey implementation, because it can often happen (at least in the very first implementation I wrote in #26) that one tries to write directly to pack an already existing object, and this leaves regions in the file that are unaccounted for. This should probably be merged with #13 - during full repack, it would make much sense also to first validate everything. |
For reference, a simple preliminary script to check the regions in the pack that are unaccounted for (just raising for overlaps, for now) import os
from disk_objectstore import Container
from disk_objectstore.models import Obj
def get_known_size(container, pack_id): # Size ON DISK
from sqlalchemy import func
session = container._get_cached_session()
query = session.query(func.sum(Obj.length).label('total_size')).group_by(Obj.pack_id).filter(Obj.pack_id == pack_id)
return query.all()[0][0], os.path.getsize(container._get_pack_path_from_pack_id(pack_id))
def check_pack_holes(container, pack_id):
session = container._get_cached_session()
known_locations = session.query(Obj).filter(Obj.pack_id==pack_id, Obj.length != 0).with_entities(Obj.offset, Obj.length).order_by(Obj.offset).all()
#print('start known loc', known_locations[:10])
#print('end known loc', known_locations[-10:])
unaccounted_ranges = []
current_pos = 0
for offset, length in known_locations:
if offset < current_pos:
raise ValueError("Overlap! {} vs {}".format(offset, current_pos))
if offset > current_pos:
unaccounted_ranges.append((current_pos, offset))
current_pos = offset + length
# Final object:
total_pack_size = os.path.getsize(container._get_pack_path_from_pack_id(pack_id))
if current_pos != total_pack_size:
unaccounted_ranges.append((current_pos, total_pack_size))
return unaccounted_ranges
if __name__ == "__main__":
container = Container('/tmp/test-container')
unaccounted_ranges = check_pack_holes(container, 0)
known_size, file_size = get_known_size(container, 0)
unaccounted_size = sum(_[1] - _[0] for _ in unaccounted_ranges)
#print('start unaccounted ranges', unaccounted_ranges[:10])
#print('end unaccounted ranges', unaccounted_ranges[-10:])
print("{} unaccounted ranges of a total of {} bytes (~ {} MB)".format(len(unaccounted_ranges),
unaccounted_size, unaccounted_size // 1024 // 1024))
print("Pack file size: {} (~{} MB), known occupied size: {}, difference (should be the same as above): {} (~{} MB)".format(
file_size, file_size // 1024 // 1204, known_size, file_size - known_size, (file_size - known_size) // 1024 // 1024))
print("OK they are the same!" if unaccounted_size == file_size - known_size else "ERROR they are different!") |
Note: with #85 fixed, this is less urgent, but still important
|
Note also that it would be ideal to
However, the issue is that the last steps are not obvious to be done in a way that does not risk to loose data if something unexpected happens in between, and that we can easily recover in case of problems (we always have a moment in time in which we have both the old and the new pack file, and it's not clear to which of the two the DB is pointing to) |
Please check performance notes in #92 where there are also scripts that I wrote to check performance and essentially they are very fast and essentially already implement the core part of the work to repack in a quite efficient way. |
Important: Also call |
Addresses aiidateam#12 This is already quite safe to be called, but I didn't cover all corner cases also related to power loss etc.
Notes on the performance of the implementation of 53ad44c(TL;DR: it's very good). I tried to do a repack of a single pack (number Here is the time (note that the DB was already in the OS disk cache):
So less that 2 minutes. The time to create the new pack is very fast, some time is required to update the DB, but it seems to be more than reasonable. Notes on
|
This merge collects a number of important efficiency improvements, and a few features that were tightly bound to these efficiency changes, so they are shipped together. In particular: - objects are now sorted and returned in the order in which they are on disk, with an important performance benefit. Fixes #92 - When there are many objects to list (currently set to 9500 objects, 10x the ones we could fit in a single IN SQL statement), performing many queries is slow, so we just resort to listing all objects and doing an efficient intersection (if the hash keys are sorted, both iterators can be looped over only once - fixes #93) - Since VACUUMing the DB is very important for efficiency, when the DB does not fit fully in the disk cache, `clean_storage` now provides an option to VACUUM the DB. VACUUM is also called after repacking. Fixes #94 - We implement now a function to perform a full repack of the repository (fixes #12). This is important and needed to reclaim space after deleting an object - For efficiency, we have moved the logic from an `export` function (still existing but deprecated) to a `import_objects` function - Still for efficiency, now functions like `pack_all_loose` and `import_objects` provide an option to perform a fsync to disk or not (see also #54 - there are still however calls that always use - or don't use - fsync and full_fsync on Mac). Also, `add_objects_to_pack` allows now to choose if you want to commit the changes to the SQLite DB, or not (delegating the responsibility to the caller, but this is important e.g. in `import_objects`: calling `commit` only once at the very end gives a factor of 2 speedup for very big repos). - A number of functions, including (but not exclusively) `import_objects` provide a callback to e.g. show a progress bar. - a `CallbackStreamWrapper` has been implemented, allowing to provide a callback (e.g. for a progress bar) when streaming a big file. - a new hash algorithm is now supported (`sha1`) in addition to the default `sha256` (fixes #82). This is faster even if a bit less robust. This was also needed to test completely some feature in `import_objects`, where the logic is optimised if both containers use the same algorithm. By default is still better to use everywhere sha256, also because then all export files that will be generated will use this algorithm and importing will be more efficient. - tests have been added for all new functionality, achieving again 100% coverage As a reference, with these changes, exporting the full large SDB database (6.8M nodes) takes ~ 50 minutes: ``` 6714808it [00:24, 274813.02it/s] All hashkeys listed in 24.444787740707397s. Listing objects: 100%|████████| 6714808/6714808 [00:06<00:00, 978896.65it/s] Copy objects: 100%|███████████| 6714808/6714808 [48:15<00:00, 2319.08it/s] Final flush: 100%|████████████| 63236/63236 [00:07<00:00, 8582.35it/s] Everything re-exported in 2960.980943918228s. ``` This can be compared to: - ~10 minutes to copy the whole 90GB, or ~15 minutes to read all and validate the packs. We will never be able to be faster than just copying the pack files, and we are only 3x slower. - ~2 days to just list all files in the old legacy AiiDA repo (or all objects if they are loose), and this does not take into account the time to rewrite everything, probably comparable. So we are almost 2 orders of magnitude faster than before.
This would recreate each pack only with the known objects (e.g. if something was deleted, see also #5)
The text was updated successfully, but these errors were encountered: