@wiscale/tauri-plugin-velesdb 1.11.0 → 1.13.0

package/dist/index.d.mts

@@ -23,7 +23,9 @@
  */
 /** Distance metric for vector similarity. */
 type DistanceMetric = 'cosine' | 'euclidean' | 'dot' | 'hamming' | 'jaccard';
-/** Request to create a new collection. */
+/** Storage mode for vector compression. */
+type StorageMode = 'full' | 'sq8' | 'binary' | 'pq' | 'rabitq';
+/** Request to create a new vector collection. */
 interface CreateCollectionRequest {
     /** Collection name (unique identifier). */
     name: string;
@@ -31,6 +33,29 @@ interface CreateCollectionRequest {
     dimension: number;
     /** Distance metric for similarity calculations. Default: 'cosine'. */
     metric?: DistanceMetric;
+    /** Storage mode for vector compression. Default: 'full'. */
+    storageMode?: StorageMode;
+    /** HNSW M parameter (max connections per node). Auto-tuned if omitted. */
+    hnswM?: number;
+    /** HNSW ef_construction parameter. Auto-tuned if omitted. */
+    hnswEfConstruction?: number;
+    /** HNSW alpha for neighbor diversification. Default: 1.2. */
+    hnswAlpha?: number;
+    /** HNSW initial max elements capacity. Auto-tuned if omitted. */
+    hnswMaxElements?: number;
+    /** PQ rescore oversampling factor. Default: 4. */
+    pqRescoreOversampling?: number;
+}
+/** Request to create a graph collection with optional schema. */
+interface CreateGraphCollectionRequest {
+    /** Collection name (unique identifier). */
+    name: string;
+    /** Optional vector dimension for node embeddings. */
+    dimension?: number;
+    /** Distance metric (when dimension is set). Default: 'cosine'. */
+    metric?: DistanceMetric;
+    /** Graph schema definition. Pass { schemaless: true } for schemaless mode. */
+    graphSchema?: Record<string, unknown>;
 }
 /** Request to create a metadata-only collection. */
 interface CreateMetadataCollectionRequest {
@@ -61,6 +86,8 @@ interface CollectionInfo {
     metric: string;
     /** Number of vectors in the collection. */
     count: number;
+    /** Storage mode (full, sq8, binary, pq, rabitq, graph, metadata_only). */
+    storageMode: string;
 }
 /** A point (vector with metadata) to insert. */
 interface PointInput {
@@ -86,6 +113,10 @@ interface SearchRequest {
     vector: number[];
     /** Number of results to return. Default: 10. */
     topK?: number;
+    /** Optional metadata filter. */
+    filter?: Record<string, unknown>;
+    /** Search quality: 'fast', 'balanced', 'accurate', 'perfect', 'auto', or 'custom:<ef>'. */
+    quality?: string;
 }
 /** Request for BM25 text search. */
 interface TextSearchRequest {
@@ -95,6 +126,8 @@ interface TextSearchRequest {
     query: string;
     /** Number of results to return. Default: 10. */
     topK?: number;
+    /** Optional metadata filter. */
+    filter?: Record<string, unknown>;
 }
 /** Request for hybrid (vector + text) search. */
 interface HybridSearchRequest {
@@ -108,6 +141,8 @@ interface HybridSearchRequest {
     topK?: number;
     /** Weight for vector results (0.0-1.0). Default: 0.5. */
     vectorWeight?: number;
+    /** Optional metadata filter. */
+    filter?: Record<string, unknown>;
 }
 /** Request for VelesQL query. */
 interface QueryRequest {
@@ -138,6 +173,8 @@ interface IndividualSearchRequest {
     topK?: number;
     /** Optional metadata filter. */
     filter?: Record<string, unknown>;
+    /** Search quality: 'fast', 'balanced', 'accurate', 'perfect', 'auto', or 'custom:<ef>'. */
+    quality?: string;
 }
 /** Request for batch search. */
 interface BatchSearchRequest {
@@ -147,7 +184,7 @@ interface BatchSearchRequest {
     searches: IndividualSearchRequest[];
 }
 /** Fusion strategy for multi-query search. */
-type FusionStrategy = 'rrf' | 'average' | 'maximum' | 'weighted';
+type FusionStrategy = 'rrf' | 'average' | 'maximum' | 'weighted' | 'relative_score';
 /** Fusion parameters for multi-query search. */
 interface FusionParams {
     /** RRF k parameter (default: 60). */
@@ -158,6 +195,10 @@ interface FusionParams {
     maxWeight?: number;
     /** Weighted fusion: hit weight (default: 0.1). */
     hitWeight?: number;
+    /** Relative score fusion: dense branch weight (default: 0.5). */
+    denseWeight?: number;
+    /** Relative score fusion: sparse branch weight (default: 0.5). */
+    sparseWeight?: number;
 }
 /** Request for multi-query fusion search. */
 interface MultiQuerySearchRequest {
@@ -167,7 +208,7 @@ interface MultiQuerySearchRequest {
     vectors: number[][];
     /** Number of results to return. Default: 10. */
     topK?: number;
-    /** Fusion strategy: 'rrf', 'average', 'maximum', 'weighted'. Default: 'rrf'. */
+    /** Fusion strategy: 'rrf', 'average', 'maximum', 'weighted', 'relative_score'. Default: 'rrf'. */
     fusion?: FusionStrategy;
     /** Fusion parameters. */
     fusionParams?: FusionParams;
@@ -199,6 +240,28 @@ interface SearchResponse {
     /** Query execution time in milliseconds. */
     timingMs: number;
 }
+/** Hybrid result from VelesQL queries (vector + graph + column data). */
+interface HybridResult {
+    /** Node/point ID. */
+    nodeId: number;
+    /** Vector similarity score (if applicable). */
+    vectorScore?: number;
+    /** Graph traversal score (if applicable). */
+    graphScore?: number;
+    /** Fused score combining vector and graph components. */
+    fusedScore: number;
+    /** Payload/bindings from the query. */
+    bindings?: Record<string, unknown>;
+    /** Column data from aggregation queries. */
+    columnData?: Record<string, unknown>;
+}
+/** Response from VelesQL query operations. */
+interface QueryResponse {
+    /** Query results. */
+    results: HybridResult[];
+    /** Query execution time in milliseconds. */
+    timingMs: number;
+}
 /** Error returned by plugin commands. */
 interface CommandError {
     /** Human-readable error message. */
@@ -378,21 +441,28 @@ declare function textSearch(request: TextSearchRequest): Promise<SearchResponse>
  */
 declare function hybridSearch(request: HybridSearchRequest): Promise<SearchResponse>;
 /**
- * Executes a VelesQL query.
+ * Executes a VelesQL query (SELECT, MATCH, DDL, DML).
  *
  * @param request - Query request with VelesQL string
- * @returns Search response with results and timing
+ * @returns Query response with hybrid results and timing
  * @throws {CommandError} If query syntax is invalid or collection doesn't exist
  *
  * @example
  * ```typescript
+ * // SELECT query
  * const response = await query({
- *   query: "SELECT * FROM documents WHERE content MATCH 'rust programming' LIMIT 10",
+ *   query: "SELECT * FROM documents WHERE vector NEAR $v LIMIT 10",
+ *   params: { v: queryEmbedding }
+ * });
+ *
+ * // MATCH (graph) query
+ * const response = await query({
+ *   query: "MATCH (d:Doc)-[:AUTHORED_BY]->(a:Person) RETURN a.name",
  *   params: {}
  * });
  * ```
  */
-declare function query(request: QueryRequest): Promise<SearchResponse>;
+declare function query(request: QueryRequest): Promise<QueryResponse>;
 /**
  * Retrieves points by their IDs.
  *
@@ -528,10 +598,13 @@ interface GetEdgesRequest {
 interface TraverseGraphRequest {
     collection: string;
     source: number;
-    maxDepth: number;
+    /** Maximum traversal depth. Default: 3. */
+    maxDepth?: number;
     relTypes?: string[];
-    limit: number;
-    algorithm: 'bfs' | 'dfs';
+    /** Maximum results to return. Default: 100. */
+    limit?: number;
+    /** Traversal algorithm. Default: 'bfs'. */
+    algorithm?: 'bfs' | 'dfs';
 }
 /** Request to get the degree of a node. */
 interface GetNodeDegreeRequest {
@@ -615,5 +688,190 @@ declare function traverseGraph(request: TraverseGraphRequest): Promise<Traversal
  * ```
  */
 declare function getNodeDegree(request: GetNodeDegreeRequest): Promise<NodeDegreeOutput>;
+/**
+ * Creates a graph collection with optional schema.
+ *
+ * @param request - Graph collection configuration
+ * @returns Collection info
+ * @throws {CommandError} If collection already exists or parameters are invalid
+ *
+ * @example
+ * ```typescript
+ * // Schemaless graph (default)
+ * const info = await createGraphCollection({ name: 'knowledge' });
+ *
+ * // Graph with embeddings
+ * const info = await createGraphCollection({
+ *   name: 'knowledge', dimension: 768, metric: 'cosine',
+ *   graphSchema: { schemaless: true }
+ * });
+ * ```
+ */
+declare function createGraphCollection(request: CreateGraphCollectionRequest): Promise<CollectionInfo>;
+/** Request to scroll through collection points. */
+interface ScrollRequest {
+    /** Target collection name. */
+    collection: string;
+    /** Cursor from a previous scroll (omit for the first batch). */
+    cursor?: number;
+    /** Number of points per batch. Default: 100. */
+    batchSize?: number;
+    /** Optional metadata filter. */
+    filter?: Record<string, unknown>;
+}
+/** Response from a scroll operation. */
+interface ScrollResponse {
+    /** Points in this batch. */
+    points: PointOutput[];
+    /** Cursor for the next batch (absent when no more points). */
+    nextCursor?: number;
+}
+/**
+ * Scrolls through collection points with cursor-based pagination.
+ *
+ * @param request - Scroll parameters
+ * @returns Batch of points and optional next cursor
+ * @throws {CommandError} If collection doesn't exist
+ *
+ * @example
+ * ```typescript
+ * let cursor: number | undefined;
+ * do {
+ *   const batch = await scrollCollection({ collection: 'docs', cursor, batchSize: 50 });
+ *   batch.points.forEach(p => console.log(p.id));
+ *   cursor = batch.nextCursor;
+ * } while (cursor !== undefined);
+ * ```
+ */
+declare function scrollCollection(request: ScrollRequest): Promise<ScrollResponse>;
+/** Request to store knowledge in semantic memory. */
+interface SemanticStoreRequest {
+    /** Unique ID for this knowledge fact. */
+    id: number;
+    /** Text content of the knowledge. */
+    content: string;
+    /** Embedding vector for the content. */
+    embedding: number[];
+}
+/** Request to query semantic memory. */
+interface SemanticQueryRequest {
+    /** Query embedding vector. */
+    embedding: number[];
+    /** Number of results to return. Default: 10. */
+    topK?: number;
+}
+/** Result from semantic memory query. */
+interface SemanticQueryResult {
+    /** Knowledge fact ID. */
+    id: number;
+    /** Similarity score. */
+    score: number;
+    /** Knowledge content text. */
+    content: string;
+}
+/**
+ * Stores a knowledge fact in semantic memory.
+ *
+ * @param request - Semantic store request
+ * @throws {CommandError} On storage failure
+ */
+declare function semanticStore(request: SemanticStoreRequest): Promise<void>;
+/**
+ * Queries semantic memory by similarity search.
+ *
+ * @param request - Semantic query request
+ * @returns Array of matching knowledge facts
+ */
+declare function semanticQuery(request: SemanticQueryRequest): Promise<SemanticQueryResult[]>;
+/** Request to record an episode. */
+interface EpisodicRecordRequest {
+    /** Episode event ID. */
+    eventId: number;
+    /** Episode description/content. */
+    content: string;
+    /** Timestamp (epoch seconds). */
+    timestamp: number;
+    /** Embedding vector for the episode. */
+    embedding: number[];
+}
+/** Request to query recent episodes. */
+interface EpisodicRecentRequest {
+    /** Number of recent episodes to return. Default: 10. */
+    limit?: number;
+    /** Only return episodes since this timestamp (epoch seconds). */
+    sinceTimestamp?: number;
+}
+/** Result from episodic memory query. */
+interface EpisodicResult {
+    /** Episode ID. */
+    id: number;
+    /** Episode content. */
+    content: string;
+    /** Timestamp (epoch seconds). */
+    timestamp: number;
+}
+/**
+ * Records an episode in episodic memory.
+ *
+ * @param request - Episode to record
+ * @throws {CommandError} On storage failure
+ */
+declare function episodicRecord(request: EpisodicRecordRequest): Promise<void>;
+/**
+ * Queries recent episodes from episodic memory.
+ *
+ * @param request - Query parameters (limit, since_timestamp)
+ * @returns Array of recent episodes
+ */
+declare function episodicRecent(request: EpisodicRecentRequest): Promise<EpisodicResult[]>;
+/** Request to learn a procedure. */
+interface ProceduralLearnRequest {
+    /** Procedure ID. */
+    procedureId: number;
+    /** Procedure name. */
+    name: string;
+    /** Steps to perform. */
+    steps: string[];
+    /** Embedding vector for the procedure. */
+    embedding: number[];
+    /** Confidence level (0.0-1.0). Default: 1.0. */
+    confidence?: number;
+}
+/** Request to recall procedures by similarity. */
+interface ProceduralRecallRequest {
+    /** Query embedding vector. */
+    embedding: number[];
+    /** Number of results. Default: 10. */
+    topK?: number;
+    /** Minimum confidence threshold. Default: 0.0. */
+    minConfidence?: number;
+}
+/** Result from procedural memory recall. */
+interface ProceduralMatchResult {
+    /** Procedure ID. */
+    id: number;
+    /** Procedure name. */
+    name: string;
+    /** Steps. */
+    steps: string[];
+    /** Confidence score. */
+    confidence: number;
+    /** Similarity score from vector search. */
+    score: number;
+}
+/**
+ * Learns a procedure in procedural memory.
+ *
+ * @param request - Procedure to learn
+ * @throws {CommandError} On storage failure
+ */
+declare function proceduralLearn(request: ProceduralLearnRequest): Promise<void>;
+/**
+ * Recalls procedures by similarity from procedural memory.
+ *
+ * @param request - Recall parameters
+ * @returns Array of matching procedures
+ */
+declare function proceduralRecall(request: ProceduralRecallRequest): Promise<ProceduralMatchResult[]>;
 
-export { type AddEdgeRequest, type BatchSearchRequest, type CollectionInfo, type CommandError, type CreateCollectionRequest, type CreateMetadataCollectionRequest, type DeletePointsRequest, type DistanceMetric, type EdgeOutput, type FusionParams, type FusionStrategy, type GetEdgesRequest, type GetNodeDegreeRequest, type GetPointsRequest, type HybridSearchRequest, type IndividualSearchRequest, type MetadataPointInput, type MultiQuerySearchRequest, type NodeDegreeOutput, type PointInput, type PointOutput, type QueryRequest, type SearchRequest, type SearchResponse, type SearchResult, type TextSearchRequest, type TraversalOutput, type TraverseGraphRequest, type UpsertMetadataRequest, type UpsertRequest, addEdge, batchSearch, createCollection, createMetadataCollection, deleteCollection, deletePoints, flush, getCollection, getEdges, getNodeDegree, getPoints, hybridSearch, isEmpty, listCollections, multiQuerySearch, query, search, textSearch, traverseGraph, upsert, upsertMetadata };
+export { type AddEdgeRequest, type BatchSearchRequest, type CollectionInfo, type CommandError, type CreateCollectionRequest, type CreateGraphCollectionRequest, type CreateMetadataCollectionRequest, type DeletePointsRequest, type DistanceMetric, type EdgeOutput, type EpisodicRecentRequest, type EpisodicRecordRequest, type EpisodicResult, type FusionParams, type FusionStrategy, type GetEdgesRequest, type GetNodeDegreeRequest, type GetPointsRequest, type HybridResult, type HybridSearchRequest, type IndividualSearchRequest, type MetadataPointInput, type MultiQuerySearchRequest, type NodeDegreeOutput, type PointInput, type PointOutput, type ProceduralLearnRequest, type ProceduralMatchResult, type ProceduralRecallRequest, type QueryRequest, type QueryResponse, type ScrollRequest, type ScrollResponse, type SearchRequest, type SearchResponse, type SearchResult, type SemanticQueryRequest, type SemanticQueryResult, type SemanticStoreRequest, type StorageMode, type TextSearchRequest, type TraversalOutput, type TraverseGraphRequest, type UpsertMetadataRequest, type UpsertRequest, addEdge, batchSearch, createCollection, createGraphCollection, createMetadataCollection, deleteCollection, deletePoints, episodicRecent, episodicRecord, flush, getCollection, getEdges, getNodeDegree, getPoints, hybridSearch, isEmpty, listCollections, multiQuerySearch, proceduralLearn, proceduralRecall, query, scrollCollection, search, semanticQuery, semanticStore, textSearch, traverseGraph, upsert, upsertMetadata };

package/dist/index.d.ts

@@ -23,7 +23,9 @@
  */
 /** Distance metric for vector similarity. */
 type DistanceMetric = 'cosine' | 'euclidean' | 'dot' | 'hamming' | 'jaccard';
-/** Request to create a new collection. */
+/** Storage mode for vector compression. */
+type StorageMode = 'full' | 'sq8' | 'binary' | 'pq' | 'rabitq';
+/** Request to create a new vector collection. */
 interface CreateCollectionRequest {
     /** Collection name (unique identifier). */
     name: string;
@@ -31,6 +33,29 @@ interface CreateCollectionRequest {
     dimension: number;
     /** Distance metric for similarity calculations. Default: 'cosine'. */
     metric?: DistanceMetric;
+    /** Storage mode for vector compression. Default: 'full'. */
+    storageMode?: StorageMode;
+    /** HNSW M parameter (max connections per node). Auto-tuned if omitted. */
+    hnswM?: number;
+    /** HNSW ef_construction parameter. Auto-tuned if omitted. */
+    hnswEfConstruction?: number;
+    /** HNSW alpha for neighbor diversification. Default: 1.2. */
+    hnswAlpha?: number;
+    /** HNSW initial max elements capacity. Auto-tuned if omitted. */
+    hnswMaxElements?: number;
+    /** PQ rescore oversampling factor. Default: 4. */
+    pqRescoreOversampling?: number;
+}
+/** Request to create a graph collection with optional schema. */
+interface CreateGraphCollectionRequest {
+    /** Collection name (unique identifier). */
+    name: string;
+    /** Optional vector dimension for node embeddings. */
+    dimension?: number;
+    /** Distance metric (when dimension is set). Default: 'cosine'. */
+    metric?: DistanceMetric;
+    /** Graph schema definition. Pass { schemaless: true } for schemaless mode. */
+    graphSchema?: Record<string, unknown>;
 }
 /** Request to create a metadata-only collection. */
 interface CreateMetadataCollectionRequest {
@@ -61,6 +86,8 @@ interface CollectionInfo {
     metric: string;
     /** Number of vectors in the collection. */
     count: number;
+    /** Storage mode (full, sq8, binary, pq, rabitq, graph, metadata_only). */
+    storageMode: string;
 }
 /** A point (vector with metadata) to insert. */
 interface PointInput {
@@ -86,6 +113,10 @@ interface SearchRequest {
     vector: number[];
     /** Number of results to return. Default: 10. */
     topK?: number;
+    /** Optional metadata filter. */
+    filter?: Record<string, unknown>;
+    /** Search quality: 'fast', 'balanced', 'accurate', 'perfect', 'auto', or 'custom:<ef>'. */
+    quality?: string;
 }
 /** Request for BM25 text search. */
 interface TextSearchRequest {
@@ -95,6 +126,8 @@ interface TextSearchRequest {
     query: string;
     /** Number of results to return. Default: 10. */
     topK?: number;
+    /** Optional metadata filter. */
+    filter?: Record<string, unknown>;
 }
 /** Request for hybrid (vector + text) search. */
 interface HybridSearchRequest {
@@ -108,6 +141,8 @@ interface HybridSearchRequest {
     topK?: number;
     /** Weight for vector results (0.0-1.0). Default: 0.5. */
     vectorWeight?: number;
+    /** Optional metadata filter. */
+    filter?: Record<string, unknown>;
 }
 /** Request for VelesQL query. */
 interface QueryRequest {
@@ -138,6 +173,8 @@ interface IndividualSearchRequest {
     topK?: number;
     /** Optional metadata filter. */
     filter?: Record<string, unknown>;
+    /** Search quality: 'fast', 'balanced', 'accurate', 'perfect', 'auto', or 'custom:<ef>'. */
+    quality?: string;
 }
 /** Request for batch search. */
 interface BatchSearchRequest {
@@ -147,7 +184,7 @@ interface BatchSearchRequest {
     searches: IndividualSearchRequest[];
 }
 /** Fusion strategy for multi-query search. */
-type FusionStrategy = 'rrf' | 'average' | 'maximum' | 'weighted';
+type FusionStrategy = 'rrf' | 'average' | 'maximum' | 'weighted' | 'relative_score';
 /** Fusion parameters for multi-query search. */
 interface FusionParams {
     /** RRF k parameter (default: 60). */
@@ -158,6 +195,10 @@ interface FusionParams {
     maxWeight?: number;
     /** Weighted fusion: hit weight (default: 0.1). */
     hitWeight?: number;
+    /** Relative score fusion: dense branch weight (default: 0.5). */
+    denseWeight?: number;
+    /** Relative score fusion: sparse branch weight (default: 0.5). */
+    sparseWeight?: number;
 }
 /** Request for multi-query fusion search. */
 interface MultiQuerySearchRequest {
@@ -167,7 +208,7 @@ interface MultiQuerySearchRequest {
     vectors: number[][];
     /** Number of results to return. Default: 10. */
     topK?: number;
-    /** Fusion strategy: 'rrf', 'average', 'maximum', 'weighted'. Default: 'rrf'. */
+    /** Fusion strategy: 'rrf', 'average', 'maximum', 'weighted', 'relative_score'. Default: 'rrf'. */
     fusion?: FusionStrategy;
     /** Fusion parameters. */
     fusionParams?: FusionParams;
@@ -199,6 +240,28 @@ interface SearchResponse {
     /** Query execution time in milliseconds. */
     timingMs: number;
 }
+/** Hybrid result from VelesQL queries (vector + graph + column data). */
+interface HybridResult {
+    /** Node/point ID. */
+    nodeId: number;
+    /** Vector similarity score (if applicable). */
+    vectorScore?: number;
+    /** Graph traversal score (if applicable). */
+    graphScore?: number;
+    /** Fused score combining vector and graph components. */
+    fusedScore: number;
+    /** Payload/bindings from the query. */
+    bindings?: Record<string, unknown>;
+    /** Column data from aggregation queries. */
+    columnData?: Record<string, unknown>;
+}
+/** Response from VelesQL query operations. */
+interface QueryResponse {
+    /** Query results. */
+    results: HybridResult[];
+    /** Query execution time in milliseconds. */
+    timingMs: number;
+}
 /** Error returned by plugin commands. */
 interface CommandError {
     /** Human-readable error message. */
@@ -378,21 +441,28 @@ declare function textSearch(request: TextSearchRequest): Promise<SearchResponse>
  */
 declare function hybridSearch(request: HybridSearchRequest): Promise<SearchResponse>;
 /**
- * Executes a VelesQL query.
+ * Executes a VelesQL query (SELECT, MATCH, DDL, DML).
  *
  * @param request - Query request with VelesQL string
- * @returns Search response with results and timing
+ * @returns Query response with hybrid results and timing
  * @throws {CommandError} If query syntax is invalid or collection doesn't exist
  *
  * @example
  * ```typescript
+ * // SELECT query
  * const response = await query({
- *   query: "SELECT * FROM documents WHERE content MATCH 'rust programming' LIMIT 10",
+ *   query: "SELECT * FROM documents WHERE vector NEAR $v LIMIT 10",
+ *   params: { v: queryEmbedding }
+ * });
+ *
+ * // MATCH (graph) query
+ * const response = await query({
+ *   query: "MATCH (d:Doc)-[:AUTHORED_BY]->(a:Person) RETURN a.name",
  *   params: {}
  * });
  * ```
  */
-declare function query(request: QueryRequest): Promise<SearchResponse>;
+declare function query(request: QueryRequest): Promise<QueryResponse>;
 /**
  * Retrieves points by their IDs.
  *
@@ -528,10 +598,13 @@ interface GetEdgesRequest {
 interface TraverseGraphRequest {
     collection: string;
     source: number;
-    maxDepth: number;
+    /** Maximum traversal depth. Default: 3. */
+    maxDepth?: number;
     relTypes?: string[];
-    limit: number;
-    algorithm: 'bfs' | 'dfs';
+    /** Maximum results to return. Default: 100. */
+    limit?: number;
+    /** Traversal algorithm. Default: 'bfs'. */
+    algorithm?: 'bfs' | 'dfs';
 }
 /** Request to get the degree of a node. */
 interface GetNodeDegreeRequest {
@@ -615,5 +688,190 @@ declare function traverseGraph(request: TraverseGraphRequest): Promise<Traversal
  * ```
  */
 declare function getNodeDegree(request: GetNodeDegreeRequest): Promise<NodeDegreeOutput>;
+/**
+ * Creates a graph collection with optional schema.
+ *
+ * @param request - Graph collection configuration
+ * @returns Collection info
+ * @throws {CommandError} If collection already exists or parameters are invalid
+ *
+ * @example
+ * ```typescript
+ * // Schemaless graph (default)
+ * const info = await createGraphCollection({ name: 'knowledge' });
+ *
+ * // Graph with embeddings
+ * const info = await createGraphCollection({
+ *   name: 'knowledge', dimension: 768, metric: 'cosine',
+ *   graphSchema: { schemaless: true }
+ * });
+ * ```
+ */
+declare function createGraphCollection(request: CreateGraphCollectionRequest): Promise<CollectionInfo>;
+/** Request to scroll through collection points. */
+interface ScrollRequest {
+    /** Target collection name. */
+    collection: string;
+    /** Cursor from a previous scroll (omit for the first batch). */
+    cursor?: number;
+    /** Number of points per batch. Default: 100. */
+    batchSize?: number;
+    /** Optional metadata filter. */
+    filter?: Record<string, unknown>;
+}
+/** Response from a scroll operation. */
+interface ScrollResponse {
+    /** Points in this batch. */
+    points: PointOutput[];
+    /** Cursor for the next batch (absent when no more points). */
+    nextCursor?: number;
+}
+/**
+ * Scrolls through collection points with cursor-based pagination.
+ *
+ * @param request - Scroll parameters
+ * @returns Batch of points and optional next cursor
+ * @throws {CommandError} If collection doesn't exist
+ *
+ * @example
+ * ```typescript
+ * let cursor: number | undefined;
+ * do {
+ *   const batch = await scrollCollection({ collection: 'docs', cursor, batchSize: 50 });
+ *   batch.points.forEach(p => console.log(p.id));
+ *   cursor = batch.nextCursor;
+ * } while (cursor !== undefined);
+ * ```
+ */
+declare function scrollCollection(request: ScrollRequest): Promise<ScrollResponse>;
+/** Request to store knowledge in semantic memory. */
+interface SemanticStoreRequest {
+    /** Unique ID for this knowledge fact. */
+    id: number;
+    /** Text content of the knowledge. */
+    content: string;
+    /** Embedding vector for the content. */
+    embedding: number[];
+}
+/** Request to query semantic memory. */
+interface SemanticQueryRequest {
+    /** Query embedding vector. */
+    embedding: number[];
+    /** Number of results to return. Default: 10. */
+    topK?: number;
+}
+/** Result from semantic memory query. */
+interface SemanticQueryResult {
+    /** Knowledge fact ID. */
+    id: number;
+    /** Similarity score. */
+    score: number;
+    /** Knowledge content text. */
+    content: string;
+}
+/**
+ * Stores a knowledge fact in semantic memory.
+ *
+ * @param request - Semantic store request
+ * @throws {CommandError} On storage failure
+ */
+declare function semanticStore(request: SemanticStoreRequest): Promise<void>;
+/**
+ * Queries semantic memory by similarity search.
+ *
+ * @param request - Semantic query request
+ * @returns Array of matching knowledge facts
+ */
+declare function semanticQuery(request: SemanticQueryRequest): Promise<SemanticQueryResult[]>;
+/** Request to record an episode. */
+interface EpisodicRecordRequest {
+    /** Episode event ID. */
+    eventId: number;
+    /** Episode description/content. */
+    content: string;
+    /** Timestamp (epoch seconds). */
+    timestamp: number;
+    /** Embedding vector for the episode. */
+    embedding: number[];
+}
+/** Request to query recent episodes. */
+interface EpisodicRecentRequest {
+    /** Number of recent episodes to return. Default: 10. */
+    limit?: number;
+    /** Only return episodes since this timestamp (epoch seconds). */
+    sinceTimestamp?: number;
+}
+/** Result from episodic memory query. */
+interface EpisodicResult {
+    /** Episode ID. */
+    id: number;
+    /** Episode content. */
+    content: string;
+    /** Timestamp (epoch seconds). */
+    timestamp: number;
+}
+/**
+ * Records an episode in episodic memory.
+ *
+ * @param request - Episode to record
+ * @throws {CommandError} On storage failure
+ */
+declare function episodicRecord(request: EpisodicRecordRequest): Promise<void>;
+/**
+ * Queries recent episodes from episodic memory.
+ *
+ * @param request - Query parameters (limit, since_timestamp)
+ * @returns Array of recent episodes
+ */
+declare function episodicRecent(request: EpisodicRecentRequest): Promise<EpisodicResult[]>;
+/** Request to learn a procedure. */
+interface ProceduralLearnRequest {
+    /** Procedure ID. */
+    procedureId: number;
+    /** Procedure name. */
+    name: string;
+    /** Steps to perform. */
+    steps: string[];
+    /** Embedding vector for the procedure. */
+    embedding: number[];
+    /** Confidence level (0.0-1.0). Default: 1.0. */
+    confidence?: number;
+}
+/** Request to recall procedures by similarity. */
+interface ProceduralRecallRequest {
+    /** Query embedding vector. */
+    embedding: number[];
+    /** Number of results. Default: 10. */
+    topK?: number;
+    /** Minimum confidence threshold. Default: 0.0. */
+    minConfidence?: number;
+}
+/** Result from procedural memory recall. */
+interface ProceduralMatchResult {
+    /** Procedure ID. */
+    id: number;
+    /** Procedure name. */
+    name: string;
+    /** Steps. */
+    steps: string[];
+    /** Confidence score. */
+    confidence: number;
+    /** Similarity score from vector search. */
+    score: number;
+}
+/**
+ * Learns a procedure in procedural memory.
+ *
+ * @param request - Procedure to learn
+ * @throws {CommandError} On storage failure
+ */
+declare function proceduralLearn(request: ProceduralLearnRequest): Promise<void>;
+/**
+ * Recalls procedures by similarity from procedural memory.
+ *
+ * @param request - Recall parameters
+ * @returns Array of matching procedures
+ */
+declare function proceduralRecall(request: ProceduralRecallRequest): Promise<ProceduralMatchResult[]>;
 
-export { type AddEdgeRequest, type BatchSearchRequest, type CollectionInfo, type CommandError, type CreateCollectionRequest, type CreateMetadataCollectionRequest, type DeletePointsRequest, type DistanceMetric, type EdgeOutput, type FusionParams, type FusionStrategy, type GetEdgesRequest, type GetNodeDegreeRequest, type GetPointsRequest, type HybridSearchRequest, type IndividualSearchRequest, type MetadataPointInput, type MultiQuerySearchRequest, type NodeDegreeOutput, type PointInput, type PointOutput, type QueryRequest, type SearchRequest, type SearchResponse, type SearchResult, type TextSearchRequest, type TraversalOutput, type TraverseGraphRequest, type UpsertMetadataRequest, type UpsertRequest, addEdge, batchSearch, createCollection, createMetadataCollection, deleteCollection, deletePoints, flush, getCollection, getEdges, getNodeDegree, getPoints, hybridSearch, isEmpty, listCollections, multiQuerySearch, query, search, textSearch, traverseGraph, upsert, upsertMetadata };
+export { type AddEdgeRequest, type BatchSearchRequest, type CollectionInfo, type CommandError, type CreateCollectionRequest, type CreateGraphCollectionRequest, type CreateMetadataCollectionRequest, type DeletePointsRequest, type DistanceMetric, type EdgeOutput, type EpisodicRecentRequest, type EpisodicRecordRequest, type EpisodicResult, type FusionParams, type FusionStrategy, type GetEdgesRequest, type GetNodeDegreeRequest, type GetPointsRequest, type HybridResult, type HybridSearchRequest, type IndividualSearchRequest, type MetadataPointInput, type MultiQuerySearchRequest, type NodeDegreeOutput, type PointInput, type PointOutput, type ProceduralLearnRequest, type ProceduralMatchResult, type ProceduralRecallRequest, type QueryRequest, type QueryResponse, type ScrollRequest, type ScrollResponse, type SearchRequest, type SearchResponse, type SearchResult, type SemanticQueryRequest, type SemanticQueryResult, type SemanticStoreRequest, type StorageMode, type TextSearchRequest, type TraversalOutput, type TraverseGraphRequest, type UpsertMetadataRequest, type UpsertRequest, addEdge, batchSearch, createCollection, createGraphCollection, createMetadataCollection, deleteCollection, deletePoints, episodicRecent, episodicRecord, flush, getCollection, getEdges, getNodeDegree, getPoints, hybridSearch, isEmpty, listCollections, multiQuerySearch, proceduralLearn, proceduralRecall, query, scrollCollection, search, semanticQuery, semanticStore, textSearch, traverseGraph, upsert, upsertMetadata };

package/dist/index.js

@@ -23,9 +23,12 @@ __export(index_exports, {
   addEdge: () => addEdge,
   batchSearch: () => batchSearch,
   createCollection: () => createCollection,
+  createGraphCollection: () => createGraphCollection,
   createMetadataCollection: () => createMetadataCollection,
   deleteCollection: () => deleteCollection,
   deletePoints: () => deletePoints,
+  episodicRecent: () => episodicRecent,
+  episodicRecord: () => episodicRecord,
   flush: () => flush,
   getCollection: () => getCollection,
   getEdges: () => getEdges,
@@ -35,8 +38,13 @@ __export(index_exports, {
   isEmpty: () => isEmpty,
   listCollections: () => listCollections,
   multiQuerySearch: () => multiQuerySearch,
+  proceduralLearn: () => proceduralLearn,
+  proceduralRecall: () => proceduralRecall,
   query: () => query,
+  scrollCollection: () => scrollCollection,
   search: () => search,
+  semanticQuery: () => semanticQuery,
+  semanticStore: () => semanticStore,
   textSearch: () => textSearch,
   traverseGraph: () => traverseGraph,
   upsert: () => upsert,
@@ -107,14 +115,41 @@ async function traverseGraph(request) {
 async function getNodeDegree(request) {
   return (0, import_core.invoke)("plugin:velesdb|get_node_degree", { request });
 }
+async function createGraphCollection(request) {
+  return (0, import_core.invoke)("plugin:velesdb|create_graph_collection", { request });
+}
+async function scrollCollection(request) {
+  return (0, import_core.invoke)("plugin:velesdb|scroll_collection", { request });
+}
+async function semanticStore(request) {
+  return (0, import_core.invoke)("plugin:velesdb|semantic_store", { request });
+}
+async function semanticQuery(request) {
+  return (0, import_core.invoke)("plugin:velesdb|semantic_query", { request });
+}
+async function episodicRecord(request) {
+  return (0, import_core.invoke)("plugin:velesdb|episodic_record", { request });
+}
+async function episodicRecent(request) {
+  return (0, import_core.invoke)("plugin:velesdb|episodic_recent", { request });
+}
+async function proceduralLearn(request) {
+  return (0, import_core.invoke)("plugin:velesdb|procedural_learn", { request });
+}
+async function proceduralRecall(request) {
+  return (0, import_core.invoke)("plugin:velesdb|procedural_recall", { request });
+}
 // Annotate the CommonJS export names for ESM import in node:
 0 && (module.exports = {
   addEdge,
   batchSearch,
   createCollection,
+  createGraphCollection,
   createMetadataCollection,
   deleteCollection,
   deletePoints,
+  episodicRecent,
+  episodicRecord,
   flush,
   getCollection,
   getEdges,
@@ -124,8 +159,13 @@ async function getNodeDegree(request) {
   isEmpty,
   listCollections,
   multiQuerySearch,
+  proceduralLearn,
+  proceduralRecall,
   query,
+  scrollCollection,
   search,
+  semanticQuery,
+  semanticStore,
   textSearch,
   traverseGraph,
   upsert,

package/dist/index.mjs

@@ -63,13 +63,40 @@ async function traverseGraph(request) {
 async function getNodeDegree(request) {
   return invoke("plugin:velesdb|get_node_degree", { request });
 }
+async function createGraphCollection(request) {
+  return invoke("plugin:velesdb|create_graph_collection", { request });
+}
+async function scrollCollection(request) {
+  return invoke("plugin:velesdb|scroll_collection", { request });
+}
+async function semanticStore(request) {
+  return invoke("plugin:velesdb|semantic_store", { request });
+}
+async function semanticQuery(request) {
+  return invoke("plugin:velesdb|semantic_query", { request });
+}
+async function episodicRecord(request) {
+  return invoke("plugin:velesdb|episodic_record", { request });
+}
+async function episodicRecent(request) {
+  return invoke("plugin:velesdb|episodic_recent", { request });
+}
+async function proceduralLearn(request) {
+  return invoke("plugin:velesdb|procedural_learn", { request });
+}
+async function proceduralRecall(request) {
+  return invoke("plugin:velesdb|procedural_recall", { request });
+}
 export {
   addEdge,
   batchSearch,
   createCollection,
+  createGraphCollection,
   createMetadataCollection,
   deleteCollection,
   deletePoints,
+  episodicRecent,
+  episodicRecord,
   flush,
   getCollection,
   getEdges,
@@ -79,8 +106,13 @@ export {
   isEmpty,
   listCollections,
   multiQuerySearch,
+  proceduralLearn,
+  proceduralRecall,
   query,
+  scrollCollection,
   search,
+  semanticQuery,
+  semanticStore,
   textSearch,
   traverseGraph,
   upsert,

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@wiscale/tauri-plugin-velesdb",
-  "version": "1.11.0",
+  "version": "1.13.0",
   "description": "TypeScript bindings for the VelesDB Tauri plugin - Vector search in desktop apps",
   "main": "dist/index.js",
   "module": "dist/index.mjs",
@@ -37,7 +37,7 @@
   "repository": {
     "type": "git",
     "url": "https://github.com/cyberlife-coder/VelesDB.git",
-    "directory": "integrations/tauri-plugin-velesdb/guest-js"
+    "directory": "crates/tauri-plugin-velesdb/guest-js"
   },
   "bugs": {
     "url": "https://github.com/cyberlife-coder/VelesDB/issues"