recursive-query

I have a table which has a list which looks like this References R. Name LineNo. References A 1.1 (B,24.1) A 6.3 (A, 1.3), (D, 22.1) B 23.1 (A. 1.2) B 24.1 (B,23.1) C 2 (A, 1.1) D 3.12 (A, 6.3) The query should go one by one in the records and generate a value based on the references, pick first one lets say, which is Report Name A, Line No. 1.1, Now the reference is (B, 24.1), which means we need to find Report Name B, line no 24.1 and pick its value. In the same table R.Name B and Line No B, 24.1 is referenced by (B, 23.1), So now we need to find Report name B, Line No 23.1, We go on through

I know I can use grep to find a word in all the files present in a folder like this grep -rn core . But my current directory has many sub-directories and I just want to search in all xml files present in the current directory and its all sub directories . How can I do that ? I tried this grep -rn core *.xml // Does not work But it searches for xml files present in the current directory only. It does not do it recursively. Chris Maes Try the --include option grep -R --include="*.xml" "pattern" /path/to/dir Reference: Grep Include Only *.txt File Pattern When Running Recursive Mode Use find :

The typical example for e.g. summing a whole tree in PostgreSQL is using WITH RECURSIVE (Common Table Expressions). However, these examples typically go from top to bottom, flatten the tree and perform an aggregate function on the whole result set. I have not found a suitable example (on StackOverflow, Google, etc.) for the problem I am trying to solve: Consider an unbalanced tree where each node can have an associated value. Most of the values are attached to leaf nodes, but the others may have values as well. If a node (leaf or not) has an explicitly attached value, this value can be

Lets say I have the following table User_ID Manager_ID --------------------- Linda Jacob Mark Linda Kevin Linda Steve Mark John Kevin Basically the requirement is to pull all the managers under the user_id you are searching for. So for instance if I send in 'Linda' then it should return me: 'Mark', 'Kevin', 'Steve', 'John' or if I send in 'Mark' then it should return me: Steve I have heard of recursive function but I am unsure of how to do this. Any help would be appreciated. Use: WITH hieararchy AS ( SELECT t.user_id FROM YOUR_TABLE t WHERE t.manager_id = 'Linda' UNION ALL SELECT t.user_id

I'm working on a side project, and in order to delete a row and all its descendants in a self-referencing table, I'm using a recursive CTE like this inside a trigger: CREATE TRIGGER dbo.tr_Comment_Delete ON dbo.Comment INSTEAD OF DELETE AS ;WITH IDs AS ( SELECT id FROM DELETED UNION ALL SELECT c.id FROM Comment AS c INNER JOIN IDs AS i ON c.parent_comment_id = i.id ) DELETE FROM Comment WHERE id IN (SELECT id FROM IDs); GO This is the self-referencing table Although I have this code working as expected, it is one of those cases in which you do something, but you're not quite sure how it works.