Skip to content

Commit 2166b76

Browse files
authored
Merge pull request #3749 from lcpopa/master
Vertical Lineage backend - skip condensation
2 parents 763fda4 + 1dc63de commit 2166b76

File tree

1 file changed

+3
-3
lines changed
  • open-metadata-implementation/adapters/open-connectors/governance-daemon-connectors/open-lineage-connectors/open-lineage-janus-connector/src/main/java/org/odpi/openmetadata/openconnectors/governancedaemonconnectors/openlineageconnectors/janusconnector/graph

1 file changed

+3
-3
lines changed

open-metadata-implementation/adapters/open-connectors/governance-daemon-connectors/open-lineage-connectors/open-lineage-janus-connector/src/main/java/org/odpi/openmetadata/openconnectors/governancedaemonconnectors/openlineageconnectors/janusconnector/graph/LineageGraphConnectorHelper.java

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -230,7 +230,7 @@ private Optional<LineageVerticesAndEdges> glossaryVerticalLineage(String guid) {
230230
Graph subGraph = (Graph) g.V().has(PROPERTY_KEY_ENTITY_GUID, guid).bothE(glossaryTermAndClassificationEdges)
231231
.subgraph("s").cap("s").next();
232232

233-
return Optional.of(getLineageVerticesAndEdges(subGraph, false));
233+
return Optional.of(getLineageVerticesAndEdges(subGraph, true));
234234
}
235235

236236
/**
@@ -246,7 +246,7 @@ private Optional<LineageVerticesAndEdges> relationalColumnVerticalLineage(String
246246
Graph subGraph = (Graph) g.V().has(PROPERTY_KEY_ENTITY_GUID, guid).bothE(relationalColumnAndClassificationEdges)
247247
.subgraph("s").cap("s").next();
248248

249-
return Optional.of(getLineageVerticesAndEdges(subGraph, false));
249+
return Optional.of(getLineageVerticesAndEdges(subGraph, true));
250250
}
251251

252252
/**
@@ -262,7 +262,7 @@ private Optional<LineageVerticesAndEdges> tabularColumnVerticalLineage(String gu
262262
Graph subGraph = (Graph) g.V().has(PROPERTY_KEY_ENTITY_GUID, guid).bothE(tabularColumnAndClassificationEdges)
263263
.subgraph("s").bothV().inE(ASSET_SCHEMA_TYPE).subgraph("s").cap("s").next();
264264

265-
return Optional.of(getLineageVerticesAndEdges(subGraph, false));
265+
return Optional.of(getLineageVerticesAndEdges(subGraph, true));
266266
}
267267

268268
/**

0 commit comments

Comments
 (0)