@duckcodeailabs/dql-core 0.8.9 → 0.8.11

package/dist/lineage/query.js

@@ -1,211 +1,116 @@
-/**
- * Lineage Query Engine — focused, searchable lineage views.
- *
- * Replaces the "show everything" approach with targeted subgraph queries:
- * - Focus on a specific node and get its upstream/downstream chain
- * - Search nodes by name across all types
- * - Filter by type, domain, depth
- */
-// ---- Node ID Resolution ----
-/** Type prefixes to try when resolving a name to a node ID */
 const NODE_PREFIXES = [
-    'block:',
-    'metric:',
-    'table:',
-    'dbt_model:',
-    'dbt_source:',
-    'dashboard:',
-    'dimension:',
-    'chart:',
-    'domain:',
+    'block',
+    'dashboard',
+    'dbt_model',
+    'dbt_source',
+    'source_table',
+    'metric',
+    'dimension',
+    'domain',
+    'chart',
 ];
-/**
- * Resolve a name or ID to a node in the graph.
- * Tries exact match first, then prefixed matches.
- */
-function resolveNode(graph, nameOrId) {
-    // Exact match (already prefixed)
-    const exact = graph.getNode(nameOrId);
-    if (exact)
-        return exact;
-    // Try each prefix
-    for (const prefix of NODE_PREFIXES) {
-        const node = graph.getNode(`${prefix}${nameOrId}`);
-        if (node)
-            return node;
+export function queryLineage(graph, query) {
+    const matches = query.search ? searchLineage(graph, query.search) : [];
+    const focalNode = query.focus ? resolveFocusNode(graph, query.focus) : undefined;
+    let resultGraph = focalNode
+        ? buildFocusedSubgraph(graph, focalNode.id, query.upstreamDepth, query.downstreamDepth)
+        : graph;
+    if (query.types?.length || query.domain) {
+        const allowedTypes = query.types ? new Set(query.types) : null;
+        resultGraph = resultGraph.subgraph((node) => {
+            if (allowedTypes && !allowedTypes.has(node.type))
+                return false;
+            if (query.domain && node.domain !== query.domain)
+                return false;
+            return true;
+        });
     }
-    // Fuzzy: find first node whose name matches (case-insensitive)
-    const lower = nameOrId.toLowerCase();
-    for (const node of graph.getAllNodes()) {
-        if (node.name.toLowerCase() === lower)
-            return node;
+    if (!query.focus && query.search) {
+        const matchIds = new Set(matches.map((match) => match.node.id));
+        resultGraph = graph.subgraph((node) => {
+            if (query.domain && node.domain !== query.domain)
+                return false;
+            if (query.types?.length && !query.types.includes(node.type))
+                return false;
+            return matchIds.has(node.id);
+        });
     }
-    return undefined;
+    return {
+        graph: resultGraph.toJSON(),
+        focalNode,
+        matches,
+    };
 }
-// ---- Search Scoring ----
-function scoreMatch(nodeName, query) {
-    const name = nodeName.toLowerCase();
-    const q = query.toLowerCase();
-    if (name === q)
-        return 100; // exact match
-    if (name.startsWith(q))
-        return 80; // starts with
-    if (name.endsWith(q))
-        return 60; // ends with
-    if (name.includes(q))
-        return 40; // substring
-    return 0; // no match
+function buildFocusedSubgraph(graph, focusId, upstreamDepth, downstreamDepth) {
+    const includedIds = new Set([focusId]);
+    walkDirection(graph, focusId, 'upstream', normalizeDepth(upstreamDepth), includedIds);
+    walkDirection(graph, focusId, 'downstream', normalizeDepth(downstreamDepth), includedIds);
+    return graph.subgraph((node) => includedIds.has(node.id));
 }
-// ---- Depth-Limited BFS ----
-/**
- * BFS traversal with depth limiting.
- * direction='upstream' follows incoming edges, 'downstream' follows outgoing.
- */
-function depthLimitedBFS(graph, startId, direction, maxDepth) {
-    const visited = new Set();
+function walkDirection(graph, startId, direction, maxDepth, includedIds) {
     const queue = [{ id: startId, depth: 0 }];
+    const seen = new Set([startId]);
     while (queue.length > 0) {
-        const { id, depth } = queue.shift();
-        if (depth > maxDepth)
+        const current = queue.shift();
+        if (current.depth >= maxDepth)
             continue;
         const edges = direction === 'upstream'
-            ? graph.getIncomingEdges(id)
-            : graph.getOutgoingEdges(id);
+            ? graph.getIncomingEdges(current.id)
+            : graph.getOutgoingEdges(current.id);
         for (const edge of edges) {
             const nextId = direction === 'upstream' ? edge.source : edge.target;
-            if (!visited.has(nextId)) {
-                visited.add(nextId);
-                queue.push({ id: nextId, depth: depth + 1 });
-            }
+            if (seen.has(nextId))
+                continue;
+            seen.add(nextId);
+            includedIds.add(nextId);
+            queue.push({ id: nextId, depth: current.depth + 1 });
         }
     }
-    return visited;
 }
-// ---- Query Execution ----
-/**
- * Execute a lineage query against the graph.
- *
- * Examples:
- *   queryLineage(graph, { focus: 'total_revenue' })
- *     → subgraph centered on metric:total_revenue with full upstream/downstream
- *
- *   queryLineage(graph, { search: 'revenue' })
- *     → all nodes matching "revenue" with relevance scores
- *
- *   queryLineage(graph, { focus: 'fct_orders', upstreamDepth: 2, downstreamDepth: 1 })
- *     → 2 hops upstream, 1 hop downstream from dbt_model:fct_orders
- *
- *   queryLineage(graph, { domain: 'finance', types: ['metric', 'block'] })
- *     → all finance metrics and blocks with their immediate connections
- */
-export function queryLineage(graph, query) {
-    // Search mode: return matching nodes with scores
-    if (query.search && !query.focus) {
-        return executeSearch(graph, query);
-    }
-    // Focus mode: return subgraph centered on a node
-    if (query.focus) {
-        return executeFocus(graph, query);
-    }
-    // Filter mode: domain and/or type filter
-    if (query.domain || query.types) {
-        return executeFilter(graph, query);
-    }
-    // Default: return the full graph
-    return { graph: graph.toJSON() };
+function normalizeDepth(depth) {
+    return depth === undefined || !Number.isFinite(depth) || depth < 0
+        ? Number.POSITIVE_INFINITY
+        : depth;
 }
-function executeSearch(graph, query) {
-    const searchTerm = query.search;
-    const matches = [];
-    for (const node of graph.getAllNodes()) {
-        // Apply type filter
-        if (query.types && !query.types.includes(node.type))
-            continue;
-        // Apply domain filter
-        if (query.domain && node.domain !== query.domain)
-            continue;
-        const score = scoreMatch(node.name, searchTerm);
-        if (score > 0) {
-            matches.push({ node, score });
-        }
-    }
-    // Sort by score descending, then alphabetically
-    matches.sort((a, b) => b.score - a.score || a.node.name.localeCompare(b.node.name));
-    // Build a subgraph of matched nodes with their immediate edges
-    const matchedIds = new Set(matches.map((m) => m.node.id));
-    const sub = graph.subgraph((n) => matchedIds.has(n.id));
-    return {
-        graph: sub.toJSON(),
-        matches,
-    };
-}
-function executeFocus(graph, query) {
-    const focalNode = resolveNode(graph, query.focus);
-    if (!focalNode) {
-        return { graph: { nodes: [], edges: [] }, matches: [] };
+function resolveFocusNode(graph, rawFocus) {
+    if (graph.getNode(rawFocus))
+        return graph.getNode(rawFocus);
+    for (const prefix of NODE_PREFIXES) {
+        const candidate = graph.getNode(`${prefix}:${rawFocus}`);
+        if (candidate)
+            return candidate;
     }
-    const upstreamDepth = query.upstreamDepth ?? Infinity;
-    const downstreamDepth = query.downstreamDepth ?? Infinity;
-    // Collect all nodes in the focused subgraph
-    const nodeIds = new Set([focalNode.id]);
-    // Upstream BFS
-    const upstreamIds = depthLimitedBFS(graph, focalNode.id, 'upstream', upstreamDepth);
-    for (const id of upstreamIds)
-        nodeIds.add(id);
-    // Downstream BFS
-    const downstreamIds = depthLimitedBFS(graph, focalNode.id, 'downstream', downstreamDepth);
-    for (const id of downstreamIds)
-        nodeIds.add(id);
-    // Apply type/domain filters if specified
-    const sub = graph.subgraph((n) => {
-        if (!nodeIds.has(n.id))
-            return false;
-        if (query.types && !query.types.includes(n.type) && n.id !== focalNode.id)
-            return false;
-        if (query.domain && n.domain !== query.domain && n.id !== focalNode.id)
-            return false;
-        return true;
-    });
-    return {
-        graph: sub.toJSON(),
-        focalNode,
-    };
+    const normalized = rawFocus.trim().toLowerCase();
+    return graph
+        .getAllNodes()
+        .find((node) => node.name.toLowerCase() === normalized);
 }
-function executeFilter(graph, query) {
-    // Get matching nodes
-    const matchedNodes = graph.getAllNodes().filter((n) => {
-        if (query.types && !query.types.includes(n.type))
-            return false;
-        if (query.domain && n.domain !== query.domain)
-            return false;
-        return true;
-    });
-    const matchedIds = new Set(matchedNodes.map((n) => n.id));
-    // Also include immediate neighbors to show connections
-    for (const node of matchedNodes) {
-        for (const edge of graph.getIncomingEdges(node.id)) {
-            matchedIds.add(edge.source);
-        }
-        for (const edge of graph.getOutgoingEdges(node.id)) {
-            matchedIds.add(edge.target);
-        }
-    }
-    const sub = graph.subgraph((n) => matchedIds.has(n.id));
-    return { graph: sub.toJSON() };
+function searchLineage(graph, rawTerm) {
+    const term = rawTerm.trim().toLowerCase();
+    if (!term)
+        return [];
+    return graph
+        .getAllNodes()
+        .map((node) => ({
+        node,
+        score: scoreMatch(node, term),
+    }))
+        .filter((entry) => entry.score > 0)
+        .sort((a, b) => b.score - a.score || a.node.name.localeCompare(b.node.name));
 }
-/**
- * Lightweight search — returns matching nodes without building a subgraph.
- * Suitable for autocomplete / search-as-you-type.
- */
-export function searchNodes(graph, searchTerm, limit = 20) {
-    const matches = [];
-    for (const node of graph.getAllNodes()) {
-        const score = scoreMatch(node.name, searchTerm);
-        if (score > 0) {
-            matches.push({ node, score });
-        }
-    }
-    matches.sort((a, b) => b.score - a.score || a.node.name.localeCompare(b.node.name));
-    return matches.slice(0, limit);
+function scoreMatch(node, term) {
+    const name = node.name.toLowerCase();
+    const id = node.id.toLowerCase();
+    if (name === term || id === term)
+        return 100;
+    if (name.startsWith(term))
+        return 75;
+    if (id.startsWith(term))
+        return 60;
+    if (name.includes(term))
+        return 40;
+    if (id.includes(term))
+        return 30;
+    return 0;
 }
 //# sourceMappingURL=query.js.map

package/dist/lineage/query.js.map

@@ -1 +1 @@
-{"version":3,"file":"query.js","sourceRoot":"","sources":["../../src/lineage/query.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AA8BH,+BAA+B;AAE/B,8DAA8D;AAC9D,MAAM,aAAa,GAAG;IACpB,QAAQ;IACR,SAAS;IACT,QAAQ;IACR,YAAY;IACZ,aAAa;IACb,YAAY;IACZ,YAAY;IACZ,QAAQ;IACR,SAAS;CACV,CAAC;AAEF;;;GAGG;AACH,SAAS,WAAW,CAAC,KAAmB,EAAE,QAAgB;IACxD,iCAAiC;IACjC,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IACtC,IAAI,KAAK;QAAE,OAAO,KAAK,CAAC;IAExB,kBAAkB;IAClB,KAAK,MAAM,MAAM,IAAI,aAAa,EAAE,CAAC;QACnC,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,MAAM,GAAG,QAAQ,EAAE,CAAC,CAAC;QACnD,IAAI,IAAI;YAAE,OAAO,IAAI,CAAC;IACxB,CAAC;IAED,+DAA+D;IAC/D,MAAM,KAAK,GAAG,QAAQ,CAAC,WAAW,EAAE,CAAC;IACrC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;QACvC,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,KAAK,KAAK;YAAE,OAAO,IAAI,CAAC;IACrD,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,2BAA2B;AAE3B,SAAS,UAAU,CAAC,QAAgB,EAAE,KAAa;IACjD,MAAM,IAAI,GAAG,QAAQ,CAAC,WAAW,EAAE,CAAC;IACpC,MAAM,CAAC,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IAE9B,IAAI,IAAI,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC,CAAa,cAAc;IACtD,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;QAAE,OAAO,EAAE,CAAC,CAAM,cAAc;IACtD,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,EAAE,CAAC,CAAQ,YAAY;IACpD,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,EAAE,CAAC,CAAQ,YAAY;IACpD,OAAO,CAAC,CAAC,CAAgC,WAAW;AACtD,CAAC;AAED,8BAA8B;AAE9B;;;GAGG;AACH,SAAS,eAAe,CACtB,KAAmB,EACnB,OAAe,EACf,SAAoC,EACpC,QAAgB;IAEhB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAyC,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;IAEhF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QACrC,IAAI,KAAK,GAAG,QAAQ;YAAE,SAAS;QAE/B,MAAM,KAAK,GAAG,SAAS,KAAK,UAAU;YACpC,CAAC,CAAC,KAAK,CAAC,gBAAgB,CAAC,EAAE,CAAC;YAC5B,CAAC,CAAC,KAAK,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;QAE/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,MAAM,GAAG,SAAS,KAAK,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;YACpE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACzB,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACpB,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,4BAA4B;AAE5B;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,YAAY,CAAC,KAAmB,EAAE,KAAmB;IACnE,iDAAiD;IACjD,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACjC,OAAO,aAAa,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IACrC,CAAC;IAED,iDAAiD;IACjD,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAChB,OAAO,YAAY,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IACpC,CAAC;IAED,yCAAyC;IACzC,IAAI,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAChC,OAAO,aAAa,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IACrC,CAAC;IAED,iCAAiC;IACjC,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;AACnC,CAAC;AAED,SAAS,aAAa,CAAC,KAAmB,EAAE,KAAmB;IAC7D,MAAM,UAAU,GAAG,KAAK,CAAC,MAAO,CAAC;IACjC,MAAM,OAAO,GAAgD,EAAE,CAAC;IAEhE,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;QACvC,oBAAoB;QACpB,IAAI,KAAK,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,SAAS;QAC9D,sBAAsB;QACtB,IAAI,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;YAAE,SAAS;QAE3D,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QAChD,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACd,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IAED,gDAAgD;IAChD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAEpF,+DAA+D;IAC/D,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1D,MAAM,GAAG,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAExD,OAAO;QACL,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE;QACnB,OAAO;KACR,CAAC;AACJ,CAAC;AAED,SAAS,YAAY,CAAC,KAAmB,EAAE,KAAmB;IAC5D,MAAM,SAAS,GAAG,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,KAAM,CAAC,CAAC;IACnD,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,OAAO,EAAE,KAAK,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;IAC1D,CAAC;IAED,MAAM,aAAa,GAAG,KAAK,CAAC,aAAa,IAAI,QAAQ,CAAC;IACtD,MAAM,eAAe,GAAG,KAAK,CAAC,eAAe,IAAI,QAAQ,CAAC;IAE1D,4CAA4C;IAC5C,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC;IAEhD,eAAe;IACf,MAAM,WAAW,GAAG,eAAe,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,UAAU,EAAE,aAAa,CAAC,CAAC;IACpF,KAAK,MAAM,EAAE,IAAI,WAAW;QAAE,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAE9C,iBAAiB;IACjB,MAAM,aAAa,GAAG,eAAe,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,YAAY,EAAE,eAAe,CAAC,CAAC;IAC1F,KAAK,MAAM,EAAE,IAAI,aAAa;QAAE,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAEhD,yCAAyC;IACzC,MAAM,GAAG,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE;QAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAAE,OAAO,KAAK,CAAC;QACrC,IAAI,KAAK,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC,EAAE;YAAE,OAAO,KAAK,CAAC;QACxF,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC,EAAE;YAAE,OAAO,KAAK,CAAC;QACrF,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;IAEH,OAAO;QACL,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE;QACnB,SAAS;KACV,CAAC;AACJ,CAAC;AAED,SAAS,aAAa,CAAC,KAAmB,EAAE,KAAmB;IAC7D,qBAAqB;IACrB,MAAM,YAAY,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QACpD,IAAI,KAAK,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC;YAAE,OAAO,KAAK,CAAC;QAC/D,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;YAAE,OAAO,KAAK,CAAC;QAC5D,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;IAEH,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAE1D,uDAAuD;IACvD,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;QAChC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACnD,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9B,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACnD,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,MAAM,GAAG,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAExD,OAAO,EAAE,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC;AACjC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,WAAW,CACzB,KAAmB,EACnB,UAAkB,EAClB,KAAK,GAAG,EAAE;IAEV,MAAM,OAAO,GAAgD,EAAE,CAAC;IAEhE,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QAChD,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACd,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IAED,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IACpF,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AACjC,CAAC"}
+{"version":3,"file":"query.js","sourceRoot":"","sources":["../../src/lineage/query.ts"],"names":[],"mappings":"AAiBA,MAAM,aAAa,GAAsB;IACvC,OAAO;IACP,WAAW;IACX,WAAW;IACX,YAAY;IACZ,cAAc;IACd,QAAQ;IACR,WAAW;IACX,QAAQ;IACR,OAAO;CACR,CAAC;AAEF,MAAM,UAAU,YAAY,CAAC,KAAmB,EAAE,KAAmB;IACnE,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACvE,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAEjF,IAAI,WAAW,GAAG,SAAS;QACzB,CAAC,CAAC,oBAAoB,CAClB,KAAK,EACL,SAAS,CAAC,EAAE,EACZ,KAAK,CAAC,aAAa,EACnB,KAAK,CAAC,eAAe,CACtB;QACH,CAAC,CAAC,KAAK,CAAC;IAEV,IAAI,KAAK,CAAC,KAAK,EAAE,MAAM,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QACxC,MAAM,YAAY,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC/D,WAAW,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC,IAAI,EAAE,EAAE;YAC1C,IAAI,YAAY,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC/D,IAAI,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;gBAAE,OAAO,KAAK,CAAC;YAC/D,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;IACL,CAAC;IAED,IAAI,CAAC,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QACjC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QAChE,WAAW,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,IAAI,EAAE,EAAE;YACpC,IAAI,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;gBAAE,OAAO,KAAK,CAAC;YAC/D,IAAI,KAAK,CAAC,KAAK,EAAE,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC1E,OAAO,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC/B,CAAC,CAAC,CAAC;IACL,CAAC;IAED,OAAO;QACL,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE;QAC3B,SAAS;QACT,OAAO;KACR,CAAC;AACJ,CAAC;AAED,SAAS,oBAAoB,CAC3B,KAAmB,EACnB,OAAe,EACf,aAAsB,EACtB,eAAwB;IAExB,MAAM,WAAW,GAAG,IAAI,GAAG,CAAS,CAAC,OAAO,CAAC,CAAC,CAAC;IAE/C,aAAa,CAAC,KAAK,EAAE,OAAO,EAAE,UAAU,EAAE,cAAc,CAAC,aAAa,CAAC,EAAE,WAAW,CAAC,CAAC;IACtF,aAAa,CAAC,KAAK,EAAE,OAAO,EAAE,YAAY,EAAE,cAAc,CAAC,eAAe,CAAC,EAAE,WAAW,CAAC,CAAC;IAE1F,OAAO,KAAK,CAAC,QAAQ,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;AAC5D,CAAC;AAED,SAAS,aAAa,CACpB,KAAmB,EACnB,OAAe,EACf,SAAoC,EACpC,QAAgB,EAChB,WAAwB;IAExB,MAAM,KAAK,GAAyC,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;IAChF,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,OAAO,CAAC,CAAC,CAAC;IAExC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC/B,IAAI,OAAO,CAAC,KAAK,IAAI,QAAQ;YAAE,SAAS;QAExC,MAAM,KAAK,GAAG,SAAS,KAAK,UAAU;YACpC,CAAC,CAAC,KAAK,CAAC,gBAAgB,CAAC,OAAO,CAAC,EAAE,CAAC;YACpC,CAAC,CAAC,KAAK,CAAC,gBAAgB,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAEvC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,MAAM,GAAG,SAAS,KAAK,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;YACpE,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,SAAS;YAC/B,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACjB,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACxB,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;QACvD,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,cAAc,CAAC,KAAyB;IAC/C,OAAO,KAAK,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC;QAChE,CAAC,CAAC,MAAM,CAAC,iBAAiB;QAC1B,CAAC,CAAC,KAAK,CAAC;AACZ,CAAC;AAED,SAAS,gBAAgB,CAAC,KAAmB,EAAE,QAAgB;IAC7D,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC;QAAE,OAAO,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IAE5D,KAAK,MAAM,MAAM,IAAI,aAAa,EAAE,CAAC;QACnC,MAAM,SAAS,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,MAAM,IAAI,QAAQ,EAAE,CAAC,CAAC;QACzD,IAAI,SAAS;YAAE,OAAO,SAAS,CAAC;IAClC,CAAC;IAED,MAAM,UAAU,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACjD,OAAO,KAAK;SACT,WAAW,EAAE;SACb,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,KAAK,UAAU,CAAC,CAAC;AAC5D,CAAC;AAED,SAAS,aAAa,CAAC,KAAmB,EAAE,OAAe;IACzD,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAC1C,IAAI,CAAC,IAAI;QAAE,OAAO,EAAE,CAAC;IAErB,OAAO,KAAK;SACT,WAAW,EAAE;SACb,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACd,IAAI;QACJ,KAAK,EAAE,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC;KAC9B,CAAC,CAAC;SACF,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC;SAClC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;AACjF,CAAC;AAED,SAAS,UAAU,CAAC,IAAiB,EAAE,IAAY;IACjD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;IACrC,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC;IACjC,IAAI,IAAI,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI;QAAE,OAAO,GAAG,CAAC;IAC7C,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;QAAE,OAAO,EAAE,CAAC;IACrC,IAAI,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC;QAAE,OAAO,EAAE,CAAC;IACnC,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;QAAE,OAAO,EAAE,CAAC;IACnC,IAAI,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC;QAAE,OAAO,EAAE,CAAC;IACjC,OAAO,CAAC,CAAC;AACX,CAAC"}

package/dist/manifest/builder.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"builder.d.ts","sourceRoot":"","sources":["../../src/manifest/builder.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAUH,OAAO,KAAK,EACV,WAAW,EASZ,MAAM,YAAY,CAAC;AAIpB,MAAM,WAAW,oBAAoB;IACnC,4DAA4D;IAC5D,WAAW,EAAE,MAAM,CAAC;IACpB,6BAA6B;IAC7B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,2CAA2C;IAC3C,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,oDAAoD;IACpD,cAAc,CAAC,EAAE,MAAM,EAAE,CAAC;IAC1B,sDAAsD;IACtD,iBAAiB,CAAC,EAAE,MAAM,EAAE,CAAC;CAC9B;AAED,wBAAgB,aAAa,CAAC,OAAO,EAAE,oBAAoB,GAAG,WAAW,CAmDxE"}
+{"version":3,"file":"builder.d.ts","sourceRoot":"","sources":["../../src/manifest/builder.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAgBH,OAAO,KAAK,EACV,WAAW,EASZ,MAAM,YAAY,CAAC;AAIpB,MAAM,WAAW,oBAAoB;IACnC,4DAA4D;IAC5D,WAAW,EAAE,MAAM,CAAC;IACpB,6BAA6B;IAC7B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,2CAA2C;IAC3C,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,oDAAoD;IACpD,cAAc,CAAC,EAAE,MAAM,EAAE,CAAC;IAC1B,sDAAsD;IACtD,iBAAiB,CAAC,EAAE,MAAM,EAAE,CAAC;CAC9B;AAED,wBAAgB,aAAa,CAAC,OAAO,EAAE,oBAAoB,GAAG,WAAW,CAmDxE"}

package/dist/manifest/builder.js

@@ -39,8 +39,8 @@ export function buildManifest(options) {
     if (options.dbtManifestPath) {
         dbtImport = importDbtManifest(options.dbtManifestPath, sources);
     }
-    // Build lineage (with dbt DAG and dashboard nodes)
-    const lineage = buildManifestLineage(blocks, metrics, dimensions, dbtImport, notebooks);
+    // Build lineage
+    const lineage = buildManifestLineage(blocks, metrics, dimensions, notebooks, dbtImport);
     return {
         manifestVersion: 2,
         dqlVersion,
@@ -352,41 +352,9 @@ function importDbtManifest(manifestPath, sources) {
     let modelsImported = 0;
     let sourcesImported = 0;
     const projectName = manifest.metadata?.project_name;
-    // Maps for resolving dbt uniqueId → table name (for depends_on edge resolution)
-    const uniqueIdToName = new Map();
     const dbtDagModels = [];
     const dbtDagEdges = [];
-    // Pass 1: Import dbt sources first (they are upstream of models)
-    const dbtSources = manifest.sources ?? {};
-    for (const [uniqueId, src] of Object.entries(dbtSources)) {
-        const tableName = src.identifier ?? src.name;
-        if (!tableName)
-            continue;
-        uniqueIdToName.set(uniqueId, tableName);
-        if (!sources[tableName]) {
-            sources[tableName] = {
-                name: tableName,
-                origin: 'dbt',
-                referencedBy: [],
-            };
-        }
-        sources[tableName].dbtModel = {
-            uniqueId,
-            database: src.database,
-            schema: src.schema,
-            description: src.description,
-        };
-        // Mark as dbt_source type for lineage
-        sources[tableName].dbtNodeType = 'source';
-        sourcesImported++;
-        dbtDagModels.push({
-            uniqueId,
-            name: tableName,
-            type: 'source',
-            dependsOn: [],
-        });
-    }
-    // Pass 2: Import models with dependency tracking
+    // Import models as source tables
     const nodes = manifest.nodes ?? {};
     for (const [uniqueId, node] of Object.entries(nodes)) {
         if (node.resource_type !== 'model')
@@ -394,16 +362,14 @@ function importDbtManifest(manifestPath, sources) {
         const tableName = node.alias ?? node.name;
         if (!tableName)
             continue;
-        uniqueIdToName.set(uniqueId, tableName);
-        // Extract column metadata
+        // Create or update source entry
         const columns = node.columns
-            ? Object.entries(node.columns).map(([_k, v]) => ({
-                name: v.name,
-                type: v.data_type,
-                description: v.description,
+            ? Object.values(node.columns).map((value) => ({
+                name: value.name,
+                description: value.description,
+                type: value.data_type,
             }))
             : undefined;
-        // Create or update source entry
         if (!sources[tableName]) {
             sources[tableName] = {
                 name: tableName,
@@ -418,39 +384,62 @@ function importDbtManifest(manifestPath, sources) {
             schema: node.schema,
             materializedAs: node.config?.materialized,
             description: node.description,
-            columns: columns
-                ? Object.fromEntries(columns.map((c) => [c.name, c]))
+            columns: node.columns
+                ? Object.fromEntries(Object.entries(node.columns).map(([k, v]) => [
+                    k,
+                    { name: v.name, description: v.description, type: v.data_type },
+                ]))
                 : undefined,
         };
-        // Mark as dbt_model type for lineage
-        sources[tableName].dbtNodeType = 'model';
         if (sources[tableName].origin === 'sql') {
             sources[tableName].origin = 'dbt';
         }
         modelsImported++;
-        // Extract depends_on for DAG reconstruction
-        const dependsOnIds = node.depends_on?.nodes ?? [];
+        const dependsOn = Array.isArray(node.depends_on?.nodes) ? node.depends_on.nodes : [];
         dbtDagModels.push({
             uniqueId,
             name: tableName,
             type: 'model',
-            dependsOn: dependsOnIds,
+            dependsOn,
             columns,
+            schema: node.schema,
+            database: node.database,
+            materialized: node.config?.materialized,
+            description: node.description,
         });
+        for (const dependency of dependsOn) {
+            dbtDagEdges.push({ source: dependency, target: uniqueId });
+        }
     }
-    // Pass 3: Resolve depends_on uniqueIds to table names and build edges
-    for (const model of dbtDagModels) {
-        if (model.type === 'source')
-            continue; // sources have no upstream deps
-        const resolvedDeps = [];
-        for (const depId of model.dependsOn) {
-            const depName = uniqueIdToName.get(depId);
-            if (depName) {
-                resolvedDeps.push(depName);
-                dbtDagEdges.push({ source: depName, target: model.name });
-            }
+    // Import dbt sources
+    const dbtSources = manifest.sources ?? {};
+    for (const [uniqueId, src] of Object.entries(dbtSources)) {
+        const tableName = src.identifier ?? src.name;
+        if (!tableName)
+            continue;
+        if (!sources[tableName]) {
+            sources[tableName] = {
+                name: tableName,
+                origin: 'dbt',
+                referencedBy: [],
+            };
         }
-        model.dependsOn = resolvedDeps;
+        sources[tableName].dbtModel = {
+            uniqueId,
+            database: src.database,
+            schema: src.schema,
+            description: src.description,
+        };
+        sourcesImported++;
+        dbtDagModels.push({
+            uniqueId,
+            name: tableName,
+            type: 'source',
+            dependsOn: [],
+            schema: src.schema,
+            database: src.database,
+            description: src.description,
+        });
     }
     return {
         manifestPath,
@@ -465,7 +454,7 @@ function importDbtManifest(manifestPath, sources) {
     };
 }
 // ---- Lineage Builder ----
-function buildManifestLineage(blocks, metrics, dimensions, dbtImport, notebooks) {
+function buildManifestLineage(blocks, metrics, dimensions, notebooks, dbtImport) {
     // Convert to lineage builder input format
     const lineageBlocks = Object.values(blocks).map((b) => ({
         name: b.name,
@@ -487,26 +476,27 @@ function buildManifestLineage(blocks, metrics, dimensions, dbtImport, notebooks)
         name: d.name,
         table: d.table,
     }));
-    // Convert dbt DAG to lineage builder input
-    const dbtModels = dbtImport?.dbtDag?.models?.map((m) => ({
-        name: m.name,
-        uniqueId: m.uniqueId,
-        type: m.type,
-        dependsOn: m.dependsOn,
-        columns: m.columns,
-    })) ?? [];
-    // Convert notebooks to dashboard inputs
-    const dashboards = notebooks
-        ? Object.values(notebooks).map((nb) => ({
-            name: nb.title || nb.filePath.replace(/\.dqlnb$/, '').split('/').pop() || 'untitled',
-            blocks: nb.cells
-                .filter((c) => c.blockName)
-                .map((c) => c.blockName),
-            charts: nb.cells
-                .filter((c) => c.chartType)
-                .map((c) => c.blockName ?? c.id),
-        }))
-        : [];
+    const dashboards = Object.values(notebooks ?? {}).map((notebook) => ({
+        name: notebook.title,
+        blocks: notebook.cells
+            .map((cell) => cell.blockName)
+            .filter((name) => Boolean(name)),
+        charts: notebook.cells
+            .filter((cell) => cell.chartType && cell.blockName)
+            .map((cell) => cell.blockName)
+            .filter(Boolean),
+    }));
+    const dbtModels = (dbtImport?.dbtDag?.models ?? []).map((model) => ({
+        name: model.name,
+        uniqueId: model.uniqueId,
+        type: model.type,
+        dependsOn: model.dependsOn,
+        columns: model.columns,
+        schema: model.schema,
+        database: model.database,
+        materialized: model.materialized,
+        description: model.description,
+    }));
     const graph = buildLineageGraph(lineageBlocks, lineageMetrics, lineageDimensions, {
         dbtModels,
         dashboards,