Summary AI-generated
- TL;DR
- Sliding window Lempel-Ziv 77 algorithms rely on repeated substring searches for universal lossless data compression, which traditionally requires balancing search speed and memory usage.
- Problem
- Traditional data structures like hash tables and trees enable fast searches for the LZ77 encoding component, but they come at the expense of high memory usage.
- Method
- Suffix arrays are used for dictionary representation and LZ77 decomposition to improve efficiency.
- Results
- Not specified in the abstract.
- Contributions
- Not specified in the abstract.
- Limitations
- Not specified in the abstract.
- Takeaways
- Suffix arrays offer a way to handle dictionary representation and LZ77 decomposition while using less memory than traditional data structures like hash tables and trees.
- Applications
- Universal lossless data compression.
- Topics
- Sliding Window Update Using Suffix Arrays
- For industry
- Not specified in the abstract.
- Why it matters
- Not specified in the abstract.
Abstract
The sliding window (SW) Lempel-Ziv (LZ) 77 algorithms are widely used for universal lossless data compression. The LZ77 encoding component performs repeated substring search. Data structures, such as hash tables and trees have been used for fast search, at the expense of memory usage. Recently, suffix arrays (SA) have been used for dictionary representation and LZ77 decomposition, using less memory than those data structures.