Comments (1)
For the DICT scheme, we'll need to choose between uniformity and flexibility.
In the uniform extreme of the spectrum, we'll have:
- Fixed size dictionaries
- Fixed element size per dictionary
- An actual new dictionary copied in for every segment of the compressed data (even if it's very similar to the previous segment's dictionary)
And in the flexible extreme (or close to it) we'll have:
- A variable-length, and variable-width, array of dictionary entry data
- For each segment, a dictionary descriptor:
- An indication of where the dictionary begins in the variable-length dictionary data
- The dictionary's length (number of entries)
- (Possibly) The dictionary index size in bytes or in bits; this could theoretically be deduced from the dictionary's length - but that depends too much, perhaps, on the decompressing software's capabilities
... and note that a segment might simply refer to the same dictionary as its predecessor; or we might even allow it to expand its predecessor's dictionary by starting at the same place and extend further.
I'm leaning toward the more flexible extreme.
from libgiddy.
Related Issues (17)
- Reduce dependencies on on general-purpose C++ code requiring linking HOT 1
- Support sub-byte-resolution indices into dictionaries
- Performance is generally weak for short inputs
- Use more uniform terminology for decompression schemes & kernels
- Make Delta decompression great^H^H^H^H^H typed again
- Support (byte-resolution-size) dictionary indices of arbitrary sizes
- Provide C-language bindings for the kernel wrappers and the factory.
- identify supported build environment HOT 1
- Add an example program using the library HOT 1
- Add code for host-side compression and decompression
- Lackluster performance of the Incidence Bitmaps decompressor
- Support bit-resolution sizes for all relevant compression schemes
- Consider optimizing IncidenceBitmaps dictionary accesses for very small dictionaries
- Support changing dictionaries for the Dictionary compression scheme HOT 1
- Consider using dynamic parallelism in decompressing variable-run-length data
- Implement compression primitives for runtime-specified-length data
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.
from libgiddy.