An efficient compression code for text databases
From MaRDI portal
Recommendations
Cited in
(17)- Construction of efficient literal codes for vocabulary methods of data compression
- ODC: frame for definition of dense codes
- An efficient variable-to-fixed length encoding using multiplexed parse trees
- Compressed matching for feature vectors
- scientific article; zbMATH DE number 5806042 (Why is no real title available?)
- Improving semistatic compression via pair-based coding
- Compression algorithm of text files based on LZSS
- New word-based adaptive dense compressors
- Compressing semistructured text databases
- scientific article; zbMATH DE number 1432383 (Why is no real title available?)
- Practical fixed length Lempel-Ziv coding
- SEMI-LOSSLESS TEXT COMPRESSION
- \((s,c)\)-dense coding: an optimized compression code for natural language text databases.
- Text and hypertext compression
- Natural-Language Text Compression Using Reverse Multi-Delimiter Codes
- Huffman coding with non-sorted frequencies
- A general compression algorithm that supports fast searching
This page was built for publication: An efficient compression code for text databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4424240)