Communities

tag:snake search within a tag
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
created:<1w created < 1 week ago
post_type:xxxx type of post
Q&A

Welcome to Software Development on Codidact!

Will you help us build our independent community of developers helping developers? We're small and trying to grow. We welcome questions about all aspects of software development, from design to code to QA and more. Got questions? Got answers? Got code you'd like someone to review? Please join us.

Post History

66%
+2 −0

For small tables you can bound the recursion depth: WITH my_cte(childId, parentId, depth, max_depth) AS ( SELECT r.childId, r.parentId, 1, (SELECT COUNT(*) FROM My_Table) FROM My_Table ...

posted 3y ago by Peter Taylor‭

#1: Initial revision by Peter Taylor‭ · 2021-04-21T08:59:28Z (about 3 years ago)
```For small tables you can bound the recursion depth:

WITH my_cte(childId, parentId, depth, max_depth)
AS (
SELECT r.childId, r.parentId, 1, (SELECT COUNT(*) FROM My_Table)
FROM My_Table r
WHERE r.childId = 1

UNION ALL

SELECT rel.childId, rel.parentId, sd.depth + 1, sd.max_depth
FROM My_Table rel INNER JOIN my_cte sd ON rel.childId = sd.parentId
WHERE sd.depth < sd.max_depth
)
SELECT DISTINCT childId, parentId
FROM my_cte

This approach is limited by the bound that [`MAXRECURSION <= 32767`](https://docs.microsoft.com/en-us/sql/t-sql/queries/with-common-table-expression-transact-sql?view=sql-server-ver15).```