PSOrvia

Vetrina – una libreria musicale

100 000 brani, un indice, ricerca full-text e conteggi raggruppati in un breve programma Rust.

Cosa fa

Il programma crea una tabella di brani (titolo, artista, anno, durata) e un indice sull'artista, genera 100 000 brani da un seme fisso, riempie una tabella full-text con un tokenizzatore trigram e risponde a tre ricerche e a una query raggruppata.

Passaggi

  1. Creare la tabella, l'indice e la tabella full-text.
  2. Inserire 100 000 brani in un'unica transazione con parametri associati.
  3. Riempire la tabella full-text dai brani con un solo statement.
  4. Cercare con MATCH, per esempio una frase, due parole combinate con AND e il prefisso di una parola.
  5. Contare i brani per artista con GROUP BY.

La ricerca

// SPDX-License-Identifier: Apache-2.0
// Showcase: a music library of 100 000 tracks with full-text search.
// Usage: musiclib [tracks] [file]   (defaults: 100000 tracks, a temporary file)
use std::time::Instant;

use psob::encoding::key::Value;
use psob::sql::conn::Connection;
use psob::sql::eval::to_text;
use psob::sql::exec::Params;
use psob::{Database, OpenOptions};

const ADJ: [&str; 16] = [
    "Quiet", "Golden", "Broken", "Electric", "Hidden", "Silver", "Midnight", "Wild", "Slow", "Paper", "Distant",
    "Velvet", "Burning", "Frozen", "Lonely", "Bright",
];
const NOUN: [&str; 16] = [
    "River", "Garden", "Machine", "Harbor", "Letter", "Mirror", "Engine", "Forest", "Window", "Season", "Signal",
    "Island", "Morning", "Shadow", "Bridge", "Orchard",
];
const ARTIST: [&str; 12] = [
    "Anna Keller", "The Lanterns", "Mo Okafor", "Blue Harbor", "Ines Duarte", "Kite Season", "Sven Lindqvist",
    "Tomoko Ito", "Orchard Club", "Lena Voss", "North Wing", "Paper Moons",
];

struct Lcg(u64);
impl Lcg {
    fn next(&mut self, n: usize) -> usize {
        self.0 = self.0.wrapping_mul(6364136223846793005).wrapping_add(1442695040888963407);
        ((self.0 >> 33) as usize) % n
    }
}

fn text(s: &str) -> Value {
    Value::Text(s.to_string())
}

fn main() -> psob::Result<()> {
    let args: Vec<String> = std::env::args().collect();
    let n: usize = args.get(1).and_then(|s| s.parse().ok()).unwrap_or(100_000);
    let path = match args.get(2) {
        Some(p) => std::path::PathBuf::from(p),
        None => std::env::temp_dir().join(format!("psob-musiclib-{}.db", std::process::id())),
    };
    let _ = std::fs::remove_file(&path);
    let db = Database::open(&path, OpenOptions::default())?;
    let mut conn = Connection::with_mode(db, psob::sql::SqlMode::Sqlite)?;
    conn.execute("CREATE TABLE tracks(id INTEGER PRIMARY KEY, title TEXT NOT NULL, artist TEXT NOT NULL, year INT, seconds INT)")?;
    conn.execute("CREATE INDEX tracks_artist ON tracks(artist)")?;
    conn.execute("CREATE VIRTUAL TABLE search USING fts5(title, artist, tokenize = 'trigram remove_diacritics 1', content = '')")?;

    let t0 = Instant::now();
    let mut rng = Lcg(42);
    conn.execute("BEGIN")?;
    for i in 1..=n {
        let title = format!("{} {} {}", ADJ[rng.next(16)], NOUN[rng.next(16)], i);
        let artist = ARTIST[rng.next(12)];
        let p = Params {
            positional: vec![
                Value::Integer(i as i64),
                text(&title),
                text(artist),
                Value::Integer(1960 + rng.next(66) as i64),
                Value::Integer(120 + rng.next(300) as i64),
            ],
            named: vec![],
        };
        conn.execute_with("INSERT INTO tracks VALUES (?1, ?2, ?3, ?4, ?5)", &p)?;
    }
    conn.execute("INSERT INTO search(rowid, title, artist) SELECT id, title, artist FROM tracks")?;
    conn.execute("COMMIT")?;
    let load = t0.elapsed();

    let count = conn.query("SELECT count(*) FROM tracks")?;
    println!("tracks: {}", to_text(&count.rows[0][0]));

    for q in ["velvet bridge", "orchard AND kite", "froz"] {
        let t = Instant::now();
        let p = Params { positional: vec![text(q)], named: vec![] };
        let r = conn.query_with(
            "SELECT count(*) FROM search WHERE search MATCH ?1",
            &p,
        )?;
        let hits = to_text(&r.rows[0][0]);
        let top = conn.query_with(
            "SELECT t.title, t.artist FROM search JOIN tracks t ON t.id = search.rowid WHERE search MATCH ?1 ORDER BY t.id LIMIT 1",
            &p,
        )?;
        println!("search '{}': {} hits, first: {} / {}", q, hits, to_text(&top.rows[0][0]), to_text(&top.rows[0][1]));
        eprintln!("  ({:.1} ms)", t.elapsed().as_secs_f64() * 1000.0);
    }
    let by = conn.query("SELECT artist, count(*) AS n FROM tracks GROUP BY artist ORDER BY n DESC, artist LIMIT 3")?;
    for row in &by.rows {
        println!("artist {} has {} tracks", to_text(&row[0]), to_text(&row[1]));
    }
    eprintln!("loaded and indexed in {:.2} s", load.as_secs_f64());
    drop(conn);
    if args.get(2).is_none() {
        let _ = std::fs::remove_file(&path);
    }
    Ok(())
}

Eseguirlo

L'output è lo stesso a ogni esecuzione perché i dati provengono da un seme fisso. I tempi vanno sull'output di errore.

cd examples/rust
cargo run --release --bin musiclib

Output

tracks: 100000
search 'velvet bridge': 463 hits, first: Velvet Bridge 129 / Mo Okafor
search 'orchard AND kite': 509 hits, first: Golden Orchard 133 / Kite Season
search 'froz': 6299 hits, first: Frozen Bridge 6 / Sven Lindqvist
artist Paper Moons has 8448 tracks
artist Orchard Club has 8447 tracks
artist Sven Lindqvist has 8433 tracks

Tempi

Esecuzione singola, nessun confronto con altri database, preliminare.

Inserire 100 000 brani e riempire la tabella full-text2,0 s
Ricerca di una frase (463 risultati)4,5 ms
Ricerca di due parole con AND (509 risultati)6,9 ms
Ricerca del prefisso di una parola (6299 risultati)11,4 ms

Il supporto full-text oggi è il tokenizzatore trigram su tabelle senza contenuto. Altri tokenizzatori e funzioni di ranking non sono ancora realizzati.