mih-rs 0.1.0

Multi-index hashing (MIH) for neighbor searches on 64-bit codes in the Hamming space.
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

//! Provides the benchmark of top-K search for MIH and LinearSearch algorithms.
use mih_rs::ls;
use mih_rs::mih;
use mih_rs::utils;
use std::time;

const SIZES: [usize; 4] = [10_000, 100_000, 1_000_000, 10_000_000];
const TOPKS: [usize; 3] = [1, 10, 100];

fn main() {
    #[cfg(debug_assertions)]
    println!("Debugging enabled");

    let codes = utils::random_codes(SIZES[SIZES.len() - 1]);
    let qcodes = utils::random_codes(100);

    for size in &SIZES {
        println!("--- N={} ---", *size);

        let ins = time::Instant::now();
        let index = mih::Index::new(&codes[0..*size]).unwrap();
        let elapsed_sec = ins.elapsed().as_secs_f64();
        println!("Constr time: {} sec", elapsed_sec);

        for topk in &TOPKS {
            let ins = time::Instant::now();
            for qcode in &qcodes {
                let answers = index.topk_search(*qcode, *topk);
                assert_eq!(answers.len(), *topk);
            }
            let elapsed_ms = ins.elapsed().as_millis() as f64;
            println!("MIH (K={}):\t{} ms/query", *topk, elapsed_ms / qcodes.len() as f64);
        }

        let ins = time::Instant::now();
        for qcode in &qcodes {
            let mut answers = ls::exhaustive_search(&codes[0..*size], *qcode);
            answers.sort_by_key(|x| x.1);
            assert_eq!(answers.len(), *size);
        }
        let elapsed_ms = ins.elapsed().as_millis() as f64;
        println!("LinearSearch:\t{} ms/query", elapsed_ms / qcodes.len() as f64);
    }
}