|
| 1 | +import Database from 'better-sqlite3'; |
| 2 | +import type { SearchQuery, SearchResult } from '../../types'; |
| 3 | +import { num } from './bigint'; |
| 4 | + |
| 5 | +const RRF_K = 60; |
| 6 | + |
| 7 | +/** |
| 8 | + * Configuration for hybrid search on a specific entity table. |
| 9 | + * Each store provides its own config pointing to its FTS5 and vec0 tables. |
| 10 | + */ |
| 11 | +export interface SearchConfig { |
| 12 | + /** FTS5 virtual table name (e.g. 'notes_fts') */ |
| 13 | + ftsTable: string; |
| 14 | + /** vec0 virtual table name (e.g. 'notes_vec') */ |
| 15 | + vecTable: string; |
| 16 | + /** Parent table name (e.g. 'notes') for project_id filtering */ |
| 17 | + parentTable: string; |
| 18 | + /** Column to join parent table to FTS rowid (usually 'id') */ |
| 19 | + parentIdColumn: string; |
| 20 | +} |
| 21 | + |
| 22 | +/** |
| 23 | + * Perform hybrid search combining FTS5 keyword search and vec0 vector search. |
| 24 | + * |
| 25 | + * - mode 'keyword': FTS5 only, embedding ignored |
| 26 | + * - mode 'vector': vec0 only, text ignored |
| 27 | + * - mode 'hybrid' (default): both, fused via Reciprocal Rank Fusion (RRF) |
| 28 | + * |
| 29 | + * vec0 cannot filter by project_id directly, so we overfetch and post-filter via JOIN. |
| 30 | + */ |
| 31 | +export function hybridSearch( |
| 32 | + db: Database.Database, |
| 33 | + config: SearchConfig, |
| 34 | + query: SearchQuery, |
| 35 | + projectId: number, |
| 36 | +): SearchResult[] { |
| 37 | + const mode = query.searchMode ?? 'hybrid'; |
| 38 | + const topK = query.topK ?? 50; |
| 39 | + const maxResults = query.maxResults ?? 20; |
| 40 | + const minScore = query.minScore ?? 0; |
| 41 | + |
| 42 | + let ftsRanked: Array<{ id: number; rn: number }> = []; |
| 43 | + let vecRanked: Array<{ id: number; rn: number }> = []; |
| 44 | + |
| 45 | + // FTS5 keyword search |
| 46 | + if (mode !== 'vector' && query.text) { |
| 47 | + const rows = db.prepare(` |
| 48 | + SELECT p.${config.parentIdColumn} AS id, ROW_NUMBER() OVER (ORDER BY rank) AS rn |
| 49 | + FROM ${config.ftsTable} fts |
| 50 | + JOIN ${config.parentTable} p ON p.${config.parentIdColumn} = fts.rowid AND p.project_id = ? |
| 51 | + WHERE ${config.ftsTable} MATCH ? |
| 52 | + LIMIT ? |
| 53 | + `).all(projectId, query.text, topK) as Array<{ id: bigint; rn: bigint }>; |
| 54 | + |
| 55 | + ftsRanked = rows.map(r => ({ id: num(r.id), rn: num(r.rn) })); |
| 56 | + } |
| 57 | + |
| 58 | + // vec0 vector search |
| 59 | + if (mode !== 'keyword' && query.embedding && query.embedding.length > 0) { |
| 60 | + const embeddingBuf = Buffer.from(new Float32Array(query.embedding).buffer); |
| 61 | + // Overfetch x3 to compensate for cross-project rows filtered out by JOIN |
| 62 | + const vecK = topK * 3; |
| 63 | + |
| 64 | + const rows = db.prepare(` |
| 65 | + SELECT v.rowid AS id, v.distance, ROW_NUMBER() OVER (ORDER BY v.distance) AS rn |
| 66 | + FROM ${config.vecTable} v |
| 67 | + JOIN ${config.parentTable} p ON p.${config.parentIdColumn} = v.rowid AND p.project_id = ? |
| 68 | + WHERE v.embedding MATCH ? AND v.k = ? |
| 69 | + `).all(projectId, embeddingBuf, vecK) as Array<{ id: bigint; distance: number; rn: bigint }>; |
| 70 | + |
| 71 | + vecRanked = rows.slice(0, topK).map((r, i) => ({ id: num(r.id), rn: i + 1 })); |
| 72 | + } |
| 73 | + |
| 74 | + // Single-mode: return directly with normalized scores |
| 75 | + if (mode === 'keyword') { |
| 76 | + return ftsRanked |
| 77 | + .map(r => ({ id: r.id, score: 1 / (RRF_K + r.rn) })) |
| 78 | + .filter(r => r.score >= minScore) |
| 79 | + .slice(0, maxResults); |
| 80 | + } |
| 81 | + |
| 82 | + if (mode === 'vector') { |
| 83 | + return vecRanked |
| 84 | + .map(r => ({ id: r.id, score: 1 / (RRF_K + r.rn) })) |
| 85 | + .filter(r => r.score >= minScore) |
| 86 | + .slice(0, maxResults); |
| 87 | + } |
| 88 | + |
| 89 | + // Hybrid: RRF fusion |
| 90 | + const scores = new Map<number, number>(); |
| 91 | + for (const r of ftsRanked) { |
| 92 | + scores.set(r.id, (scores.get(r.id) ?? 0) + 1 / (RRF_K + r.rn)); |
| 93 | + } |
| 94 | + for (const r of vecRanked) { |
| 95 | + scores.set(r.id, (scores.get(r.id) ?? 0) + 1 / (RRF_K + r.rn)); |
| 96 | + } |
| 97 | + |
| 98 | + return [...scores.entries()] |
| 99 | + .map(([id, score]) => ({ id, score })) |
| 100 | + .filter(r => r.score >= minScore) |
| 101 | + .sort((a, b) => b.score - a.score) |
| 102 | + .slice(0, maxResults); |
| 103 | +} |
0 commit comments