n8n-nodes-minimemory 0.2.0 → 0.3.0

package/README.md

@@ -12,8 +12,10 @@ Perform vector similarity search directly within n8n without any external server
 
 - **No server required** - Everything runs locally within n8n
 - **Similarity search** - Find the k most similar vectors
+- **Hybrid search** - Combine vector + keyword (BM25) search
 - **Multiple metrics** - Cosine, Euclidean, Dot Product
 - **Metadata support** - Associate additional information with each vector
+- **Metadata filtering** - MongoDB-style query operators
 - **Persistence** - Save/load from JSON files
 - **Bulk insert** - Insert multiple vectors from previous nodes
 
@@ -73,25 +75,33 @@ Bulk insert vectors from input items.
 ```
 
 ### Search
-Search for the k nearest neighbors with optional metadata filtering.
+Search for the k nearest neighbors using vector, keyword, or hybrid search.
 
 | Parameter | Description | Default |
 |-----------|-------------|---------|
-| Query Vector | Query vector | |
+| Search Mode | `vector`, `keyword`, or `hybrid` | `vector` |
+| Query Vector | Vector for similarity search | (required for vector/hybrid) |
+| Keywords | Text for BM25 keyword search | (required for keyword/hybrid) |
+| Text Fields | Metadata fields to search | `content,text,title,description` |
 | Number of Results (K) | Number of results | `10` |
 | Include Vectors | Include vectors in result | `false` |
 | Minimum Similarity | Filter by minimum similarity | `0` |
 | Use Metadata Filter | Enable metadata filtering | `false` |
 | Metadata Filter | JSON filter (see below) | `{}` |
+| Hybrid Alpha | Vector(1) vs Keyword(0) balance | `0.5` |
+| Fusion Method | `rrf` or `weighted` | `rrf` |
+| BM25 K1 | Term saturation parameter | `1.2` |
+| BM25 B | Length normalization | `0.75` |
 
 **Output:**
 ```json
 {
   "success": true,
+  "searchMode": "hybrid",
   "filterApplied": true,
   "results": [
-    {"id": "doc1", "distance": 0.1, "similarity": 0.9, "metadata": {...}},
-    {"id": "doc2", "distance": 0.2, "similarity": 0.8, "metadata": {...}}
+    {"id": "doc1", "score": 0.032, "vectorSimilarity": 0.9, "keywordScore": 12.4, "metadata": {...}},
+    {"id": "doc2", "score": 0.028, "vectorSimilarity": 0.8, "keywordScore": 8.2, "metadata": {...}}
   ]
 }
 ```

package/dist/index.d.ts

@@ -1,3 +1,2 @@
 export { Minimemory } from './nodes/Minimemory/Minimemory.node';
-export { MinimemoryConfig } from './credentials/MinimemoryConfig.credentials';
 //# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,oCAAoC,CAAC;AAChE,OAAO,EAAE,gBAAgB,EAAE,MAAM,4CAA4C,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,oCAAoC,CAAC"}

package/dist/index.js

@@ -1,8 +1,6 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.MinimemoryConfig = exports.Minimemory = void 0;
+exports.Minimemory = void 0;
 var Minimemory_node_1 = require("./nodes/Minimemory/Minimemory.node");
 Object.defineProperty(exports, "Minimemory", { enumerable: true, get: function () { return Minimemory_node_1.Minimemory; } });
-var MinimemoryConfig_credentials_1 = require("./credentials/MinimemoryConfig.credentials");
-Object.defineProperty(exports, "MinimemoryConfig", { enumerable: true, get: function () { return MinimemoryConfig_credentials_1.MinimemoryConfig; } });
 //# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../index.ts"],"names":[],"mappings":";;;AAAA,sEAAgE;AAAvD,6GAAA,UAAU,OAAA;AACnB,2FAA8E;AAArE,gIAAA,gBAAgB,OAAA"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../index.ts"],"names":[],"mappings":";;;AAAA,sEAAgE;AAAvD,6GAAA,UAAU,OAAA"}

package/dist/nodes/Minimemory/BM25Index.d.ts

@@ -0,0 +1,108 @@
+/**
+ * BM25 (Best Matching 25) keyword search implementation
+ * Pure TypeScript with zero external dependencies
+ */
+import { TokenizerOptions } from './TextUtils';
+export interface BM25Options {
+    k1?: number;
+    b?: number;
+    textFields: string[];
+    tokenizerOptions?: TokenizerOptions;
+}
+export interface BM25SearchResult {
+    id: string;
+    score: number;
+    metadata?: Record<string, unknown>;
+}
+export interface SerializedBM25Index {
+    version: string;
+    k1: number;
+    b: number;
+    textFields: string[];
+    avgDocLength: number;
+    documentCount: number;
+    documents: Array<{
+        id: string;
+        length: number;
+        termFrequencies: Record<string, number>;
+    }>;
+    documentFrequencies: Record<string, number>;
+}
+/**
+ * BM25 Index for full-text keyword search
+ */
+export declare class BM25Index {
+    private k1;
+    private b;
+    private textFields;
+    private tokenizerOptions;
+    private documents;
+    private documentFrequencies;
+    private totalDocLength;
+    constructor(options: BM25Options);
+    /**
+     * Gets the text fields being indexed
+     */
+    get indexedFields(): string[];
+    /**
+     * Gets the number of documents in the index
+     */
+    get documentCount(): number;
+    /**
+     * Gets the average document length
+     */
+    get avgDocLength(): number;
+    /**
+     * Gets the vocabulary size (unique terms)
+     */
+    get vocabularySize(): number;
+    /**
+     * Adds a document to the index
+     */
+    addDocument(id: string, metadata: Record<string, unknown> | null): void;
+    /**
+     * Updates a document in the index
+     */
+    updateDocument(id: string, metadata: Record<string, unknown> | null): void;
+    /**
+     * Removes a document from the index
+     */
+    removeDocument(id: string): boolean;
+    /**
+     * Calculates the IDF (Inverse Document Frequency) for a term
+     * Using the BM25 IDF formula: ln((N - n + 0.5) / (n + 0.5) + 1)
+     */
+    private calculateIDF;
+    /**
+     * Calculates the BM25 score for a document given query terms
+     */
+    private calculateScore;
+    /**
+     * Searches the index and returns k most relevant documents
+     */
+    search(query: string, k: number): BM25SearchResult[];
+    /**
+     * Gets statistics about the index
+     */
+    getStats(): {
+        documentCount: number;
+        avgDocLength: number;
+        vocabularySize: number;
+        k1: number;
+        b: number;
+        textFields: string[];
+    };
+    /**
+     * Serializes the index to a plain object
+     */
+    serialize(): SerializedBM25Index;
+    /**
+     * Deserializes an index from a plain object
+     */
+    static deserialize(data: SerializedBM25Index): BM25Index;
+    /**
+     * Clears the entire index
+     */
+    clear(): void;
+}
+//# sourceMappingURL=BM25Index.d.ts.map

package/dist/nodes/Minimemory/BM25Index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"BM25Index.d.ts","sourceRoot":"","sources":["../../../nodes/Minimemory/BM25Index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAyD,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAEtG,MAAM,WAAW,WAAW;IAC3B,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,gBAAgB,CAAC,EAAE,gBAAgB,CAAC;CACpC;AAED,MAAM,WAAW,gBAAgB;IAChC,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACnC;AAED,MAAM,WAAW,mBAAmB;IACnC,OAAO,EAAE,MAAM,CAAC;IAChB,EAAE,EAAE,MAAM,CAAC;IACX,CAAC,EAAE,MAAM,CAAC;IACV,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,YAAY,EAAE,MAAM,CAAC;IACrB,aAAa,EAAE,MAAM,CAAC;IACtB,SAAS,EAAE,KAAK,CAAC;QAChB,EAAE,EAAE,MAAM,CAAC;QACX,MAAM,EAAE,MAAM,CAAC;QACf,eAAe,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;KACxC,CAAC,CAAC;IACH,mBAAmB,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAC5C;AAQD;;GAEG;AACH,qBAAa,SAAS;IACrB,OAAO,CAAC,EAAE,CAAS;IACnB,OAAO,CAAC,CAAC,CAAS;IAClB,OAAO,CAAC,UAAU,CAAW;IAC7B,OAAO,CAAC,gBAAgB,CAAmB;IAG3C,OAAO,CAAC,SAAS,CAAwC;IAGzD,OAAO,CAAC,mBAAmB,CAAkC;IAG7D,OAAO,CAAC,cAAc,CAAa;gBAEvB,OAAO,EAAE,WAAW;IAOhC;;OAEG;IACH,IAAI,aAAa,IAAI,MAAM,EAAE,CAE5B;IAED;;OAEG;IACH,IAAI,aAAa,IAAI,MAAM,CAE1B;IAED;;OAEG;IACH,IAAI,YAAY,IAAI,MAAM,CAGzB;IAED;;OAEG;IACH,IAAI,cAAc,IAAI,MAAM,CAE3B;IAED;;OAEG;IACH,WAAW,CAAC,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,GAAG,IAAI;IAgCvE;;OAEG;IACH,cAAc,CAAC,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,GAAG,IAAI;IAI1E;;OAEG;IACH,cAAc,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAuBnC;;;OAGG;IACH,OAAO,CAAC,YAAY;IAUpB;;OAEG;IACH,OAAO,CAAC,cAAc;IAyBtB;;OAEG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,gBAAgB,EAAE;IAoCpD;;OAEG;IACH,QAAQ,IAAI;QACX,aAAa,EAAE,MAAM,CAAC;QACtB,YAAY,EAAE,MAAM,CAAC;QACrB,cAAc,EAAE,MAAM,CAAC;QACvB,EAAE,EAAE,MAAM,CAAC;QACX,CAAC,EAAE,MAAM,CAAC;QACV,UAAU,EAAE,MAAM,EAAE,CAAC;KACrB;IAWD;;OAEG;IACH,SAAS,IAAI,mBAAmB;IAgChC;;OAEG;IACH,MAAM,CAAC,WAAW,CAAC,IAAI,EAAE,mBAAmB,GAAG,SAAS;IA8BxD;;OAEG;IACH,KAAK,IAAI,IAAI;CAKb"}

package/dist/nodes/Minimemory/BM25Index.js

@@ -0,0 +1,259 @@
+"use strict";
+/**
+ * BM25 (Best Matching 25) keyword search implementation
+ * Pure TypeScript with zero external dependencies
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.BM25Index = void 0;
+const TextUtils_1 = require("./TextUtils");
+/**
+ * BM25 Index for full-text keyword search
+ */
+class BM25Index {
+    constructor(options) {
+        var _a, _b, _c;
+        // Document storage: id -> document data
+        this.documents = new Map();
+        // Inverted index: term -> count of documents containing this term
+        this.documentFrequencies = new Map();
+        // Statistics
+        this.totalDocLength = 0;
+        this.k1 = (_a = options.k1) !== null && _a !== void 0 ? _a : 1.2;
+        this.b = (_b = options.b) !== null && _b !== void 0 ? _b : 0.75;
+        this.textFields = options.textFields;
+        this.tokenizerOptions = (_c = options.tokenizerOptions) !== null && _c !== void 0 ? _c : {};
+    }
+    /**
+     * Gets the text fields being indexed
+     */
+    get indexedFields() {
+        return [...this.textFields];
+    }
+    /**
+     * Gets the number of documents in the index
+     */
+    get documentCount() {
+        return this.documents.size;
+    }
+    /**
+     * Gets the average document length
+     */
+    get avgDocLength() {
+        if (this.documents.size === 0)
+            return 0;
+        return this.totalDocLength / this.documents.size;
+    }
+    /**
+     * Gets the vocabulary size (unique terms)
+     */
+    get vocabularySize() {
+        return this.documentFrequencies.size;
+    }
+    /**
+     * Adds a document to the index
+     */
+    addDocument(id, metadata) {
+        // Remove existing document if present
+        if (this.documents.has(id)) {
+            this.removeDocument(id);
+        }
+        // Extract and tokenize text
+        const text = (0, TextUtils_1.extractTextFromMetadata)(metadata, this.textFields);
+        const tokens = (0, TextUtils_1.tokenize)(text, this.tokenizerOptions);
+        const termFrequencies = (0, TextUtils_1.getTermFrequencies)(tokens);
+        const docLength = tokens.length;
+        // Update document frequencies (IDF)
+        const seenTerms = new Set();
+        for (const term of tokens) {
+            if (!seenTerms.has(term)) {
+                seenTerms.add(term);
+                const current = this.documentFrequencies.get(term) || 0;
+                this.documentFrequencies.set(term, current + 1);
+            }
+        }
+        // Store document
+        this.documents.set(id, {
+            length: docLength,
+            termFrequencies,
+            metadata: metadata || undefined,
+        });
+        this.totalDocLength += docLength;
+    }
+    /**
+     * Updates a document in the index
+     */
+    updateDocument(id, metadata) {
+        this.addDocument(id, metadata);
+    }
+    /**
+     * Removes a document from the index
+     */
+    removeDocument(id) {
+        const doc = this.documents.get(id);
+        if (!doc)
+            return false;
+        // Update document frequencies
+        for (const [term] of doc.termFrequencies) {
+            const current = this.documentFrequencies.get(term) || 0;
+            if (current <= 1) {
+                this.documentFrequencies.delete(term);
+            }
+            else {
+                this.documentFrequencies.set(term, current - 1);
+            }
+        }
+        // Update total length
+        this.totalDocLength -= doc.length;
+        // Remove document
+        this.documents.delete(id);
+        return true;
+    }
+    /**
+     * Calculates the IDF (Inverse Document Frequency) for a term
+     * Using the BM25 IDF formula: ln((N - n + 0.5) / (n + 0.5) + 1)
+     */
+    calculateIDF(term) {
+        const n = this.documentFrequencies.get(term) || 0;
+        const N = this.documents.size;
+        if (n === 0)
+            return 0;
+        // BM25 IDF formula (Robertson-Walker IDF)
+        return Math.log(((N - n + 0.5) / (n + 0.5)) + 1);
+    }
+    /**
+     * Calculates the BM25 score for a document given query terms
+     */
+    calculateScore(docId, queryTerms) {
+        const doc = this.documents.get(docId);
+        if (!doc)
+            return 0;
+        const avgdl = this.avgDocLength;
+        if (avgdl === 0)
+            return 0;
+        let score = 0;
+        for (const term of queryTerms) {
+            const idf = this.calculateIDF(term);
+            const tf = doc.termFrequencies.get(term) || 0;
+            if (tf === 0)
+                continue;
+            // BM25 scoring formula
+            const numerator = tf * (this.k1 + 1);
+            const denominator = tf + this.k1 * (1 - this.b + this.b * (doc.length / avgdl));
+            score += idf * (numerator / denominator);
+        }
+        return score;
+    }
+    /**
+     * Searches the index and returns k most relevant documents
+     */
+    search(query, k) {
+        if (this.documents.size === 0 || !query.trim()) {
+            return [];
+        }
+        // Tokenize query
+        const queryTerms = (0, TextUtils_1.tokenize)(query, this.tokenizerOptions);
+        if (queryTerms.length === 0) {
+            return [];
+        }
+        // Calculate scores for all documents
+        const scores = [];
+        for (const [docId] of this.documents) {
+            const score = this.calculateScore(docId, queryTerms);
+            if (score > 0) {
+                scores.push({ id: docId, score });
+            }
+        }
+        // Sort by score (descending)
+        scores.sort((a, b) => b.score - a.score);
+        // Return top k results with metadata
+        return scores.slice(0, k).map(({ id, score }) => {
+            const doc = this.documents.get(id);
+            return {
+                id,
+                score,
+                metadata: doc === null || doc === void 0 ? void 0 : doc.metadata,
+            };
+        });
+    }
+    /**
+     * Gets statistics about the index
+     */
+    getStats() {
+        return {
+            documentCount: this.documentCount,
+            avgDocLength: this.avgDocLength,
+            vocabularySize: this.vocabularySize,
+            k1: this.k1,
+            b: this.b,
+            textFields: this.textFields,
+        };
+    }
+    /**
+     * Serializes the index to a plain object
+     */
+    serialize() {
+        const documents = [];
+        for (const [id, doc] of this.documents) {
+            const termFrequencies = {};
+            for (const [term, freq] of doc.termFrequencies) {
+                termFrequencies[term] = freq;
+            }
+            documents.push({
+                id,
+                length: doc.length,
+                termFrequencies,
+            });
+        }
+        const documentFrequencies = {};
+        for (const [term, freq] of this.documentFrequencies) {
+            documentFrequencies[term] = freq;
+        }
+        return {
+            version: '1.0.0',
+            k1: this.k1,
+            b: this.b,
+            textFields: this.textFields,
+            avgDocLength: this.avgDocLength,
+            documentCount: this.documentCount,
+            documents,
+            documentFrequencies,
+        };
+    }
+    /**
+     * Deserializes an index from a plain object
+     */
+    static deserialize(data) {
+        const index = new BM25Index({
+            k1: data.k1,
+            b: data.b,
+            textFields: data.textFields,
+        });
+        // Restore documents
+        for (const doc of data.documents) {
+            const termFrequencies = new Map();
+            for (const [term, freq] of Object.entries(doc.termFrequencies)) {
+                termFrequencies.set(term, freq);
+            }
+            index.documents.set(doc.id, {
+                length: doc.length,
+                termFrequencies,
+            });
+            index.totalDocLength += doc.length;
+        }
+        // Restore document frequencies
+        for (const [term, freq] of Object.entries(data.documentFrequencies)) {
+            index.documentFrequencies.set(term, freq);
+        }
+        return index;
+    }
+    /**
+     * Clears the entire index
+     */
+    clear() {
+        this.documents.clear();
+        this.documentFrequencies.clear();
+        this.totalDocLength = 0;
+    }
+}
+exports.BM25Index = BM25Index;
+//# sourceMappingURL=BM25Index.js.map

package/dist/nodes/Minimemory/BM25Index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"BM25Index.js","sourceRoot":"","sources":["../../../nodes/Minimemory/BM25Index.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,2CAAsG;AAoCtG;;GAEG;AACH,MAAa,SAAS;IAerB,YAAY,OAAoB;;QAThC,wCAAwC;QAChC,cAAS,GAA8B,IAAI,GAAG,EAAE,CAAC;QAEzD,kEAAkE;QAC1D,wBAAmB,GAAwB,IAAI,GAAG,EAAE,CAAC;QAE7D,aAAa;QACL,mBAAc,GAAW,CAAC,CAAC;QAGlC,IAAI,CAAC,EAAE,GAAG,MAAA,OAAO,CAAC,EAAE,mCAAI,GAAG,CAAC;QAC5B,IAAI,CAAC,CAAC,GAAG,MAAA,OAAO,CAAC,CAAC,mCAAI,IAAI,CAAC;QAC3B,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC,UAAU,CAAC;QACrC,IAAI,CAAC,gBAAgB,GAAG,MAAA,OAAO,CAAC,gBAAgB,mCAAI,EAAE,CAAC;IACxD,CAAC;IAED;;OAEG;IACH,IAAI,aAAa;QAChB,OAAO,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC;IAC7B,CAAC;IAED;;OAEG;IACH,IAAI,aAAa;QAChB,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,IAAI,YAAY;QACf,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QACxC,OAAO,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;IAClD,CAAC;IAED;;OAEG;IACH,IAAI,cAAc;QACjB,OAAO,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC;IACtC,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,EAAU,EAAE,QAAwC;QAC/D,sCAAsC;QACtC,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YAC5B,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;QACzB,CAAC;QAED,4BAA4B;QAC5B,MAAM,IAAI,GAAG,IAAA,mCAAuB,EAAC,QAAQ,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QAChE,MAAM,MAAM,GAAG,IAAA,oBAAQ,EAAC,IAAI,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC;QACrD,MAAM,eAAe,GAAG,IAAA,8BAAkB,EAAC,MAAM,CAAC,CAAC;QACnD,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC;QAEhC,oCAAoC;QACpC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QACpC,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC1B,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBACpB,MAAM,OAAO,GAAG,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACxD,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC;YACjD,CAAC;QACF,CAAC;QAED,iBAAiB;QACjB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE;YACtB,MAAM,EAAE,SAAS;YACjB,eAAe;YACf,QAAQ,EAAE,QAAQ,IAAI,SAAS;SAC/B,CAAC,CAAC;QAEH,IAAI,CAAC,cAAc,IAAI,SAAS,CAAC;IAClC,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,EAAU,EAAE,QAAwC;QAClE,IAAI,CAAC,WAAW,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,EAAU;QACxB,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACnC,IAAI,CAAC,GAAG;YAAE,OAAO,KAAK,CAAC;QAEvB,8BAA8B;QAC9B,KAAK,MAAM,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,eAAe,EAAE,CAAC;YAC1C,MAAM,OAAO,GAAG,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxD,IAAI,OAAO,IAAI,CAAC,EAAE,CAAC;gBAClB,IAAI,CAAC,mBAAmB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACvC,CAAC;iBAAM,CAAC;gBACP,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC;YACjD,CAAC;QACF,CAAC;QAED,sBAAsB;QACtB,IAAI,CAAC,cAAc,IAAI,GAAG,CAAC,MAAM,CAAC;QAElC,kBAAkB;QAClB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAE1B,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;OAGG;IACK,YAAY,CAAC,IAAY;QAChC,MAAM,CAAC,GAAG,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClD,MAAM,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;QAE9B,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAEtB,0CAA0C;QAC1C,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAClD,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,KAAa,EAAE,UAAoB;QACzD,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACtC,IAAI,CAAC,GAAG;YAAE,OAAO,CAAC,CAAC;QAEnB,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC;QAChC,IAAI,KAAK,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAE1B,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;YAC/B,MAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;YACpC,MAAM,EAAE,GAAG,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAE9C,IAAI,EAAE,KAAK,CAAC;gBAAE,SAAS;YAEvB,uBAAuB;YACvB,MAAM,SAAS,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACrC,MAAM,WAAW,GAAG,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC;YAEhF,KAAK,IAAI,GAAG,GAAG,CAAC,SAAS,GAAG,WAAW,CAAC,CAAC;QAC1C,CAAC;QAED,OAAO,KAAK,CAAC;IACd,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAa,EAAE,CAAS;QAC9B,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YAChD,OAAO,EAAE,CAAC;QACX,CAAC;QAED,iBAAiB;QACjB,MAAM,UAAU,GAAG,IAAA,oBAAQ,EAAC,KAAK,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC;QAE1D,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,OAAO,EAAE,CAAC;QACX,CAAC;QAED,qCAAqC;QACrC,MAAM,MAAM,GAAyC,EAAE,CAAC;QAExD,KAAK,MAAM,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACtC,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;YACrD,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;gBACf,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;YACnC,CAAC;QACF,CAAC;QAED,6BAA6B;QAC7B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAEzC,qCAAqC;QACrC,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE;YAC/C,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACnC,OAAO;gBACN,EAAE;gBACF,KAAK;gBACL,QAAQ,EAAE,GAAG,aAAH,GAAG,uBAAH,GAAG,CAAE,QAAQ;aACvB,CAAC;QACH,CAAC,CAAC,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,QAAQ;QAQP,OAAO;YACN,aAAa,EAAE,IAAI,CAAC,aAAa;YACjC,YAAY,EAAE,IAAI,CAAC,YAAY;YAC/B,cAAc,EAAE,IAAI,CAAC,cAAc;YACnC,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,CAAC,EAAE,IAAI,CAAC,CAAC;YACT,UAAU,EAAE,IAAI,CAAC,UAAU;SAC3B,CAAC;IACH,CAAC;IAED;;OAEG;IACH,SAAS;QACR,MAAM,SAAS,GAAqC,EAAE,CAAC;QAEvD,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACxC,MAAM,eAAe,GAA2B,EAAE,CAAC;YACnD,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,GAAG,CAAC,eAAe,EAAE,CAAC;gBAChD,eAAe,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;YAC9B,CAAC;YACD,SAAS,CAAC,IAAI,CAAC;gBACd,EAAE;gBACF,MAAM,EAAE,GAAG,CAAC,MAAM;gBAClB,eAAe;aACf,CAAC,CAAC;QACJ,CAAC;QAED,MAAM,mBAAmB,GAA2B,EAAE,CAAC;QACvD,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,mBAAmB,EAAE,CAAC;YACrD,mBAAmB,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;QAClC,CAAC;QAED,OAAO;YACN,OAAO,EAAE,OAAO;YAChB,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,CAAC,EAAE,IAAI,CAAC,CAAC;YACT,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,YAAY,EAAE,IAAI,CAAC,YAAY;YAC/B,aAAa,EAAE,IAAI,CAAC,aAAa;YACjC,SAAS;YACT,mBAAmB;SACnB,CAAC;IACH,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,WAAW,CAAC,IAAyB;QAC3C,MAAM,KAAK,GAAG,IAAI,SAAS,CAAC;YAC3B,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,CAAC,EAAE,IAAI,CAAC,CAAC;YACT,UAAU,EAAE,IAAI,CAAC,UAAU;SAC3B,CAAC,CAAC;QAEH,oBAAoB;QACpB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YAClC,MAAM,eAAe,GAAG,IAAI,GAAG,EAAkB,CAAC;YAClD,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,eAAe,CAAC,EAAE,CAAC;gBAChE,eAAe,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACjC,CAAC;YAED,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE;gBAC3B,MAAM,EAAE,GAAG,CAAC,MAAM;gBAClB,eAAe;aACf,CAAC,CAAC;YAEH,KAAK,CAAC,cAAc,IAAI,GAAG,CAAC,MAAM,CAAC;QACpC,CAAC;QAED,+BAA+B;QAC/B,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,mBAAmB,CAAC,EAAE,CAAC;YACrE,KAAK,CAAC,mBAAmB,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC3C,CAAC;QAED,OAAO,KAAK,CAAC;IACd,CAAC;IAED;;OAEG;IACH,KAAK;QACJ,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;QACvB,IAAI,CAAC,mBAAmB,CAAC,KAAK,EAAE,CAAC;QACjC,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;IACzB,CAAC;CACD;AAzSD,8BAySC"}

package/dist/nodes/Minimemory/HybridSearch.d.ts

@@ -0,0 +1,59 @@
+/**
+ * Hybrid Search - Combines vector similarity and keyword (BM25) search
+ */
+import { BM25SearchResult } from './BM25Index';
+export type SearchMode = 'vector' | 'keyword' | 'hybrid';
+export type FusionMethod = 'rrf' | 'weighted';
+export interface VectorSearchResult {
+    id: string;
+    distance: number;
+    similarity: number;
+    metadata?: Record<string, unknown>;
+}
+export interface HybridSearchResult {
+    id: string;
+    score: number;
+    vectorRank?: number;
+    keywordRank?: number;
+    vectorSimilarity?: number;
+    keywordScore?: number;
+    metadata?: Record<string, unknown>;
+}
+/**
+ * Performs Reciprocal Rank Fusion (RRF) on two result sets
+ *
+ * RRF is preferred for hybrid search because:
+ * 1. It does not require score normalization
+ * 2. It is robust to score distribution differences
+ * 3. It handles missing documents gracefully
+ *
+ * Formula: RRF_score(d) = 1/(k + rank_vector(d)) + 1/(k + rank_keyword(d))
+ *
+ * @param vectorResults - Results from vector similarity search
+ * @param keywordResults - Results from BM25 keyword search
+ * @param k - Number of results to return
+ * @param rrfConstant - RRF constant (default: 60, higher = less emphasis on top ranks)
+ */
+export declare function reciprocalRankFusion(vectorResults: VectorSearchResult[], keywordResults: BM25SearchResult[], k: number, rrfConstant?: number): HybridSearchResult[];
+/**
+ * Performs weighted score combination
+ *
+ * This method normalizes scores from both search types to [0, 1] range
+ * and combines them using the alpha parameter.
+ *
+ * Formula: combined_score = alpha * vector_score + (1 - alpha) * keyword_score
+ *
+ * @param vectorResults - Results from vector similarity search
+ * @param keywordResults - Results from BM25 keyword search
+ * @param k - Number of results to return
+ * @param alpha - Balance weight: 0 = pure keyword, 1 = pure vector (default: 0.5)
+ */
+export declare function weightedCombination(vectorResults: VectorSearchResult[], keywordResults: BM25SearchResult[], k: number, alpha?: number): HybridSearchResult[];
+/**
+ * Performs hybrid search using the specified fusion method
+ */
+export declare function hybridFusion(vectorResults: VectorSearchResult[], keywordResults: BM25SearchResult[], k: number, method?: FusionMethod, options?: {
+    alpha?: number;
+    rrfConstant?: number;
+}): HybridSearchResult[];
+//# sourceMappingURL=HybridSearch.d.ts.map

package/dist/nodes/Minimemory/HybridSearch.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"HybridSearch.d.ts","sourceRoot":"","sources":["../../../nodes/Minimemory/HybridSearch.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAE/C,MAAM,MAAM,UAAU,GAAG,QAAQ,GAAG,SAAS,GAAG,QAAQ,CAAC;AACzD,MAAM,MAAM,YAAY,GAAG,KAAK,GAAG,UAAU,CAAC;AAE9C,MAAM,WAAW,kBAAkB;IAClC,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACnC;AAED,MAAM,WAAW,kBAAkB;IAClC,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACnC;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,oBAAoB,CACnC,aAAa,EAAE,kBAAkB,EAAE,EACnC,cAAc,EAAE,gBAAgB,EAAE,EAClC,CAAC,EAAE,MAAM,EACT,WAAW,GAAE,MAAW,GACtB,kBAAkB,EAAE,CAuDtB;AA2BD;;;;;;;;;;;;GAYG;AACH,wBAAgB,mBAAmB,CAClC,aAAa,EAAE,kBAAkB,EAAE,EACnC,cAAc,EAAE,gBAAgB,EAAE,EAClC,CAAC,EAAE,MAAM,EACT,KAAK,GAAE,MAAY,GACjB,kBAAkB,EAAE,CAwDtB;AAED;;GAEG;AACH,wBAAgB,YAAY,CAC3B,aAAa,EAAE,kBAAkB,EAAE,EACnC,cAAc,EAAE,gBAAgB,EAAE,EAClC,CAAC,EAAE,MAAM,EACT,MAAM,GAAE,YAAoB,EAC5B,OAAO,CAAC,EAAE;IACT,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,WAAW,CAAC,EAAE,MAAM,CAAC;CACrB,GACC,kBAAkB,EAAE,CAgBtB"}