查找以编程方式连接表所需的所有连接
-
26-09-2020 - |
题
给定一个 SourceTable 和一个 TargetTable,我想以编程方式创建一个包含所需所有连接的字符串。
简而言之,我正在尝试找到一种方法来创建这样的字符串:
FROM SourceTable t
JOIN IntermediateTable t1 on t1.keycolumn = t.keycolumn
JOIN TargetTable t2 on t2.keycolumn = t1.keycolumn
我有一个查询返回给定表的所有外键,但在尝试递归地运行所有这些以找到最佳连接路径并创建字符串时遇到了限制。
SELECT
p.name AS ParentTable
,pc.name AS ParentColumn
,r.name AS ChildTable
,rc.name AS ChildColumn
FROM sys.foreign_key_columns fk
JOIN sys.columns pc ON pc.object_id = fk.parent_object_id AND pc.column_id = fk.parent_column_id
JOIN sys.columns rc ON rc.object_id = fk.referenced_object_id AND rc.column_id = fk.referenced_column_id
JOIN sys.tables p ON p.object_id = fk.parent_object_id
JOIN sys.tables r ON r.object_id = fk.referenced_object_id
WHERE fk.parent_object_id = OBJECT_ID('aTable')
ORDER BY ChildTable, fk.referenced_column_id
我确信以前已经这样做过,但我似乎找不到例子。
解决方案
我有一个脚本,这是一个初始版本的外钥匙遍历。我很快调整它(见下文),您可能能够将其用作起点。
给定目标表,脚本试图为所有可能的源表打印用于所有可能的源表的最短路径(或其中一个)的连接字符串,使得可以遍历单列外键以访问目标桌子。该脚本似乎在数据库中运行,具有几千个表格和许多我尝试的FK连接。
在评论中提到其他内容,如果需要处理多列外键,则需要更复杂。此外,请注意,这不是任何方式生产准备好,经过了经过了经过的代码。希望它是一个有用的起点,如果你决定建立这个功能!
-- Drop temp tables that will be used below
IF OBJECT_ID('tempdb..#paths') IS NOT NULL
DROP TABLE #paths
GO
IF OBJECT_ID('tempdb..#shortestPaths') IS NOT NULL
DROP TABLE #shortestPaths
GO
-- The table (e.g. "TargetTable") to start from (or end at, depending on your point of view)
DECLARE @targetObjectName SYSNAME = 'TargetTable'
-- Identify all paths from TargetTable to any other table on the database,
-- counting all single-column foreign keys as a valid connection from one table to the next
;WITH singleColumnFkColumns AS (
-- We limit the scope of this exercise to single column foreign keys
-- We explicitly filter out any multi-column foreign keys to ensure that they aren't misinterpreted below
SELECT fk1.*
FROM sys.foreign_key_columns fk1
LEFT JOIN sys.foreign_key_columns fk2 ON fk2.constraint_object_id = fk1.constraint_object_id AND fk2.constraint_column_id = 2
WHERE fk1.constraint_column_id = 1
AND fk2.constraint_object_id IS NULL
)
, parentCTE AS (
-- Base case: Find all outgoing (pointing into another table) foreign keys for the specified table
SELECT
p.object_id AS ParentId
,OBJECT_SCHEMA_NAME(p.object_id) + '.' + p.name AS ParentTable
,pc.column_id AS ParentColumnId
,pc.name AS ParentColumn
,r.object_id AS ChildId
,OBJECT_SCHEMA_NAME(r.object_id) + '.' + r.name AS ChildTable
,rc.column_id AS ChildColumnId
,rc.name AS ChildColumn
,1 AS depth
-- Maintain the full traversal path that has been taken thus far
-- We use "," to delimit each table, and each entry then has a
-- "<object_id>_<parent_column_id>_<child_column_id>" format
, ',' + CONVERT(VARCHAR(MAX), p.object_id) + '_NULL_' + CONVERT(VARCHAR(MAX), pc.column_id) +
',' + CONVERT(VARCHAR(MAX), r.object_id) + '_' + CONVERT(VARCHAR(MAX), pc.column_id) + '_' + CONVERT(VARCHAR(MAX), rc.column_id) AS TraversalPath
FROM sys.foreign_key_columns fk
JOIN sys.columns pc ON pc.object_id = fk.parent_object_id AND pc.column_id = fk.parent_column_id
JOIN sys.columns rc ON rc.object_id = fk.referenced_object_id AND rc.column_id = fk.referenced_column_id
JOIN sys.tables p ON p.object_id = fk.parent_object_id
JOIN sys.tables r ON r.object_id = fk.referenced_object_id
WHERE fk.parent_object_id = OBJECT_ID(@targetObjectName)
AND p.object_id <> r.object_id -- Ignore FKs from one column in the table to another
UNION ALL
-- Recursive case: Find all outgoing foreign keys for all tables
-- on the current fringe of the recursion
SELECT
p.object_id AS ParentId
,OBJECT_SCHEMA_NAME(p.object_id) + '.' + p.name AS ParentTable
,pc.column_id AS ParentColumnId
,pc.name AS ParentColumn
,r.object_id AS ChildId
,OBJECT_SCHEMA_NAME(r.object_id) + '.' + r.name AS ChildTable
,rc.column_id AS ChildColumnId
,rc.name AS ChildColumn
,cte.depth + 1 AS depth
,cte.TraversalPath + ',' + CONVERT(VARCHAR(MAX), r.object_id) + '_' + CONVERT(VARCHAR(MAX), pc.column_id) + '_' + CONVERT(VARCHAR(MAX), rc.column_id) AS TraversalPath
FROM parentCTE cte
JOIN singleColumnFkColumns fk
ON fk.parent_object_id = cte.ChildId
-- Optionally consider only a traversal of the same foreign key
-- With this commented out, we can reach table A via column A1
-- and leave table A via column A2. If uncommented, we can only
-- enter and leave a table via the same column
--AND fk.parent_column_id = cte.ChildColumnId
JOIN sys.columns pc ON pc.object_id = fk.parent_object_id AND pc.column_id = fk.parent_column_id
JOIN sys.columns rc ON rc.object_id = fk.referenced_object_id AND rc.column_id = fk.referenced_column_id
JOIN sys.tables p ON p.object_id = fk.parent_object_id
JOIN sys.tables r ON r.object_id = fk.referenced_object_id
WHERE p.object_id <> r.object_id -- Ignore FKs from one column in the table to another
-- If our path has already taken us to this table, avoid the cycle that would be created by returning to the same table
AND cte.TraversalPath NOT LIKE ('%_' + CONVERT(VARCHAR(MAX), r.object_id) + '%')
)
SELECT *
INTO #paths
FROM parentCTE
ORDER BY depth, ParentTable, ChildTable
GO
-- For each distinct table that can be reached by traversing foreign keys,
-- record the shortest path to that table (or one of the shortest paths in
-- case there are multiple paths of the same length)
SELECT *
INTO #shortestPaths
FROM (
SELECT *, ROW_NUMBER() OVER (PARTITION BY ChildTable ORDER BY depth ASC) AS rankToThisChild
FROM #paths
) x
WHERE rankToThisChild = 1
ORDER BY ChildTable
GO
-- Traverse the shortest path, starting from the source the full path and working backwards,
-- building up the desired join string as we go
WITH joinCTE AS (
-- Base case: Start with the from clause to the child table at the end of the traversal
-- Note that the first step of the recursion will re-process this same row, but adding
-- the ParentTable => ChildTable join
SELECT p.ChildTable
, p.TraversalPath AS ParentTraversalPath
, NULL AS depth
, CONVERT(VARCHAR(MAX), 'FROM ' + p.ChildTable + ' t' + CONVERT(VARCHAR(MAX), p.depth+1)) AS JoinString
FROM #shortestPaths p
UNION ALL
-- Recursive case: Process the ParentTable => ChildTable join, then recurse to the
-- previous table in the full traversal. We'll end once we reach the root and the
-- "ParentTraversalPath" is the empty string
SELECT cte.ChildTable
, REPLACE(p.TraversalPath, ',' + CONVERT(VARCHAR, p.ChildId) + '_' + CONVERT(VARCHAR, p.ParentColumnId)+ '_' + CONVERT(VARCHAR, p.ChildColumnId), '') AS TraversalPath
, p.depth
, cte.JoinString + '
' + CONVERT(VARCHAR(MAX), 'JOIN ' + p.ParentTable + ' t' + CONVERT(VARCHAR(MAX), p.depth) + ' ON t' + CONVERT(VARCHAR(MAX), p.depth) + '.' + p.ParentColumn + ' = t' + CONVERT(VARCHAR(MAX), p.depth+1) + '.' + p.ChildColumn) AS JoinString
FROM joinCTE cte
JOIN #paths p
ON p.TraversalPath = cte.ParentTraversalPath
)
-- Select only the fully built strings that end at the root of the traversal
-- (which should always be the specific table name, e.g. "TargetTable")
SELECT ChildTable, 'SELECT TOP 100 *
' +JoinString
FROM joinCTE
WHERE depth = 1
ORDER BY ChildTable
GO
. 其他提示
您可以将具有两个字段tab_name的表的键列表放置为您要连接的所有表的key_name。
例如,对于表 City
- 城市|城市名称
- 城市|国家/地区名称
- 城市|省名
- 城市|城市代码
同样地 Province
和 Country
.
收集表的数据并将其放入单个表中(例如元数据表)
现在起草如下查询
select * from
(Select Table_name,Key_name from Meta_Data
where Table_name in ('City','Province','Country')) A,
(Select Table_name,Key_name from Meta_Data
where Table_name in ('City','Province','Country')) B,
(Select Table_name,Key_name from Meta_Data
where Table_name in ('City','Province','Country')) C
where
A.Table_Name <> B.Table_name and
B.Table_name <> C.Table_name and
C.Table_name <> A.Table_name and
A.Column_name = B.Column_name and
B.Column_name = C.Column_name
这将帮助您了解如何根据匹配的键(相同的键名称)链接表
如果您认为键名称可能不匹配,您可以包含备用键字段并尝试在 where 条件中使用它。
不隶属于 dba.stackexchange