@infino-ai/infino 0.4.1 → 0.5.1

package/infino/index.d.ts

@@ -115,22 +115,16 @@ export interface VectorFilter {
     mode?: BoolMode;
 }
 export interface VectorSearchOptions {
-    /** IVF partitions to probe (higher = better recall, more work). */
-    nprobe?: number;
-    /** Over-fetch multiplier for the exact-rerank stage (higher = better recall). */
-    rerankMult?: number;
     projection?: string[];
     arrow?: boolean;
     /** Restrict the kNN to rows matching a text predicate (pushdown pre-filter). */
     filter?: VectorFilter;
 }
-/** Options for `hybridSearch`. `mode` applies to the BM25 side; `nprobe` to
- * the vector side. */
+/** Options for `hybridSearch`. `mode` applies to the BM25 side; vector
+ * probe width and rerank budget are engine-decided. */
 export interface HybridSearchOptions {
     /** BM25 boolean mode: `"or"` (default) or `"and"`. */
     mode?: BoolMode;
-    /** IVF partitions to probe on the vector side (higher = better recall). */
-    nprobe?: number;
     projection?: string[];
     arrow?: boolean;
 }

package/infino/index.js

@@ -256,12 +256,12 @@ class Table {
     }
     vectorSearch(column, query, k, opts = {}) {
         const q = query instanceof Float32Array ? query : Float32Array.from(query);
-        const buf = guard(this.remote, () => this.inner.vectorSearch(column, q, k, opts.nprobe, opts.rerankMult, opts.projection, opts.filter));
+        const buf = guard(this.remote, () => this.inner.vectorSearch(column, q, k, opts.projection, opts.filter));
         return decode(buf, opts.arrow);
     }
     hybridSearch(textColumn, textQuery, vectorColumn, vectorQuery, k, opts = {}) {
         const q = vectorQuery instanceof Float32Array ? vectorQuery : Float32Array.from(vectorQuery);
-        const buf = guard(this.remote, () => this.inner.hybridSearch(textColumn, textQuery, vectorColumn, q, k, opts.mode, opts.nprobe, opts.projection));
+        const buf = guard(this.remote, () => this.inner.hybridSearch(textColumn, textQuery, vectorColumn, q, k, opts.mode, opts.projection));
         return decode(buf, opts.arrow);
     }
     tokenMatch(column, query, opts = {}) {

package/infino/native.d.ts

@@ -175,7 +175,7 @@ export declare class Table {
    * opposite direction from `bm25Search`'s similarity. Fuse with
    * `hybridSearch`.
    */
-  vectorSearch(column: string, query: Float32Array, k: number, nprobe?: number | undefined | null, rerankMult?: number | undefined | null, projection?: Array<string> | undefined | null, filter?: VectorFilter | undefined | null): Buffer
+  vectorSearch(column: string, query: Float32Array, k: number, projection?: Array<string> | undefined | null, filter?: VectorFilter | undefined | null): Buffer
   /**
    * Unranked token match over one FTS column — every row whose `column`
    * matches the query's tokens under `mode` (`"or"` default, `"and"`).
@@ -197,11 +197,12 @@ export declare class Table {
   /**
    * Hybrid BM25 + vector search fused with reciprocal-rank fusion.
    * `text_column`/`text_query` (under `mode`) drive BM25; `vector_column`/
-   * `vector_query` (a `Float32Array`, with optional `nprobe`) drive vector
-   * kNN. Returns Arrow rows like [`Table::bm25_search`], with `score` the
-   * fused RRF score (higher is better); `projection` selects columns.
+   * `vector_query` (a `Float32Array`) drive vector kNN — probe width and
+   * rerank budget are engine-decided. Returns Arrow rows like
+   * [`Table::bm25_search`], with `score` the fused RRF score (higher is
+   * better); `projection` selects columns.
    */
-  hybridSearch(textColumn: string, textQuery: string, vectorColumn: string, vectorQuery: Float32Array, k: number, mode?: string | undefined | null, nprobe?: number | undefined | null, projection?: Array<string> | undefined | null): Buffer
+  hybridSearch(textColumn: string, textQuery: string, vectorColumn: string, vectorQuery: Float32Array, k: number, mode?: string | undefined | null, projection?: Array<string> | undefined | null): Buffer
   /**
    * Delete every row matching a SQL `predicate` (e.g. `"status = 'spam'"`),
    * returning the mutation counts. Requires durable storage — a `memory://`

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@infino-ai/infino",
-  "version": "0.4.1",
+  "version": "0.5.1",
   "description": "Fast search on object storage — SQL, full-text, and vector search.",
   "license": "Apache-2.0",
   "publishConfig": {
@@ -82,12 +82,12 @@
     "apache-arrow": "^17"
   },
   "optionalDependencies": {
-    "infx-darwin-x64": "0.4.1",
-    "infx-darwin-arm64": "0.4.1",
-    "infx-linux-x64-gnu": "0.4.1",
-    "infx-linux-arm64-gnu": "0.4.1",
-    "infx-linux-x64-musl": "0.4.1",
-    "infx-linux-arm64-musl": "0.4.1"
+    "infx-darwin-x64": "0.5.1",
+    "infx-darwin-arm64": "0.5.1",
+    "infx-linux-x64-gnu": "0.5.1",
+    "infx-linux-arm64-gnu": "0.5.1",
+    "infx-linux-x64-musl": "0.5.1",
+    "infx-linux-arm64-musl": "0.5.1"
   },
   "devDependencies": {
     "@napi-rs/cli": "^2.18.0",