File tree Expand file tree Collapse file tree 1 file changed +8
-2
lines changed Expand file tree Collapse file tree 1 file changed +8
-2
lines changed Original file line number Diff line number Diff line change @@ -15,11 +15,17 @@ What does this do?
15
15
16
16
It is a library to compress and uncompress arrays of integers
17
17
very fast. The assumption is that most (but not all) values in
18
- your array use less than 32 bits. These sort of arrays often come up
18
+ your array use much less than 32 bits, or that the gaps between
19
+ the integers use much less than 32 bits. These sort of arrays often come up
19
20
when using differential coding in databases and information
20
21
retrieval (e.g., in inverted indexes or column stores).
21
22
22
- It can decompress integers at a rate of over 1.2 billions per second
23
+ Please note that random integers are not compressible, by this
24
+ library or by any other means. If you ever had the means of
25
+ systematically compressing random integers, you could compress
26
+ any data source to nothing, by recursive application of your technique.
27
+
28
+ This library can decompress integers at a rate of over 1.2 billions per second
23
29
(4.5 GB/s). It is significantly faster than generic codecs (such
24
30
as Snappy, LZ4 and so on) when compressing arrays of integers.
25
31
You can’t perform that action at this time.
0 commit comments