@infino-ai/infino 0.1.3 → 0.1.5

package/infino/index.d.ts

@@ -27,6 +27,15 @@ export interface ConnectOptions {
     cacheDir?: string;
     /** Disk-cache budget in bytes. */
     cacheBudgetBytes?: number;
+    /**
+     * Per-connection heap budget in bytes: the working memory ingesting and
+     * querying use. Crossing it throws an Error whose message starts with
+     * `ConnectionMemoryBudgetError:`, instead of risking an out-of-memory crash.
+     * `0` or omitted measures without enforcing. Separate from `cacheBudgetBytes`
+     * (the disk cache). See
+     * https://infino.ai/docs/guides/storage#connection-memory-budget
+     */
+    connectionMemoryBudgetBytes?: number;
     /** How cold misses are serviced. */
     coldFetchMode?: "hybrid_with_prefetch" | "range_only" | "lazy_foreground_with_background_fill";
     /**
@@ -65,6 +74,9 @@ export interface OptimizeOptions {
     minFillPercent?: number;
     /** Target merged-superfile size, in MB. */
     targetSuperfileSizeMb?: number;
+    /** How old a sealed tombstone sidecar has to be, in milliseconds,
+     * before compaction treats its owner as dead and takes over. */
+    staleSealTimeoutMs?: number;
 }
 export interface Bm25SearchOptions {
     mode?: BoolMode;
@@ -129,12 +141,16 @@ export declare class Table {
      * append == one commit.
      */
     append(data: AppendData): void;
-    /** Ranked BM25 search; rows as records (or an Arrow `Table`). */
+    /** Ranked BM25 search; rows as records (or an Arrow `Table`). `score` is a
+     * similarity (higher is better) — opposite direction from `vectorSearch`'s
+     * distance. Fuse with `hybridSearch`. */
     bm25Search(column: string, query: string, k: number, opts: Bm25SearchOptions & {
         arrow: true;
     }): arrow.Table;
     bm25Search(column: string, query: string, k: number, opts?: Bm25SearchOptions): RowRecord[];
-    /** Vector kNN; rows as records (or an Arrow `Table`). */
+    /** Vector kNN; rows as records (or an Arrow `Table`). `score` is a distance
+     * (`0.0` = perfect match) — opposite direction from `bm25Search`'s
+     * similarity. Fuse with `hybridSearch`. */
     vectorSearch(column: string, query: number[] | Float32Array, k: number, opts: VectorSearchOptions & {
         arrow: true;
     }): arrow.Table;

package/infino/native.d.ts

@@ -19,6 +19,11 @@ export interface ConnectOptions {
   cacheDir?: string
   /** Disk-cache budget in bytes (a JS number; up to 2^53). */
   cacheBudgetBytes?: number
+  /**
+   * Per-connection heap budget in bytes (a JS number; up to 2^53). `0` or
+   * omitted measures usage without enforcing.
+   */
+  connectionMemoryBudgetBytes?: number
   /**
    * Cold-miss strategy: `"hybrid_with_prefetch"` | `"range_only"` |
    * `"lazy_foreground_with_background_fill"`.
@@ -38,6 +43,11 @@ export interface OptimizeOptions {
   minFillPercent?: number
   /** Target merged-superfile size, in MB. */
   targetSuperfileSizeMb?: number
+  /**
+   * How old a sealed tombstone sidecar has to be, in milliseconds,
+   * before compaction treats its owner as dead and takes over.
+   */
+  staleSealTimeoutMs?: number
 }
 /** Row counts from an `update` / `delete`. */
 export interface MutationStats {
@@ -139,6 +149,8 @@ export declare class Table {
    * IPC `Buffer` (read with `tableFromIPC`). `mode` is `"or"` (default)
    * or `"and"`. `projection` selects the returned columns — pass
    * `["_id", "score"]` for just id + score, or omit for full rows.
+   * `score` is a similarity (higher is better) — opposite direction
+   * from `vectorSearch`'s distance. Fuse with `hybridSearch`.
    */
   bm25Search(column: string, query: string, k: number, mode?: string | undefined | null, projection?: Array<string> | undefined | null): Buffer
   /**
@@ -146,7 +158,9 @@ export declare class Table {
    * (crosses by reference — no copy). Returns matching rows as an Arrow
    * IPC `Buffer` (read with `tableFromIPC`). `projection` selects the
    * returned columns (`["_id", "score"]` for just id + score, or omit
-   * for full rows).
+   * for full rows). `score` is a distance (`0.0` = perfect match) —
+   * 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
   /**

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@infino-ai/infino",
-  "version": "0.1.3",
+  "version": "0.1.5",
   "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.1.3",
-    "infx-darwin-arm64": "0.1.3",
-    "infx-linux-x64-gnu": "0.1.3",
-    "infx-linux-arm64-gnu": "0.1.3",
-    "infx-linux-x64-musl": "0.1.3",
-    "infx-linux-arm64-musl": "0.1.3"
+    "infx-darwin-x64": "0.1.5",
+    "infx-darwin-arm64": "0.1.5",
+    "infx-linux-x64-gnu": "0.1.5",
+    "infx-linux-arm64-gnu": "0.1.5",
+    "infx-linux-x64-musl": "0.1.5",
+    "infx-linux-arm64-musl": "0.1.5"
   },
   "devDependencies": {
     "@napi-rs/cli": "^2.18.0",