dbgraph 0.1.0

package/dist/search/query-utils.js

@@ -0,0 +1,203 @@
+"use strict";
+/**
+ * Query Utilities
+ *
+ * Scoring and relevance helpers for search results. These functions provide
+ * small numeric boosts that can be composed with FTS5 scores to improve
+ * result ranking for database schema objects.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.kindBonus = kindBonus;
+exports.scorePathRelevance = scorePathRelevance;
+exports.nameMatchBonus = nameMatchBonus;
+exports.computeAugmentedScore = computeAugmentedScore;
+exports.rerankResults = rerankResults;
+// =============================================================================
+// Constants
+// =============================================================================
+/**
+ * Base relevance bonus applied by kindBonus().
+ * Tables, views, and columns rank highest since they're the most
+ * commonly sought schema objects.
+ */
+const KIND_BONUSES = {
+    table: 0.15,
+    view: 0.15,
+    column: 0.12,
+    foreign_key: 0.10,
+    index: 0.08,
+    constraint: 0.08,
+    trigger: 0.06,
+    stored_procedure: 0.06,
+    function: 0.06,
+    sequence: 0.05,
+    schema: 0.04,
+    database: 0.03,
+};
+/**
+ * Default bonus for unrecognized or low-value kinds.
+ */
+const DEFAULT_KIND_BONUS = 0.02;
+// =============================================================================
+// kindBonus
+// =============================================================================
+/**
+ * Boost score for certain node kinds.
+ *
+ * Tables and views get the highest boost (0.15), columns are next (0.12),
+ * indexes and constraints get a moderate boost (0.08), and utility objects
+ * like triggers / functions / sequences get a smaller boost (0.05–0.06).
+ * Schema and database container nodes get a minimal boost (0.03–0.04).
+ *
+ * @param kind - The node kind string (e.g., "table", "column", "index").
+ * @returns A bonus value in [0.02, 0.15] to add to the base score.
+ */
+function kindBonus(kind) {
+    return KIND_BONUSES[kind.toLowerCase()] ?? DEFAULT_KIND_BONUS;
+}
+// =============================================================================
+// scorePathRelevance
+// =============================================================================
+/**
+ * Boost score when the query matches part of the node's source path.
+ *
+ * The filePath field (stored as `source` in graph terminology) is a URI
+ * like `db://@prod/public` or `db://host:5432/dbname/schema`. When a
+ * query token matches part of this path, it indicates the user is
+ * narrowing their search to a specific database or schema.
+ *
+ * Matching logic:
+ *  - Exact match of any path segment → 0.10 boost.
+ *  - Prefix match of any path segment → 0.05 boost.
+ *  - Substring match anywhere in path → 0.02 boost.
+ *  - No match → 0.
+ *
+ * @param filePath - The node's source path (Node.filePath).
+ * @param query    - The raw search query text.
+ * @returns A bonus value in [0, 0.10].
+ */
+function scorePathRelevance(filePath, query) {
+    if (!filePath || !query)
+        return 0;
+    const lowerPath = filePath.toLowerCase();
+    const tokens = query
+        .toLowerCase()
+        .split(/\s+/)
+        .filter((t) => t.length > 0);
+    if (tokens.length === 0)
+        return 0;
+    // Split the path into segments by / : @ .
+    const segments = lowerPath.split(/[/:@.#]+/).filter((s) => s.length > 0);
+    let best = 0;
+    for (const token of tokens) {
+        // Skip very short tokens to avoid noise
+        if (token.length < 2)
+            continue;
+        // Exact match against any segment
+        if (segments.some((seg) => seg === token)) {
+            best = Math.max(best, 0.10);
+            continue;
+        }
+        // Prefix match against any segment
+        if (segments.some((seg) => seg.startsWith(token))) {
+            best = Math.max(best, 0.05);
+            continue;
+        }
+        // Substring match anywhere in the path
+        if (lowerPath.includes(token)) {
+            best = Math.max(best, 0.02);
+        }
+    }
+    return best;
+}
+// =============================================================================
+// nameMatchBonus
+// =============================================================================
+/**
+ * Boost exact name matches over prefix or substring matches.
+ *
+ * When a query token matches a node's name with different degrees of
+ * specificity, this function returns a higher bonus for closer matches:
+ *
+ *  - Exact match (case-insensitive)         → 0.20
+ *  - Exact match of one token (multi-word)  → 0.15
+ *  - Prefix match (name starts with query)  → 0.10
+ *  - Substring match                        → 0.05
+ *  - No match                               → 0
+ *
+ * @param name  - The node's name (Node.name).
+ * @param query - The raw search query text.
+ * @returns A bonus value in [0, 0.20].
+ */
+function nameMatchBonus(name, query) {
+    if (!name || !query)
+        return 0;
+    const lowerName = name.toLowerCase();
+    const lowerQuery = query.toLowerCase().trim();
+    if (lowerQuery.length === 0)
+        return 0;
+    // Exact match (case-insensitive)
+    if (lowerName === lowerQuery)
+        return 0.20;
+    // Tokenize the query and check per-token exact matches
+    const queryTokens = lowerQuery.split(/\s+/).filter((t) => t.length > 0);
+    for (const token of queryTokens) {
+        if (token.length < 2)
+            continue;
+        if (lowerName === token)
+            return 0.15;
+    }
+    // Prefix match — query string is a prefix of the name
+    if (lowerName.startsWith(lowerQuery))
+        return 0.10;
+    // Check if any query token is a prefix of the name
+    for (const token of queryTokens) {
+        if (token.length >= 2 && lowerName.startsWith(token))
+            return 0.10;
+    }
+    // Substring match
+    if (lowerName.includes(lowerQuery))
+        return 0.05;
+    for (const token of queryTokens) {
+        if (token.length >= 2 && lowerName.includes(token))
+            return 0.05;
+    }
+    return 0;
+}
+// =============================================================================
+// Combined scoring helpers
+// =============================================================================
+/**
+ * Compute an augmented score for a single search result by composing the
+ * base relevance score with the kind, path, and name bonuses.
+ *
+ * This is useful when re-ranking results after retrieving them from
+ * QueryBuilder.searchNodes.
+ *
+ * @param result   - A SearchResult from QueryBuilder.
+ * @param query    - The original query text (for name/path relevance).
+ * @returns A new score with all applicable bonuses added.
+ */
+function computeAugmentedScore(result, query) {
+    const base = result.score;
+    const kindB = kindBonus(result.node.kind);
+    const pathB = scorePathRelevance(result.node.filePath, query);
+    const nameB = nameMatchBonus(result.node.name, query);
+    return base + kindB + pathB + nameB;
+}
+/**
+ * Re-rank an array of SearchResults by their augmented score in
+ * descending order. Mutates the input array in place.
+ *
+ * @param results - Search results to re-rank.
+ * @param query   - The original query text.
+ * @returns The same array (sorted in place) for chaining.
+ */
+function rerankResults(results, query) {
+    for (const r of results) {
+        r.score = computeAugmentedScore(r, query);
+    }
+    results.sort((a, b) => b.score - a.score);
+    return results;
+}
+//# sourceMappingURL=query-utils.js.map

package/dist/search/query-utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"query-utils.js","sourceRoot":"","sources":["../../src/search/query-utils.ts"],"names":[],"mappings":";AAAA;;;;;;GAMG;;AAgDH,8BAEC;AAwBD,gDAuCC;AAsBD,wCAiCC;AAiBD,sDAOC;AAUD,sCAMC;AA5MD,gFAAgF;AAChF,YAAY;AACZ,gFAAgF;AAEhF;;;;GAIG;AACH,MAAM,YAAY,GAA2B;IAC3C,KAAK,EAAE,IAAI;IACX,IAAI,EAAE,IAAI;IACV,MAAM,EAAE,IAAI;IACZ,WAAW,EAAE,IAAI;IACjB,KAAK,EAAE,IAAI;IACX,UAAU,EAAE,IAAI;IAChB,OAAO,EAAE,IAAI;IACb,gBAAgB,EAAE,IAAI;IACtB,QAAQ,EAAE,IAAI;IACd,QAAQ,EAAE,IAAI;IACd,MAAM,EAAE,IAAI;IACZ,QAAQ,EAAE,IAAI;CACf,CAAC;AAEF;;GAEG;AACH,MAAM,kBAAkB,GAAG,IAAI,CAAC;AAEhC,gFAAgF;AAChF,YAAY;AACZ,gFAAgF;AAEhF;;;;;;;;;;GAUG;AACH,SAAgB,SAAS,CAAC,IAAY;IACpC,OAAO,YAAY,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,IAAI,kBAAkB,CAAC;AAChE,CAAC;AAED,gFAAgF;AAChF,qBAAqB;AACrB,gFAAgF;AAEhF;;;;;;;;;;;;;;;;;GAiBG;AACH,SAAgB,kBAAkB,CAAC,QAAgB,EAAE,KAAa;IAChE,IAAI,CAAC,QAAQ,IAAI,CAAC,KAAK;QAAE,OAAO,CAAC,CAAC;IAElC,MAAM,SAAS,GAAG,QAAQ,CAAC,WAAW,EAAE,CAAC;IACzC,MAAM,MAAM,GAAG,KAAK;SACjB,WAAW,EAAE;SACb,KAAK,CAAC,KAAK,CAAC;SACZ,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAE/B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAElC,0CAA0C;IAC1C,MAAM,QAAQ,GAAG,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAEzE,IAAI,IAAI,GAAG,CAAC,CAAC;IAEb,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,wCAAwC;QACxC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS;QAE/B,kCAAkC;QAClC,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,KAAK,KAAK,CAAC,EAAE,CAAC;YAC1C,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAC5B,SAAS;QACX,CAAC;QAED,mCAAmC;QACnC,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YAClD,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAC5B,SAAS;QACX,CAAC;QAED,uCAAuC;QACvC,IAAI,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;YAC9B,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED,gFAAgF;AAChF,iBAAiB;AACjB,gFAAgF;AAEhF;;;;;;;;;;;;;;;GAeG;AACH,SAAgB,cAAc,CAAC,IAAY,EAAE,KAAa;IACxD,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK;QAAE,OAAO,CAAC,CAAC;IAE9B,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IACrC,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;IAE9C,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEtC,iCAAiC;IACjC,IAAI,SAAS,KAAK,UAAU;QAAE,OAAO,IAAI,CAAC;IAE1C,uDAAuD;IACvD,MAAM,WAAW,GAAG,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACxE,KAAK,MAAM,KAAK,IAAI,WAAW,EAAE,CAAC;QAChC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS;QAC/B,IAAI,SAAS,KAAK,KAAK;YAAE,OAAO,IAAI,CAAC;IACvC,CAAC;IAED,sDAAsD;IACtD,IAAI,SAAS,CAAC,UAAU,CAAC,UAAU,CAAC;QAAE,OAAO,IAAI,CAAC;IAElD,mDAAmD;IACnD,KAAK,MAAM,KAAK,IAAI,WAAW,EAAE,CAAC;QAChC,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,IAAI,SAAS,CAAC,UAAU,CAAC,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;IACpE,CAAC;IAED,kBAAkB;IAClB,IAAI,SAAS,CAAC,QAAQ,CAAC,UAAU,CAAC;QAAE,OAAO,IAAI,CAAC;IAChD,KAAK,MAAM,KAAK,IAAI,WAAW,EAAE,CAAC;QAChC,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,IAAI,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;IAClE,CAAC;IAED,OAAO,CAAC,CAAC;AACX,CAAC;AAED,gFAAgF;AAChF,2BAA2B;AAC3B,gFAAgF;AAEhF;;;;;;;;;;GAUG;AACH,SAAgB,qBAAqB,CAAC,MAAoB,EAAE,KAAa;IACvE,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC;IAC1B,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1C,MAAM,KAAK,GAAG,kBAAkB,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IAC9D,MAAM,KAAK,GAAG,cAAc,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAEtD,OAAO,IAAI,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACtC,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,aAAa,CAAC,OAAuB,EAAE,KAAa;IAClE,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,CAAC,CAAC,KAAK,GAAG,qBAAqB,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAC5C,CAAC;IACD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAC1C,OAAO,OAAO,CAAC;AACjB,CAAC"}

package/dist/types.d.ts

@@ -0,0 +1,279 @@
+/**
+ * DBGraph Type Definitions
+ *
+ * Core types for the database schema knowledge graph system.
+ */
+/**
+ * Types of nodes in the database knowledge graph.
+ */
+export declare const NODE_KINDS: readonly ["server", "database", "schema", "table", "view", "column", "index", "trigger", "stored_procedure", "function", "sequence", "constraint", "foreign_key", "module", "namespace"];
+export type NodeKind = (typeof NODE_KINDS)[number];
+/**
+ * Types of edges (relationships) between nodes
+ */
+export type EdgeKind = 'contains' | 'references' | 'primary_key' | 'foreign_key' | 'indexed_by' | 'depends_on' | 'imports' | 'exports';
+/**
+ * Database engine types
+ */
+export declare const DB_ENGINES: readonly ["postgresql", "mysql", "mariadb", "mssql", "sqlite", "oracle", "mongodb"];
+export type DbEngine = (typeof DB_ENGINES)[number];
+/**
+ * A node in the database knowledge graph representing a schema object
+ */
+export interface Node {
+    /** Unique identifier (hash of source URI + qualified name) */
+    id: string;
+    /** Type of schema object */
+    kind: NodeKind;
+    /** Simple name (e.g., "orders", "total_amount") */
+    name: string;
+    /** Fully qualified name (e.g., "ecommerce.public.orders.total_amount") */
+    qualifiedName: string;
+    /** Source identifier: db://@alias/schema or db://host:port/db/schema */
+    filePath: string;
+    /** Database engine */
+    language: string;
+    /** Starting line number (for views/SPs that have source) */
+    startLine: number;
+    endLine: number;
+    /** Additional properties as JSON object */
+    metadata?: Record<string, unknown>;
+    /** DDL / definition string (e.g., CREATE VIEW statement, column definition) */
+    signature?: string;
+    /** Comment / description */
+    docstring?: string;
+    /** When the node was last updated */
+    updatedAt: number;
+}
+/**
+ * An edge representing a relationship between two schema objects
+ */
+export interface Edge {
+    /** Source node ID */
+    source: string;
+    /** Target node ID */
+    target: string;
+    /** Type of relationship */
+    kind: EdgeKind;
+    /** Additional context about the relationship */
+    metadata?: Record<string, unknown>;
+    /** How this edge was created */
+    provenance?: 'introspect' | 'heuristic' | 'manual';
+}
+/**
+ * Metadata about a tracked database
+ */
+export interface DbSourceRecord {
+    /** Unique alias (as defined in config) */
+    alias: string;
+    /** Database engine type */
+    engine: DbEngine;
+    /** Database name */
+    database: string;
+    /** Host (for network DBs) */
+    host?: string;
+    /** Port */
+    port?: number;
+    /** Connection URI for display */
+    displayUri: string;
+    /** When last indexed */
+    indexedAt: number;
+    /** Number of nodes extracted from this source */
+    nodeCount: number;
+    /** Any extraction errors */
+    errors?: string[];
+}
+/**
+ * Result from introspecting a database
+ */
+export interface IntrospectResult {
+    /** Extracted nodes */
+    nodes: Node[];
+    /** Extracted edges */
+    edges: Edge[];
+    /** Extraction duration in milliseconds */
+    durationMs: number;
+    /** Any errors during extraction */
+    errors: string[];
+}
+/**
+ * Database connection config (from config file)
+ */
+export interface DbConnectionConfig {
+    /** Unique alias for this database */
+    alias: string;
+    /** Database engine */
+    engine: DbEngine;
+    /** Hostname or IP */
+    host?: string;
+    /** Port number */
+    port?: number;
+    /** Database name */
+    database: string;
+    /** Schemas to include (default: all) */
+    schemas?: string[];
+    /** Path for file-based DBs (SQLite) */
+    path?: string;
+    /** Authentication method */
+    auth?: string;
+    /** SSL settings */
+    ssl?: boolean;
+}
+/**
+ * A subgraph containing a subset of the knowledge graph
+ */
+export interface Subgraph {
+    /** Nodes in this subgraph */
+    nodes: Map<string, Node>;
+    /** Edges in this subgraph */
+    edges: Edge[];
+    /** Root node IDs (entry points) */
+    roots: string[];
+}
+/**
+ * Options for graph traversal
+ */
+export interface TraversalOptions {
+    /** Maximum depth to traverse (default: Infinity) */
+    maxDepth?: number;
+    /** Edge types to follow (default: all) */
+    edgeKinds?: EdgeKind[];
+    /** Node types to include (default: all) */
+    nodeKinds?: NodeKind[];
+    /** Direction of traversal */
+    direction?: 'outgoing' | 'incoming' | 'both';
+    /** Maximum nodes to return */
+    limit?: number;
+    /** Whether to include the starting node */
+    includeStart?: boolean;
+}
+/**
+ * Options for searching the graph
+ */
+export interface SearchOptions {
+    /** Node types to search */
+    kinds?: NodeKind[];
+    /** Source filter (db://@alias prefix) */
+    source?: string;
+    /** Maximum results to return */
+    limit?: number;
+    /** Offset for pagination */
+    offset?: number;
+    /** Whether search is case-sensitive */
+    caseSensitive?: boolean;
+}
+/**
+ * A search result with relevance scoring
+ */
+export interface SearchResult {
+    /** Matching node */
+    node: Node;
+    /** Relevance score (0-1) */
+    score: number;
+    /** Matched text snippets for highlighting */
+    highlights?: string[];
+}
+/**
+ * Context information for schema understanding
+ */
+export interface Context {
+    /** Primary node being examined */
+    focal: Node;
+    /** Nodes containing the focal node (database, schema, table) */
+    ancestors: Node[];
+    /** Nodes directly contained by focal node */
+    children: Node[];
+    /** Incoming references (what references this node) */
+    incomingRefs: Array<{
+        node: Node;
+        edge: Edge;
+    }>;
+    /** Outgoing references (what this node references) */
+    outgoingRefs: Array<{
+        node: Node;
+        edge: Edge;
+    }>;
+}
+/**
+ * Full schema description for a table (composed from graph)
+ */
+export interface TableSchema {
+    /** Table name */
+    name: string;
+    /** Qualified name */
+    qualifiedName: string;
+    /** Database source */
+    source: string;
+    /** Table comment */
+    comment?: string;
+    /** Columns */
+    columns: ColumnSchema[];
+    /** Primary key columns */
+    primaryKey: string[];
+    /** Foreign keys */
+    foreignKeys: ForeignKeySchema[];
+    /** Indexes */
+    indexes: IndexSchema[];
+    /** Table type (table, view) */
+    kind: 'table' | 'view';
+    /** View DDL if applicable */
+    definition?: string;
+}
+/**
+ * Column schema
+ */
+export interface ColumnSchema {
+    name: string;
+    dataType: string;
+    isNullable: boolean;
+    defaultValue?: string;
+    isPrimaryKey: boolean;
+    maxLength?: number;
+    numericPrecision?: number;
+    numericScale?: number;
+    comment?: string;
+    charSet?: string;
+    collation?: string;
+    autoIncrement?: boolean;
+}
+/**
+ * Foreign key relationship
+ */
+export interface ForeignKeySchema {
+    constraintName: string;
+    columns: string[];
+    referencedTable: string;
+    referencedColumns: string[];
+    onUpdate?: string;
+    onDelete?: string;
+}
+/**
+ * Index information
+ */
+export interface IndexSchema {
+    name: string;
+    columns: string[];
+    unique: boolean;
+    primary: boolean;
+    method?: string;
+}
+/**
+ * Statistics about the knowledge graph
+ */
+export interface GraphStats {
+    /** Total number of nodes */
+    nodeCount: number;
+    /** Total number of edges */
+    edgeCount: number;
+    /** Number of tracked databases */
+    dbCount: number;
+    /** Node counts by kind */
+    nodesByKind: Record<string, number>;
+    /** Edge counts by kind */
+    edgesByKind: Record<string, number>;
+    /** Database size in bytes */
+    dbSizeBytes: number;
+    /** Last update timestamp */
+    lastUpdated: number;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAMH;;GAEG;AACH,eAAO,MAAM,UAAU,0LAqBb,CAAC;AAEX,MAAM,MAAM,QAAQ,GAAG,CAAC,OAAO,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC;AAEnD;;GAEG;AACH,MAAM,MAAM,QAAQ,GAEhB,UAAU,GAGV,YAAY,GACZ,aAAa,GACb,aAAa,GACb,YAAY,GACZ,YAAY,GAGZ,SAAS,GACT,SAAS,CAAC;AAEd;;GAEG;AACH,eAAO,MAAM,UAAU,qFAQb,CAAC;AAEX,MAAM,MAAM,QAAQ,GAAG,CAAC,OAAO,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC;AAMnD;;GAEG;AACH,MAAM,WAAW,IAAI;IACnB,8DAA8D;IAC9D,EAAE,EAAE,MAAM,CAAC;IAEX,4BAA4B;IAC5B,IAAI,EAAE,QAAQ,CAAC;IAEf,mDAAmD;IACnD,IAAI,EAAE,MAAM,CAAC;IAEb,0EAA0E;IAC1E,aAAa,EAAE,MAAM,CAAC;IAEtB,wEAAwE;IACxE,QAAQ,EAAE,MAAM,CAAC;IAEjB,sBAAsB;IACtB,QAAQ,EAAE,MAAM,CAAC;IAEjB,4DAA4D;IAC5D,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAEhB,2CAA2C;IAC3C,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAEnC,+EAA+E;IAC/E,SAAS,CAAC,EAAE,MAAM,CAAC;IAEnB,4BAA4B;IAC5B,SAAS,CAAC,EAAE,MAAM,CAAC;IAEnB,qCAAqC;IACrC,SAAS,EAAE,MAAM,CAAC;CACnB;AAED;;GAEG;AACH,MAAM,WAAW,IAAI;IACnB,qBAAqB;IACrB,MAAM,EAAE,MAAM,CAAC;IAEf,qBAAqB;IACrB,MAAM,EAAE,MAAM,CAAC;IAEf,2BAA2B;IAC3B,IAAI,EAAE,QAAQ,CAAC;IAEf,gDAAgD;IAChD,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAEnC,gCAAgC;IAChC,UAAU,CAAC,EAAE,YAAY,GAAG,WAAW,GAAG,QAAQ,CAAC;CACpD;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,0CAA0C;IAC1C,KAAK,EAAE,MAAM,CAAC;IAEd,2BAA2B;IAC3B,MAAM,EAAE,QAAQ,CAAC;IAEjB,oBAAoB;IACpB,QAAQ,EAAE,MAAM,CAAC;IAEjB,6BAA6B;IAC7B,IAAI,CAAC,EAAE,MAAM,CAAC;IAEd,WAAW;IACX,IAAI,CAAC,EAAE,MAAM,CAAC;IAEd,iCAAiC;IACjC,UAAU,EAAE,MAAM,CAAC;IAEnB,wBAAwB;IACxB,SAAS,EAAE,MAAM,CAAC;IAElB,iDAAiD;IACjD,SAAS,EAAE,MAAM,CAAC;IAElB,4BAA4B;IAC5B,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;CACnB;AAMD;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,sBAAsB;IACtB,KAAK,EAAE,IAAI,EAAE,CAAC;IAEd,sBAAsB;IACtB,KAAK,EAAE,IAAI,EAAE,CAAC;IAEd,0CAA0C;IAC1C,UAAU,EAAE,MAAM,CAAC;IAEnB,mCAAmC;IACnC,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAED;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC,qCAAqC;IACrC,KAAK,EAAE,MAAM,CAAC;IAEd,sBAAsB;IACtB,MAAM,EAAE,QAAQ,CAAC;IAEjB,qBAAqB;IACrB,IAAI,CAAC,EAAE,MAAM,CAAC;IAEd,kBAAkB;IAClB,IAAI,CAAC,EAAE,MAAM,CAAC;IAEd,oBAAoB;IACpB,QAAQ,EAAE,MAAM,CAAC;IAEjB,wCAAwC;IACxC,OAAO,CAAC,EAAE,MAAM,EAAE,CAAC;IAEnB,uCAAuC;IACvC,IAAI,CAAC,EAAE,MAAM,CAAC;IAEd,4BAA4B;IAC5B,IAAI,CAAC,EAAE,MAAM,CAAC;IAEd,mBAAmB;IACnB,GAAG,CAAC,EAAE,OAAO,CAAC;CACf;AAMD;;GAEG;AACH,MAAM,WAAW,QAAQ;IACvB,6BAA6B;IAC7B,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAEzB,6BAA6B;IAC7B,KAAK,EAAE,IAAI,EAAE,CAAC;IAEd,mCAAmC;IACnC,KAAK,EAAE,MAAM,EAAE,CAAC;CACjB;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,oDAAoD;IACpD,QAAQ,CAAC,EAAE,MAAM,CAAC;IAElB,0CAA0C;IAC1C,SAAS,CAAC,EAAE,QAAQ,EAAE,CAAC;IAEvB,2CAA2C;IAC3C,SAAS,CAAC,EAAE,QAAQ,EAAE,CAAC;IAEvB,6BAA6B;IAC7B,SAAS,CAAC,EAAE,UAAU,GAAG,UAAU,GAAG,MAAM,CAAC;IAE7C,8BAA8B;IAC9B,KAAK,CAAC,EAAE,MAAM,CAAC;IAEf,2CAA2C;IAC3C,YAAY,CAAC,EAAE,OAAO,CAAC;CACxB;AAED;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,2BAA2B;IAC3B,KAAK,CAAC,EAAE,QAAQ,EAAE,CAAC;IAEnB,yCAAyC;IACzC,MAAM,CAAC,EAAE,MAAM,CAAC;IAEhB,gCAAgC;IAChC,KAAK,CAAC,EAAE,MAAM,CAAC;IAEf,4BAA4B;IAC5B,MAAM,CAAC,EAAE,MAAM,CAAC;IAEhB,uCAAuC;IACvC,aAAa,CAAC,EAAE,OAAO,CAAC;CACzB;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,oBAAoB;IACpB,IAAI,EAAE,IAAI,CAAC;IAEX,4BAA4B;IAC5B,KAAK,EAAE,MAAM,CAAC;IAEd,6CAA6C;IAC7C,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;CACvB;AAMD;;GAEG;AACH,MAAM,WAAW,OAAO;IACtB,kCAAkC;IAClC,KAAK,EAAE,IAAI,CAAC;IAEZ,gEAAgE;IAChE,SAAS,EAAE,IAAI,EAAE,CAAC;IAElB,6CAA6C;IAC7C,QAAQ,EAAE,IAAI,EAAE,CAAC;IAEjB,sDAAsD;IACtD,YAAY,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,IAAI,CAAC;QAAC,IAAI,EAAE,IAAI,CAAA;KAAE,CAAC,CAAC;IAEhD,sDAAsD;IACtD,YAAY,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,IAAI,CAAC;QAAC,IAAI,EAAE,IAAI,CAAA;KAAE,CAAC,CAAC;CACjD;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,iBAAiB;IACjB,IAAI,EAAE,MAAM,CAAC;IAEb,qBAAqB;IACrB,aAAa,EAAE,MAAM,CAAC;IAEtB,sBAAsB;IACtB,MAAM,EAAE,MAAM,CAAC;IAEf,oBAAoB;IACpB,OAAO,CAAC,EAAE,MAAM,CAAC;IAEjB,cAAc;IACd,OAAO,EAAE,YAAY,EAAE,CAAC;IAExB,0BAA0B;IAC1B,UAAU,EAAE,MAAM,EAAE,CAAC;IAErB,mBAAmB;IACnB,WAAW,EAAE,gBAAgB,EAAE,CAAC;IAEhC,cAAc;IACd,OAAO,EAAE,WAAW,EAAE,CAAC;IAEvB,+BAA+B;IAC/B,IAAI,EAAE,OAAO,GAAG,MAAM,CAAC;IAEvB,6BAA6B;IAC7B,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,OAAO,CAAC;IACpB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,YAAY,EAAE,OAAO,CAAC;IACtB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,aAAa,CAAC,EAAE,OAAO,CAAC;CACzB;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,cAAc,EAAE,MAAM,CAAC;IACvB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,eAAe,EAAE,MAAM,CAAC;IACxB,iBAAiB,EAAE,MAAM,EAAE,CAAC;IAC5B,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,MAAM,EAAE,OAAO,CAAC;IAChB,OAAO,EAAE,OAAO,CAAC;IACjB,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAMD;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB,4BAA4B;IAC5B,SAAS,EAAE,MAAM,CAAC;IAElB,4BAA4B;IAC5B,SAAS,EAAE,MAAM,CAAC;IAElB,kCAAkC;IAClC,OAAO,EAAE,MAAM,CAAC;IAEhB,0BAA0B;IAC1B,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAEpC,0BAA0B;IAC1B,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAEpC,6BAA6B;IAC7B,WAAW,EAAE,MAAM,CAAC;IAEpB,4BAA4B;IAC5B,WAAW,EAAE,MAAM,CAAC;CACrB"}

package/dist/types.js

@@ -0,0 +1,47 @@
+"use strict";
+/**
+ * DBGraph Type Definitions
+ *
+ * Core types for the database schema knowledge graph system.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DB_ENGINES = exports.NODE_KINDS = void 0;
+// =============================================================================
+// Union Types
+// =============================================================================
+/**
+ * Types of nodes in the database knowledge graph.
+ */
+exports.NODE_KINDS = [
+    // Container / namespace
+    'server',
+    'database',
+    'schema',
+    // Schema objects
+    'table',
+    'view',
+    'column',
+    'index',
+    'trigger',
+    'stored_procedure',
+    'function',
+    'sequence',
+    'constraint',
+    'foreign_key',
+    // Legacy code-symbol kinds kept for graph-generic query compatibility
+    'module',
+    'namespace',
+];
+/**
+ * Database engine types
+ */
+exports.DB_ENGINES = [
+    'postgresql',
+    'mysql',
+    'mariadb',
+    'mssql',
+    'sqlite',
+    'oracle',
+    'mongodb',
+];
+//# sourceMappingURL=types.js.map

package/dist/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":";AAAA;;;;GAIG;;;AAEH,gFAAgF;AAChF,cAAc;AACd,gFAAgF;AAEhF;;GAEG;AACU,QAAA,UAAU,GAAG;IACxB,wBAAwB;IACxB,QAAQ;IACR,UAAU;IACV,QAAQ;IAER,iBAAiB;IACjB,OAAO;IACP,MAAM;IACN,QAAQ;IACR,OAAO;IACP,SAAS;IACT,kBAAkB;IAClB,UAAU;IACV,UAAU;IACV,YAAY;IACZ,aAAa;IAEb,sEAAsE;IACtE,QAAQ;IACR,WAAW;CACH,CAAC;AAsBX;;GAEG;AACU,QAAA,UAAU,GAAG;IACxB,YAAY;IACZ,OAAO;IACP,SAAS;IACT,OAAO;IACP,QAAQ;IACR,QAAQ;IACR,SAAS;CACD,CAAC"}

package/dist/utils.d.ts

@@ -0,0 +1,40 @@
+/**
+ * DBGraph Utilities
+ */
+/**
+ * Safely parse JSON with a fallback value
+ */
+export declare function safeJsonParse<T>(value: string, fallback: T): T;
+/**
+ * Cross-process file lock
+ */
+export declare class FileLock {
+    private lockPath;
+    private held;
+    private static readonly STALE_TIMEOUT_MS;
+    constructor(lockPath: string);
+    acquire(): void;
+    release(): void;
+    withLock<T>(fn: () => T): T;
+    withLockAsync<T>(fn: () => Promise<T>): Promise<T>;
+    private isProcessAlive;
+}
+/**
+ * Simple mutex lock
+ */
+export declare class Mutex {
+    private locked;
+    private waitQueue;
+    acquire(): Promise<() => void>;
+    withLock<T>(fn: () => Promise<T> | T): Promise<T>;
+    isLocked(): boolean;
+}
+/**
+ * Generate a stable hash string from input
+ */
+export declare function hashString(input: string): string;
+/**
+ * Escape identifier for SQL display
+ */
+export declare function quoteIdentifier(name: string, engine: string): string;
+//# sourceMappingURL=utils.d.ts.map

package/dist/utils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"utils.d.ts","sourceRoot":"","sources":["../src/utils.ts"],"names":[],"mappings":"AAAA;;GAEG;AAIH;;GAEG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,GAAG,CAAC,CAM9D;AAED;;GAEG;AACH,qBAAa,QAAQ;IACnB,OAAO,CAAC,QAAQ,CAAS;IACzB,OAAO,CAAC,IAAI,CAAS;IACrB,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,gBAAgB,CAAiB;gBAE7C,QAAQ,EAAE,MAAM;IAI5B,OAAO,IAAI,IAAI;IAqCf,OAAO,IAAI,IAAI;IAWf,QAAQ,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC;IAKrB,aAAa,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;IAKxD,OAAO,CAAC,cAAc;CAIvB;AAED;;GAEG;AACH,qBAAa,KAAK;IAChB,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,SAAS,CAAyB;IAEpC,OAAO,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC;IAY9B,QAAQ,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;IAKvD,QAAQ,IAAI,OAAO;CACpB;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAQhD;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAGpE"}