recursive-query

I'm struggling to convert a | a1,a2,a3 b | b1,b3 c | c2,c1 to: a | a1 a | a2 a | a3 b | b1 b | b2 c | c2 c | c1 Here are data in sql format: CREATE TABLE data( "one" TEXT, "many" TEXT ); INSERT INTO "data" VALUES('a','a1,a2,a3'); INSERT INTO "data" VALUES('b','b1,b3'); INSERT INTO "data" VALUES('c','c2,c1'); The solution is probably recursive Common Table Expression. Here's an example which does something similar to a single row: WITH RECURSIVE list( element, remainder ) AS ( SELECT NULL AS element, '1,2,3,4,5' AS remainder UNION ALL SELECT CASE WHEN INSTR( remainder, ',' )>0 THEN SUBSTR(

I had an idea that I could write a query to find all the descendent tables of a root table, based on foreign keys. Query looks like this: select level, lpad(' ', 2 * (level - 1)) || uc.table_name as "TABLE", uc.constraint_name, uc.r_constraint_name from all_constraints uc where uc.constraint_type in ('R', 'P') start with uc.table_name = 'ROOT_TAB' connect by nocycle prior uc.constraint_name = uc.r_constraint_name order by level asc; The results I get look like this: 1 ROOT_TAB XPKROOTTAB 1 ROOT_TAB R_20 XPKPART_TAB 2 CHILD_TAB_1 R_40 XPKROOTTAB 2 CHILD_TAB_2 R_115 XPKROOTTAB 2 CHILD_TAB_3 R_50

I have the table as like below. CREATE TABLE my.categories (id bigint, parent_id bigint, name varchar(128)); INSERT INTO my.categories (id, parent_id, name) VALUES (1, null, 'LEVEL 1'); INSERT INTO my.categories (id, parent_id, name) VALUES (2, 1, 'LEVEL 2.1'); INSERT INTO my.categories (id, parent_id, name) VALUES (3, 1, 'LEVEL 2.2'); INSERT INTO my.categories (id, parent_id, name) VALUES (4, 2, 'LEVEL 3.1.1'); INSERT INTO my.categories (id, parent_id, name) VALUES (5, 2, 'LEVEL 3.1.2'); INSERT INTO my.categories (id, parent_id, name) VALUES (6, 3, 'LEVEL 3.2.1'); +----+-----------+----------

I have to retrieve all clients linked via loans by giving only one as input. Example I have a table data as TABLEA LOAN_ID CLIENT_ID 1 7 1 8 2 7 4 8 4 9 4 10 5 9 5 11 13 2 14 3 If I have given only input as CLIENT_ID=7 then the query has to select all the columns from above table except last two column because client_id 7 has 1,2 LOAN_ID and in 1 the CLIENT_ID 8 has loan_id=4 and in this loan CLIENT_id 9 has again 5 as loan_id. can we write a sql query for this without stored procedure in DB2 ? Here is the answer to your question using recursive CTE query: WITH links AS ( SELECT loan_id,

I would like to ask get some help about understanding how "with recursive" works. More precisely WHY the anchor query (the non-recursive term) isn't replicated into the sub call of the CTE. I tried my best to understand alone but I'm not sure. First of all let's take the example of PostgreSQL which is the simplest one I found (make the sum of 1 to 100) : WITH RECURSIVE t(n) AS ( VALUES (1) UNION ALL SELECT n+1 FROM t WHERE n < 100) SELECT sum(n) FROM t; My code walkthrough ( I used links below) : Evaluate the non-recursive term. For UNION [...]. Include all remaining rows in the result of the

i have an application serve multilevel of permissions and roles i have this HIERARCHY : Country ....Region ........City ............Association ................Center ....................School ........................Class this HIERARCHY i name it "EntityLevels" | ID | Name | ParentID | |----|-------------|----------| | 1 | Country | Null | | 2 | Region | 1 | | 3 | City | 2 | | 4 | Association | 3 | | 5 | Center | 4 | | 6 | School | 5 | | 7 | Class | 6 | i have also a Groups Table which means Jobs | ID | Name | EntityLevels | |----|--------------------|--------------| | 1 | CountryAdmins | 1