oxirs-tdb 0.3.1

Apache Jena TDB/TDB2 compatible RDF storage engine with B+Tree indexes
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
//! Brotli compression algorithm implementation
//!
//! Brotli is a compression algorithm developed by Google that provides:
//! - Excellent compression ratios (often 20-25% better than gzip)
//! - Good decompression speed
//! - Tunable compression levels (0-11)
//! - Built-in dictionary support
//!
//! # Performance Characteristics
//!
//! - Compression speed: 10-100 MB/s (level dependent)
//! - Decompression speed: 200-400 MB/s
//! - Compression ratio: 3-5x on typical data
//!
//! # Use Cases
//!
//! - Web content compression (HTTP/2, HTTP/3)
//! - Archival storage requiring maximum compression
//! - Network transmission where bandwidth is expensive
//! - RDF data storage with emphasis on space efficiency

use super::{
    AdvancedCompressionType, CompressedData, CompressionAlgorithm, CompressionMetadata,
    MAX_COMPRESSION_INPUT_SIZE,
};
use anyhow::{bail, Result};
use std::collections::HashMap;
use std::time::Instant;

/// Brotli compression algorithm
///
/// Uses the oxiarc-brotli crate for high-quality compression with excellent ratios.
#[derive(Debug, Clone)]
pub struct BrotliCompressor {
    /// Compression level (0-11, higher = better compression but slower)
    level: u32,
    /// Window size (10-24, higher = better compression but more memory)
    window_size: u32,
}

impl BrotliCompressor {
    /// Create a new Brotli compressor with default settings (level 6, window 22)
    pub fn new() -> Self {
        Self {
            level: 6,
            window_size: 22,
        }
    }

    /// Create a new Brotli compressor with specified compression level
    ///
    /// # Arguments
    ///
    /// * `level` - Compression level (0-11). Recommended ranges:
    ///   - 0-3: Fast compression, lower ratios
    ///   - 4-6: Balanced compression (recommended)
    ///   - 7-9: High compression, slower
    ///   - 10-11: Maximum compression, very slow
    pub fn with_level(level: u32) -> Self {
        Self {
            level: level.min(11),
            window_size: 22,
        }
    }

    /// Create a Brotli compressor with custom level and window size
    ///
    /// # Arguments
    ///
    /// * `level` - Compression level (0-11)
    /// * `window_size` - Window size (10-24). Larger windows improve compression
    ///   but require more memory during compression and decompression
    pub fn with_level_and_window(level: u32, window_size: u32) -> Self {
        Self {
            level: level.min(11),
            window_size: window_size.clamp(10, 24),
        }
    }

    /// Create a fast compression instance (level 1)
    pub fn fast() -> Self {
        Self::with_level(1)
    }

    /// Create a balanced compression instance (level 6)
    pub fn balanced() -> Self {
        Self::with_level(6)
    }

    /// Create a high compression instance (level 9)
    pub fn high() -> Self {
        Self::with_level(9)
    }

    /// Create a maximum compression instance (level 11)
    pub fn max() -> Self {
        Self::with_level(11)
    }
}

impl Default for BrotliCompressor {
    fn default() -> Self {
        Self::new()
    }
}

impl CompressionAlgorithm for BrotliCompressor {
    fn compress(&self, data: &[u8]) -> Result<CompressedData> {
        if data.is_empty() {
            return Ok(CompressedData {
                data: Vec::new(),
                metadata: CompressionMetadata {
                    algorithm: AdvancedCompressionType::Adaptive, // Will add Brotli type
                    original_size: 0,
                    compressed_size: 0,
                    compression_time_us: 0,
                    metadata: HashMap::new(),
                },
            });
        }

        if data.len() > MAX_COMPRESSION_INPUT_SIZE {
            bail!(
                "Input data too large: {} bytes (max: {})",
                data.len(),
                MAX_COMPRESSION_INPUT_SIZE
            );
        }

        let start = Instant::now();

        // Compress using brotli (oxiarc-brotli, Pure Rust). The on-disk payload is a
        // standard Brotli stream; `quality`/`lgwin` mirror the previous level/window_size.
        let params = oxiarc_brotli::BrotliParams {
            quality: self.level,
            lgwin: self.window_size,
            ..Default::default()
        };
        let compressed = oxiarc_brotli::compress_with_params(data, &params)
            .map_err(|e| anyhow::anyhow!("Brotli compression failed: {}", e))?;

        let compression_time = start.elapsed();

        let mut metadata_map = HashMap::new();
        metadata_map.insert("level".to_string(), self.level.to_string());
        metadata_map.insert("window_size".to_string(), self.window_size.to_string());
        metadata_map.insert(
            "compression_ratio".to_string(),
            format!("{:.2}", compressed.len() as f64 / data.len() as f64),
        );

        let compressed_size = compressed.len() as u64;

        Ok(CompressedData {
            data: compressed,
            metadata: CompressionMetadata {
                algorithm: AdvancedCompressionType::Adaptive, // Will add Brotli type
                original_size: data.len() as u64,
                compressed_size,
                compression_time_us: compression_time.as_micros() as u64,
                metadata: metadata_map,
            },
        })
    }

    fn decompress(&self, compressed: &CompressedData) -> Result<Vec<u8>> {
        if compressed.data.is_empty() {
            return Ok(Vec::new());
        }

        let start = Instant::now();

        // Decompress the standard Brotli stream (oxiarc-brotli, Pure Rust).
        let decompressed = oxiarc_brotli::decompress(&compressed.data)
            .map_err(|e| anyhow::anyhow!("Brotli decompression failed: {}", e))?;

        let decompression_time = start.elapsed();

        // Verify decompressed size matches metadata
        if decompressed.len() != compressed.metadata.original_size as usize {
            bail!(
                "Decompressed size mismatch: expected {}, got {}",
                compressed.metadata.original_size,
                decompressed.len()
            );
        }

        log::trace!(
            "Brotli decompression: {} bytes -> {} bytes in {:?}",
            compressed.data.len(),
            decompressed.len(),
            decompression_time
        );

        Ok(decompressed)
    }

    fn algorithm_type(&self) -> AdvancedCompressionType {
        AdvancedCompressionType::Adaptive // Will add Brotli type
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_brotli_compress_empty() {
        let compressor = BrotliCompressor::new();
        let result = compressor.compress(&[]).unwrap();
        assert_eq!(result.data.len(), 0);
        assert_eq!(result.metadata.original_size, 0);
        assert_eq!(result.metadata.compressed_size, 0);
    }

    #[test]
    fn test_brotli_compress_decompress() {
        let compressor = BrotliCompressor::new();
        let original = b"Hello, World! This is a test of Brotli compression. ".repeat(100);

        let compressed = compressor.compress(&original).unwrap();
        assert!(compressed.data.len() < original.len());
        assert_eq!(compressed.metadata.original_size, original.len() as u64);

        let decompressed = compressor.decompress(&compressed).unwrap();
        assert_eq!(decompressed, original);
    }

    #[test]
    fn test_brotli_format_fidelity() {
        // The on-disk payload is a standard Brotli stream decodable directly by the
        // low-level oxiarc-brotli decoder, and a blob produced directly by oxiarc
        // must decode via the compressor — proving a clean, tag-free Brotli format.
        let compressor = BrotliCompressor::new();
        let original = b"oxiarc brotli fidelity check ".repeat(50);

        let compressed = compressor.compress(&original).unwrap();
        let decoded = oxiarc_brotli::decompress(&compressed.data).unwrap();
        assert_eq!(decoded, original);

        // A blob produced directly by oxiarc must decode via the compressor.
        let cd = CompressedData {
            data: oxiarc_brotli::compress(&original, 6).unwrap(),
            metadata: CompressionMetadata {
                algorithm: AdvancedCompressionType::Adaptive,
                original_size: original.len() as u64,
                compressed_size: 0,
                compression_time_us: 0,
                metadata: HashMap::new(),
            },
        };
        assert_eq!(compressor.decompress(&cd).unwrap(), original);
    }

    #[test]
    fn test_brotli_incompressible_roundtrip_real_brotli() {
        // Random/incompressible data must round-trip losslessly through real Brotli
        // (no stored fallback, no format tag). This proves the historic oxiarc-brotli
        // incompressible-input workaround is no longer needed.
        use scirs2_core::random::rng;
        use scirs2_core::RngExt;
        let mut r = rng();
        let original: Vec<u8> = (0..2000).map(|_| r.random_range(0..256) as u8).collect();

        let compressor = BrotliCompressor::new();
        let compressed = compressor.compress(&original).unwrap();
        // The payload is a standard Brotli stream: it must decode via the low-level
        // decoder directly, with no tag byte stripped.
        assert_eq!(
            oxiarc_brotli::decompress(&compressed.data).unwrap(),
            original
        );
        // And via the high-level compressor API.
        let decompressed = compressor.decompress(&compressed).unwrap();
        assert_eq!(decompressed, original);
    }

    #[test]
    fn test_brotli_compression_levels() {
        let data = b"The quick brown fox jumps over the lazy dog. ".repeat(50);

        let fast = BrotliCompressor::fast();
        let balanced = BrotliCompressor::balanced();
        let high = BrotliCompressor::high();

        let fast_result = fast.compress(&data).unwrap();
        let balanced_result = balanced.compress(&data).unwrap();
        let high_result = high.compress(&data).unwrap();

        // All should decompress to the same data
        assert_eq!(fast.decompress(&fast_result).unwrap(), data);
        assert_eq!(balanced.decompress(&balanced_result).unwrap(), data);
        assert_eq!(high.decompress(&high_result).unwrap(), data);

        // Higher compression levels should produce smaller or equal output
        println!("Fast (1): {} bytes", fast_result.data.len());
        println!("Balanced (6): {} bytes", balanced_result.data.len());
        println!("High (9): {} bytes", high_result.data.len());

        // Verify compression improves with higher levels
        assert!(balanced_result.data.len() <= fast_result.data.len());
        assert!(high_result.data.len() <= balanced_result.data.len());
    }

    #[test]
    fn test_brotli_window_sizes() {
        let data = b"Testing window size effects on compression. ".repeat(100);

        let small_window = BrotliCompressor::with_level_and_window(6, 16);
        let large_window = BrotliCompressor::with_level_and_window(6, 24);

        let small_result = small_window.compress(&data).unwrap();
        let large_result = large_window.compress(&data).unwrap();

        // Both should decompress correctly
        assert_eq!(small_window.decompress(&small_result).unwrap(), data);
        assert_eq!(large_window.decompress(&large_result).unwrap(), data);

        println!("Window 16: {} bytes", small_result.data.len());
        println!("Window 24: {} bytes", large_result.data.len());
    }

    #[test]
    fn test_brotli_highly_compressible_data() {
        let compressor = BrotliCompressor::new();
        let data = vec![b'A'; 10000]; // Highly repetitive data

        let compressed = compressor.compress(&data).unwrap();
        let decompressed = compressor.decompress(&compressed).unwrap();

        assert_eq!(decompressed, data);
        // Should achieve strong compression on repetitive data. oxiarc-brotli at the
        // default quality compresses 10 KB of a single repeated byte to a few hundred
        // bytes (>10x).
        assert!(compressed.data.len() < data.len() / 10);
        println!(
            "Brotli highly compressible: {} -> {} bytes ({:.2}x)",
            data.len(),
            compressed.data.len(),
            data.len() as f64 / compressed.data.len() as f64
        );
    }

    #[test]
    fn test_brotli_incompressible_data() {
        let compressor = BrotliCompressor::new();
        // Use scirs2_core::random for random data generation
        use scirs2_core::random::rng;
        use scirs2_core::RngExt;

        let mut rng = rng();
        let data: Vec<u8> = (0..1000).map(|_| rng.random_range(0..256) as u8).collect();

        let compressed = compressor.compress(&data).unwrap();
        let decompressed = compressor.decompress(&compressed).unwrap();

        assert_eq!(decompressed, data);
        // Random data should not compress well
        println!(
            "Brotli incompressible: {} -> {} bytes",
            data.len(),
            compressed.data.len()
        );
    }

    #[test]
    fn test_brotli_too_large_input() {
        let compressor = BrotliCompressor::new();
        let data = vec![0u8; MAX_COMPRESSION_INPUT_SIZE + 1];

        let result = compressor.compress(&data);
        assert!(result.is_err());
    }

    #[test]
    fn test_brotli_metadata() {
        let compressor = BrotliCompressor::with_level_and_window(9, 20);
        let data = b"Testing metadata collection with Brotli".repeat(10);

        let compressed = compressor.compress(&data).unwrap();

        assert_eq!(compressed.metadata.metadata.get("level").unwrap(), "9");
        assert_eq!(
            compressed.metadata.metadata.get("window_size").unwrap(),
            "20"
        );
        assert!(compressed
            .metadata
            .metadata
            .contains_key("compression_ratio"));
        assert!(compressed.metadata.compression_time_us > 0);
    }

    #[test]
    fn test_brotli_rdf_data_compression() {
        let compressor = BrotliCompressor::balanced();
        // Simulate RDF triple data with typical patterns
        let rdf_data = b"<http://example.org/resource/1> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://example.org/Class> .\n"
            .repeat(100);

        let compressed = compressor.compress(&rdf_data).unwrap();
        let decompressed = compressor.decompress(&compressed).unwrap();

        assert_eq!(decompressed, rdf_data);

        // RDF data with repetitive URIs should compress excellently with Brotli
        let ratio = rdf_data.len() as f64 / compressed.data.len() as f64;
        println!("Brotli RDF compression ratio: {:.2}x", ratio);
        assert!(ratio > 4.0); // Should achieve >4x compression
    }

    #[test]
    fn test_brotli_small_data() {
        let compressor = BrotliCompressor::new();
        let data = b"Small";

        let compressed = compressor.compress(data).unwrap();
        let decompressed = compressor.decompress(&compressed).unwrap();

        assert_eq!(decompressed, data);
        println!(
            "Brotli small data: {} -> {} bytes",
            data.len(),
            compressed.data.len()
        );
    }

    #[test]
    fn test_brotli_level_clamping() {
        let too_high = BrotliCompressor::with_level(100);
        assert_eq!(too_high.level, 11);
    }

    #[test]
    fn test_brotli_window_clamping() {
        let too_small = BrotliCompressor::with_level_and_window(6, 5);
        let too_large = BrotliCompressor::with_level_and_window(6, 30);

        assert_eq!(too_small.window_size, 10);
        assert_eq!(too_large.window_size, 24);
    }
}