How to Install and Uninstall bitshuffle Package on Ubuntu 21.04 (Hirsute Hippo)

Last updated: May 15,2024

1. Install "bitshuffle" package

This guide let you learn how to install bitshuffle on Ubuntu 21.04 (Hirsute Hippo)

$ sudo apt update $ sudo apt install bitshuffle

2. Uninstall "bitshuffle" package

This tutorial shows how to uninstall bitshuffle on Ubuntu 21.04 (Hirsute Hippo):

$ sudo apt remove bitshuffle $ sudo apt autoclean && sudo apt autoremove

3. Information about the bitshuffle package on Ubuntu 21.04 (Hirsute Hippo)

Package: bitshuffle
Architecture: amd64
Version: 0.3.5-3.1build2
Priority: optional
Section: universe/libs
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Thorsten Alteholz
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 757
Depends: libc6 (>= 2.14), libgomp1 (>= 6), libhdf5-openmpi-103-1 (>= 1.8.13), cython3, python3 (<< 3.10), python3 (>= 3.9~), python3-h5py-serial, python3-numpy, python3-pkg-resources, python3:any
Filename: pool/universe/b/bitshuffle/bitshuffle_0.3.5-3.1build2_amd64.deb
Size: 181876
MD5sum: 3ec58bc5c8e0ebf95cf5857f16993a56
SHA1: 8c70d9ac505ecf076988dc60408a66f3143edc1e
SHA256: b92b5b19ff296aebf7ec626bd8325d4fd79b8e2ff71d73828ed146c8b8c112c1
SHA512: 4d6a4ae07657c20409906d6409c51cbd11671f7d02f2aa960b9ad541f70cd0ff84162b08abed54b212f53305565eb096cc5df40cdf4a3e58c998c546fd0790f5
Homepage: https://github.com/kiyo-masui/bitshuffle
Description-en: filter for improving compression of typed binary data
Bitshuffle is an algorithm that rearranges typed, binary data for
improving compression, as well as a python/C package that implements
this algorithm within the Numpy framework.
.
The library can be used along side HDF5 to compress and decompress
datasets and is integrated through the dynamically loaded filters
framework. Bitshuffle is HDF5 filter number 32008.
.
Algorithmically, Bitshuffle is closely related to HDF5's Shuffle
filter except it operates at the bit level instead of the byte level.
Arranging a typed data array in to a matrix with the elements as the
rows and the bits within the elements as the columns, Bitshuffle
"transposes" the matrix, such that all the least-significant-bits
are in a row, etc. This transpose is performed within blocks of
data roughly 8kB long.
.
This does not in itself compress data, only rearranges it for more
efficient compression. To perform the actual compression you will
need a compression library. Bitshuffle has been designed to be well
matched Marc Lehmann's LZF as well as LZ4. Note that because
Bitshuffle modifies the data at the bit level, sophisticated entropy
reducing compression libraries such as GZIP and BZIP are unlikely to
achieve significantly better compression than simpler and faster
duplicate-string-elimination algorithms such as LZF and LZ4.
Bitshuffle thus includes routines (and HDF5 filter options) to apply
LZ4 compression to each block after shuffling.
.
The Bitshuffle algorithm relies on neighbouring elements of a dataset
being highly correlated to improve data compression. Any correlations
that span at least 24 elements of the dataset may be exploited to
improve compression.
Description-md5: cd2f1aef4b1fdac0de3b63a646625903