Database Streaming Compression on Memory-Limited Machines
Dynamic Huffman compression algorithms operate on data-streams with a bounded symbol list. With these algorithms, the complete list of symbols must be contained in main memory or secondary storage. A horizontal format transaction database that is streaming can have a very large item list. Many nodes...
Main Author: | Bruccoleri, Damon F. |
---|---|
Format: | Others |
Published: |
NSUWorks
2018
|
Subjects: | |
Online Access: | https://nsuworks.nova.edu/gscis_etd/1031 https://nsuworks.nova.edu/cgi/viewcontent.cgi?article=2032&context=gscis_etd |
Similar Items
-
An Efficient and Fast VLIW Compression Scheme for Stream Processor
by: Gongli Li, et al.
Published: (2020-01-01) -
A Lossless Compression Method for Chat Messages Based on Huffman Coding and Dynamic Programming
by: Julián Moreno Cadavid, et al.
Published: (2021-03-01) -
Compression guidée par automate et noyaux rationnels
by: Amarni, Ahmed
Published: (2015) -
Compression guidée par automate et noyaux rationnels
by: Amarni, Ahmed
Published: (2015) -
Lossless Data Compression for Communication Systems Based on Optical Frequency Discriminator
by: Guangjun Shan
Published: (2019-01-01)