ruvector-postgres 2.0.5

High-performance PostgreSQL vector database extension v2 - pgvector drop-in replacement with 230+ SQL functions, SIMD acceleration, Flash Attention, GNN layers, hybrid search, multi-tenancy, self-healing, and self-learning capabilities
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
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
//! ScalarVec - Native scalar quantized vector type (SQ8)
//!
//! Stores vectors with 8 bits per dimension (4x compression).
//! Uses int8 SIMD operations for fast approximate distance computation.

use pgrx::pgrx_sql_entity_graph::metadata::{
    ArgumentError, Returns, ReturnsError, SqlMapping, SqlTranslatable,
};
use serde::{Deserialize, Serialize};
use std::fmt;
use std::str::FromStr;

use crate::MAX_DIMENSIONS;

/// ScalarVec: Scalar quantized vector (8 bits per dimension)
///
/// Memory layout (varlena):
/// - Header: 4 bytes (varlena header)
/// - Dimensions: 2 bytes (u16)
/// - Scale: 4 bytes (f32)
/// - Offset: 4 bytes (f32)
/// - Data: dimensions bytes (i8)
///
/// Maximum dimensions: 16,000
/// Compression ratio: 4x vs f32
#[derive(Clone, Serialize, Deserialize)]
pub struct ScalarVec {
    /// Number of dimensions
    dimensions: u16,
    /// Scale factor for dequantization
    scale: f32,
    /// Offset for dequantization
    offset: f32,
    /// Quantized data (i8 values)
    data: Vec<i8>,
}

impl ScalarVec {
    /// Create from f32 slice with automatic scale/offset calculation
    pub fn from_f32(vector: &[f32]) -> Self {
        if vector.len() > MAX_DIMENSIONS {
            pgrx::error!(
                "Vector dimension {} exceeds maximum {}",
                vector.len(),
                MAX_DIMENSIONS
            );
        }

        if vector.is_empty() {
            return Self {
                dimensions: 0,
                scale: 1.0,
                offset: 0.0,
                data: Vec::new(),
            };
        }

        // Find min and max
        let mut min = f32::MAX;
        let mut max = f32::MIN;
        for &v in vector {
            if v < min {
                min = v;
            }
            if v > max {
                max = v;
            }
        }

        let range = max - min;
        let scale = if range > 0.0 { range / 254.0 } else { 1.0 };
        let offset = min;

        // Quantize to i8 (-127 to 127)
        let data: Vec<i8> = vector
            .iter()
            .map(|&v| {
                let normalized = (v - offset) / scale;
                (normalized.clamp(0.0, 254.0) - 127.0) as i8
            })
            .collect();

        Self {
            dimensions: vector.len() as u16,
            scale,
            offset,
            data,
        }
    }

    /// Create with custom scale and offset
    pub fn from_f32_custom(vector: &[f32], scale: f32, offset: f32) -> Self {
        if vector.len() > MAX_DIMENSIONS {
            pgrx::error!(
                "Vector dimension {} exceeds maximum {}",
                vector.len(),
                MAX_DIMENSIONS
            );
        }

        let data: Vec<i8> = vector
            .iter()
            .map(|&v| {
                let normalized = (v - offset) / scale;
                (normalized.clamp(0.0, 254.0) - 127.0) as i8
            })
            .collect();

        Self {
            dimensions: vector.len() as u16,
            scale,
            offset,
            data,
        }
    }

    /// Get number of dimensions
    #[inline]
    pub fn dimensions(&self) -> usize {
        self.dimensions as usize
    }

    /// Get scale factor
    #[inline]
    pub fn scale(&self) -> f32 {
        self.scale
    }

    /// Get offset
    #[inline]
    pub fn offset(&self) -> f32 {
        self.offset
    }

    /// Get quantized data
    #[inline]
    pub fn as_i8_slice(&self) -> &[i8] {
        &self.data
    }

    /// Dequantize to f32 vector
    pub fn to_f32(&self) -> Vec<f32> {
        self.data
            .iter()
            .map(|&q| (q as f32 + 127.0) * self.scale + self.offset)
            .collect()
    }

    /// Calculate approximate Euclidean distance (quantized space)
    pub fn distance(&self, other: &Self) -> f32 {
        debug_assert_eq!(self.dimensions, other.dimensions);
        let max_scale = self.scale.max(other.scale);
        distance_simd(&self.data, &other.data, max_scale)
    }

    /// Calculate squared distance (int32 space, no sqrt)
    pub fn distance_sq_int(&self, other: &Self) -> i32 {
        debug_assert_eq!(self.dimensions, other.dimensions);
        distance_sq(&self.data, &other.data)
    }

    /// Memory size in bytes
    pub fn memory_size(&self) -> usize {
        std::mem::size_of::<Self>() + self.data.len()
    }

    /// Compression ratio vs f32
    pub const fn compression_ratio() -> f32 {
        4.0 // f32 (4 bytes) -> i8 (1 byte)
    }

    /// Serialize to bytes
    fn to_bytes(&self) -> Vec<u8> {
        let mut bytes = Vec::with_capacity(10 + self.data.len());
        bytes.extend_from_slice(&self.dimensions.to_le_bytes());
        bytes.extend_from_slice(&self.scale.to_le_bytes());
        bytes.extend_from_slice(&self.offset.to_le_bytes());

        // Convert i8 to u8 for storage
        for &val in &self.data {
            bytes.push(val as u8);
        }

        bytes
    }

    /// Deserialize from bytes
    fn from_bytes(bytes: &[u8]) -> Self {
        if bytes.len() < 10 {
            pgrx::error!("Invalid ScalarVec data: too short");
        }

        let dimensions = u16::from_le_bytes([bytes[0], bytes[1]]);
        let scale = f32::from_le_bytes([bytes[2], bytes[3], bytes[4], bytes[5]]);
        let offset = f32::from_le_bytes([bytes[6], bytes[7], bytes[8], bytes[9]]);

        let expected_len = 10 + dimensions as usize;
        if bytes.len() != expected_len {
            pgrx::error!(
                "Invalid ScalarVec data: expected {} bytes, got {}",
                expected_len,
                bytes.len()
            );
        }

        let data: Vec<i8> = bytes[10..].iter().map(|&b| b as i8).collect();

        Self {
            dimensions,
            scale,
            offset,
            data,
        }
    }
}

// ============================================================================
// SIMD-Optimized Distance Functions
// ============================================================================

/// Calculate squared Euclidean distance (scalar)
#[inline]
pub fn distance_sq(a: &[i8], b: &[i8]) -> i32 {
    debug_assert_eq!(a.len(), b.len());

    a.iter()
        .zip(b.iter())
        .map(|(&x, &y)| {
            let diff = x as i32 - y as i32;
            diff * diff
        })
        .sum()
}

/// Calculate Euclidean distance (scalar)
#[inline]
pub fn distance(a: &[i8], b: &[i8], scale: f32) -> f32 {
    (distance_sq(a, b) as f32).sqrt() * scale
}

/// SIMD-optimized squared distance using AVX2 (x86_64)
#[cfg(target_arch = "x86_64")]
#[target_feature(enable = "avx2")]
unsafe fn distance_sq_avx2(a: &[i8], b: &[i8]) -> i32 {
    use std::arch::x86_64::*;

    let n = a.len();
    let mut sum = _mm256_setzero_si256();

    // Process 32 bytes (32 i8 values) at a time
    let chunks = n / 32;
    for i in 0..chunks {
        let offset = i * 32;

        let va = _mm256_loadu_si256(a.as_ptr().add(offset) as *const __m256i);
        let vb = _mm256_loadu_si256(b.as_ptr().add(offset) as *const __m256i);

        // Subtract with sign extension (i8 -> i16)
        // Process lower 16 bytes
        let diff_lo = _mm256_sub_epi16(
            _mm256_cvtepi8_epi16(_mm256_castsi256_si128(va)),
            _mm256_cvtepi8_epi16(_mm256_castsi256_si128(vb)),
        );

        // Process upper 16 bytes
        let diff_hi = _mm256_sub_epi16(
            _mm256_cvtepi8_epi16(_mm256_extracti128_si256(va, 1)),
            _mm256_cvtepi8_epi16(_mm256_extracti128_si256(vb, 1)),
        );

        // Square and accumulate (i16 * i16 -> i32)
        let sq_lo = _mm256_madd_epi16(diff_lo, diff_lo);
        let sq_hi = _mm256_madd_epi16(diff_hi, diff_hi);

        sum = _mm256_add_epi32(sum, sq_lo);
        sum = _mm256_add_epi32(sum, sq_hi);
    }

    // Horizontal sum of 8 i32 values
    let sum128_lo = _mm256_castsi256_si128(sum);
    let sum128_hi = _mm256_extracti128_si256(sum, 1);
    let sum128 = _mm_add_epi32(sum128_lo, sum128_hi);

    let sum64 = _mm_add_epi32(sum128, _mm_srli_si128(sum128, 8));
    let sum32 = _mm_add_epi32(sum64, _mm_srli_si128(sum64, 4));

    let mut result = _mm_cvtsi128_si32(sum32);

    // Handle remainder
    for i in (chunks * 32)..n {
        let diff = a[i] as i32 - b[i] as i32;
        result += diff * diff;
    }

    result
}

/// SIMD-optimized distance with runtime dispatch
pub fn distance_simd(a: &[i8], b: &[i8], scale: f32) -> f32 {
    debug_assert_eq!(a.len(), b.len());

    #[cfg(target_arch = "x86_64")]
    {
        if is_x86_feature_detected!("avx2") && a.len() >= 32 {
            return (unsafe { distance_sq_avx2(a, b) } as f32).sqrt() * scale;
        }
    }

    distance(a, b, scale)
}

// ============================================================================
// Display & Parsing
// ============================================================================

impl fmt::Display for ScalarVec {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        write!(f, "[")?;
        for (i, &val) in self.data.iter().enumerate() {
            if i > 0 {
                write!(f, ",")?;
            }
            // Show dequantized value
            let deq = (val as f32 + 127.0) * self.scale + self.offset;
            write!(f, "{:.6}", deq)?;
        }
        write!(f, "]")
    }
}

impl fmt::Debug for ScalarVec {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        write!(
            f,
            "ScalarVec(dims={}, scale={:.6}, offset={:.6})",
            self.dimensions, self.scale, self.offset
        )
    }
}

impl FromStr for ScalarVec {
    type Err = String;

    fn from_str(s: &str) -> Result<Self, Self::Err> {
        // Parse format: [1.0, 2.0, 3.0]
        let s = s.trim();
        if !s.starts_with('[') || !s.ends_with(']') {
            return Err(format!("Invalid ScalarVec format: {}", s));
        }

        let inner = &s[1..s.len() - 1];
        if inner.is_empty() {
            return Ok(Self {
                dimensions: 0,
                scale: 1.0,
                offset: 0.0,
                data: Vec::new(),
            });
        }

        let values: Result<Vec<f32>, _> =
            inner.split(',').map(|v| v.trim().parse::<f32>()).collect();

        match values {
            Ok(data) => Ok(Self::from_f32(&data)),
            Err(e) => Err(format!("Invalid ScalarVec element: {}", e)),
        }
    }
}

impl PartialEq for ScalarVec {
    fn eq(&self, other: &Self) -> bool {
        self.dimensions == other.dimensions
            && (self.scale - other.scale).abs() < 1e-6
            && (self.offset - other.offset).abs() < 1e-6
            && self.data == other.data
    }
}

// ============================================================================
// PostgreSQL Type Integration
// ============================================================================

unsafe impl SqlTranslatable for ScalarVec {
    fn argument_sql() -> Result<SqlMapping, ArgumentError> {
        Ok(SqlMapping::As(String::from("scalarvec")))
    }

    fn return_sql() -> Result<Returns, ReturnsError> {
        Ok(Returns::One(SqlMapping::As(String::from("scalarvec"))))
    }
}

impl pgrx::IntoDatum for ScalarVec {
    fn into_datum(self) -> Option<pgrx::pg_sys::Datum> {
        let bytes = self.to_bytes();
        let len = bytes.len();
        let total_size = pgrx::pg_sys::VARHDRSZ + len;

        unsafe {
            let ptr = pgrx::pg_sys::palloc(total_size) as *mut u8;
            let varlena = ptr as *mut pgrx::pg_sys::varlena;
            pgrx::varlena::set_varsize_4b(varlena, total_size as i32);
            std::ptr::copy_nonoverlapping(bytes.as_ptr(), ptr.add(pgrx::pg_sys::VARHDRSZ), len);
            Some(pgrx::pg_sys::Datum::from(ptr))
        }
    }

    fn type_oid() -> pgrx::pg_sys::Oid {
        pgrx::pg_sys::Oid::INVALID
    }
}

impl pgrx::FromDatum for ScalarVec {
    unsafe fn from_polymorphic_datum(
        datum: pgrx::pg_sys::Datum,
        is_null: bool,
        _typoid: pgrx::pg_sys::Oid,
    ) -> Option<Self> {
        if is_null {
            return None;
        }

        let ptr = datum.cast_mut_ptr::<pgrx::pg_sys::varlena>();
        let len = pgrx::varlena::varsize_any_exhdr(ptr);
        let data_ptr = pgrx::varlena::vardata_any(ptr) as *const u8;
        let bytes = std::slice::from_raw_parts(data_ptr, len);

        Some(ScalarVec::from_bytes(bytes))
    }
}

// Note: ScalarVec SQL functions are not exposed via #[pg_extern] due to
// pgrx 0.12 trait requirements. Use array-based functions for SQL-level operations.

// ============================================================================
// Tests
// ============================================================================

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

    #[test]
    fn test_quantize_dequantize() {
        let original = vec![0.1, 0.5, -0.3, 0.8, -0.9];
        let sq = ScalarVec::from_f32(&original);
        let restored = sq.to_f32();

        for (o, r) in original.iter().zip(restored.iter()) {
            assert!((o - r).abs() < 0.02, "orig={}, restored={}", o, r);
        }
    }

    #[test]
    fn test_distance() {
        let a = ScalarVec::from_f32(&[1.0, 0.0, 0.0]);
        let b = ScalarVec::from_f32(&[0.0, 1.0, 0.0]);

        let dist = a.distance(&b);
        // Euclidean distance should be approximately sqrt(2) ≈ 1.414
        assert!((dist - 1.414).abs() < 0.2, "dist={}", dist);
    }

    #[test]
    fn test_compression_ratio() {
        assert_eq!(ScalarVec::compression_ratio(), 4.0);
    }

    #[test]
    fn test_serialization() {
        let v = ScalarVec::from_f32(&[1.0, 2.0, 3.0, 4.0, 5.0]);
        let bytes = v.to_bytes();
        let v2 = ScalarVec::from_bytes(&bytes);
        assert_eq!(v, v2);
    }

    #[test]
    fn test_simd_matches_scalar() {
        let a_data: Vec<i8> = (0..128).map(|i| i as i8).collect();
        let b_data: Vec<i8> = (0..128).map(|i| -(i as i8)).collect();

        let scalar_result = distance_sq(&a_data, &b_data);
        let simd_result = (distance_simd(&a_data, &b_data, 1.0).powi(2)) as i32;

        assert!((scalar_result - simd_result).abs() < 10);
    }

    #[test]
    fn test_parse() {
        let v: ScalarVec = "[1.0, 2.0, 3.0]".parse().unwrap();
        assert_eq!(v.dimensions(), 3);

        let restored = v.to_f32();
        assert!((restored[0] - 1.0).abs() < 0.1);
        assert!((restored[1] - 2.0).abs() < 0.1);
        assert!((restored[2] - 3.0).abs() < 0.1);
    }
}