rete-graph 0.3.6 → 0.3.7

package/index.d.ts

@@ -27,6 +27,32 @@ export type RawQuad = [string, string, string, string | null];
 export interface QueryOptions {
   /** OWL 2 QL entailment by query rewriting. */
   reason?: boolean;
+  /**
+   * Run one chunk of a split query (see `Graph.partitionPlan`): only the
+   * solutions whose `var` is one of `keys` (term tokens as the plan's keys
+   * query returned them), without the query's top-level OFFSET/LIMIT.
+   */
+  partition?: { var: string; keys: string[] };
+}
+
+/** How to run a query as chunks split by one variable — `Graph.partitionPlan`. */
+export interface PartitionPlan {
+  /** The variable split on, without its `?`. */
+  var: string;
+  form: "select" | "construct";
+  /** `SELECT DISTINCT ?var …`: a superset of the values the variable takes. */
+  keys_query: string;
+  /**
+   * Where the keys query lists them from: the query's own `VALUES` list on the
+   * variable (no read), the cheapest constant pattern on it (one scan), or —
+   * when neither exists — the whole WHERE clause (as costly as the query).
+   */
+  keys_from: "values" | "pattern" | "where";
+  /** The query's OFFSET/LIMIT, which the chunks drop: apply them once to the merged rows. */
+  offset: number;
+  limit: number | null;
+  /** Two chunks can yield the same row: deduplicate the merged rows. */
+  dedupe: boolean;
 }
 
 /**
@@ -124,6 +150,15 @@ export class Graph {
    * when there is nothing to report. Results are never changed by them.
    */
   lastWarnings(): QueryWarning[];
+  /**
+   * Plan running `query` as chunks split by the values of `variable`, or throw
+   * saying why that would change the answer (ORDER BY, an aggregate not
+   * grouped by it, a variable some row leaves unbound, ASK, DESCRIBE). Run
+   * `plan.keys_query`, then each chunk of keys with `queryRaw(query,
+   * {partition: {var, keys}})`; concatenate in key order, deduplicate if
+   * `plan.dedupe`, then apply `plan.offset` / `plan.limit`.
+   */
+  partitionPlan(query: string, variable: string): PartitionPlan;
   prefixSearch(prefix: string, limit?: number): { label: string; subject: string }[];
   textSearch(
     words: string | string[],

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "rete-graph",
-  "version": "0.3.6",
+  "version": "0.3.7",
   "description": "Query local and remote .rete graph files with SPARQL — WebAssembly client for browsers and Node, with lazy byte-range reads over HTTP and local files.",
   "license": "Apache-2.0",
   "repository": {