recursive-query

I need to iterate a graph with loops using the recursive CTE. The problem is the loop part. I want if there are loops, then the shortest path to be selected. This basically means ignoring the loops because the recursion is "width first". The example below shows the returned data: The problem is the commented out INSERT statement that creates a loop. With it uncommented, obviously, the query will never finish. What I need is to return the same data as it would be without the loop. DROP TABLE IF EXISTS edges; CREATE TABLE edges( src integer, dst integer, data integer ); INSERT INTO edges VALUES

I would like a list of dependent tables (ultimately) of a given view. For example: SELECT NAME, TYPE, REFERENCED_NAME, REFERENCED_TYPE FROM DBA_DEPENDENCIES WHERE OWNER='FOO' AND NAME='VIEW_O1' The results: VIEW_O1 VIEW TABLE_01 TABLE VIEW_O1 VIEW TABLE_02 TABLE VIEW_O1 VIEW TABLE_03 TABLE VIEW_O1 VIEW VIEW_02 VIEW VIEW_O1 VIEW VIEW_03 VIEW I would like it to resemble: VIEW_O1 VIEW TABLE_01 TABLE VIEW_O1 VIEW TABLE_02 TABLE VIEW_O1 VIEW TABLE_03 TABLE VIEW_O1 VIEW VIEW_02 VIEW VIEW_O1 VIEW VIEW_03 VIEW VIEW_O2 VIEW TABLE_03 TABLE VIEW_O2 VIEW TABLE_04 TABLE VIEW_O3 VIEW TABLE_05 TABLE VIEW_O3

Is it possible to do parent-child query just using join without looping through temporary table? Database sample : menuid name parent url ---------------------------------------------------------- A0000 Master A0000 # A0001 Rekening A0000 /master/rekening.aspx A0002 Master Nominal A0001 /master/nominal.aspx A0003 Master Satuan Other A0001 /master/satuan.aspx A0004 Master Kondisi A0000 /master/kondisi.aspx A0005 Master Tujuan A0003 /master/tujuan.aspx A0006 Master Item A0003 /master/item.aspx A0007 Master Warehouse A0000 /master/warehouse.aspx A0008 Master Kapal A0006 /master/kapal.aspx Desired

I expected the following to return all the tuples, resolving each parent in the hierarchy up to the top, but it only returns the lowest levels (whose ID is specified in the query). How do I return the whole tree for a given level_id? create table level( level_id int, level_name text, parent_level int); insert into level values (197,'child',177), ( 177, 'parent', 3 ), ( 2, 'grandparent', null ); WITH RECURSIVE recursetree(level_id, levelparent) AS ( SELECT level_id, parent_level FROM level where level_id = 197 UNION ALL SELECT t.level_id, t.parent_level FROM level t, recursetree rt WHERE rt

Suppose a tree structure is implemented in SQL like this: CREATE TABLE nodes ( id INTEGER PRIMARY KEY, parent INTEGER -- references nodes(id) ); Although cycles can be created in this representation, let's assume we never let that happen. The table will only store a collection of roots (records where parent is null) and their descendants. The goal is to, given an id of a node on the table, find all nodes that are descendants of it. A is a descendant of B if either A 's parent is B or A 's parent is a descendant of B . Note the recursive definition. Here is some sample data: INSERT INTO nodes

I am trying to apply CTE and recursive queries. The database is MariaDB 10.2 or greater. Business rules are as follows: An account can either be a holding or a portfolio. A holding consists of a given amount of money. Holdings can be active and inactive. A portfolio contains zero or more accounts, and these accounts can belong to more than one portfolio. The total value of each account is multiplied by a "weight" factor when determining the value of a portfolio. My schema is as follows (note char is used for id type for illustration purposes only, but I will really use int ): CREATE TABLE IF

I'm using Firebird 2.1. There is a table name Folders , with the fields: FolderID ParentFolderID FolderName ParentFolderID is -1 if it's the root folder -- otherwise it contains the parent folder's ID. How can I find all parents (up to the root folder) of a low level node? Do I need a recursive query? ( Firebird supports them ) Something like this: WITH RECURSIVE hierarchy (folderid, ParentFolderId, FolderName) as ( SELECT folderid, ParentFolderId, FolderName FROM folders WHERE ParentFolderID = -1 UNION ALL SELECT folderid, ParentFolderId, FolderName FROM folders f JOIN hierarchy p ON p