recursive-query

I would like to show a tree structure in SQL with child nodes and parent nodes. I have a table like: Employee ------------- ID (int) FirstName (varchar) LastName (varchar) ParentID (int) Job (varchar) which represents an employee. ParentID represent the manager of the employee has. I would like to have this table only with this structure. I would like to show the whole tree structure. I would like to show only the children nodes I would like to show only the parent nodes SampleDataImage Query - The whole tree structure : SELECT * FROM Employee START WITH ParentID IS NULL CONNECT BY PRIOR ID =

I have structure like this: <Unit> <SubUnit1> <SubSubUnit1/> <SubSubUnit2/> ... <SubSubUnitN/> </SubUnit1/> <SubUnit2> <SubSubUnit1/> <SubSubUnit2/> ... <SubSubUnitN/> </SubUnit2/> ... <SubUnitN> <SubSubUnit1/> <SubSubUnit2/> ... <SubSubUnitN/> </SubUnitN/> </Unit> This structure has 3 levels: main Unit, SubUnits and SubSubUnits. I want to select all children by UnitId. If I search by Unit, I have to get all tree. If I search by SubUnit1, I have to get SubUnit1 and all children of SubUnit1. If I search SubSubUnit2, I have to get itself. Here is my try: with a(id, parentid, name) as ( select id

I am trying to build a dependency graph of tables based on the foreign keys between them. This graph needs to start with an arbitrary table name as its root. I could, given a table name look up the tables that reference it using the all_constraints view, then look up the tables that reference them, and so on, but this would be horrible inefficient. I wrote a recursive query that does this for all tables, but when I add: START WITH Table_Name=:tablename It doesn't return the entire tree. select parent, child, level from ( select parent_table.table_name parent, child_table.table_name child from

I have to calculate my products stock cost, so for every product after each buy, i have to recalculate the Weighted Average Cost . I got a view thats bring me the current product's stock after each in/out: document_type document_date product_id qty_out qty_in price row_num stock_balance SI 01/01/2014 52 0 600 1037.28 1 600 SI 01/01/2014 53 0 300 1357.38 2 300 LC 03/02/2014 53 100 0 1354.16 3 200 LC 03/02/2014 53 150 0 1355.25 4 50 LC 03/02/2014 52 100 0 1035.26 5 500 LC 03/02/2014 52 200 0 1035.04 6 300 LF 03/02/2014 53 0 1040 1356.44 7 1090 LF 03/02/2014 52 0 1560 1045 8 1860 LC 04/02/2014 52

Note: with help from RhodiumToad on #postgresql, I've arrived at a solution, which I posted as answer. If anyone can improve on this, please chime in! I have not been able to adapt a previous recursive query solution to the following directed acyclic graph that includes multiple "root" (ancestor-less) nodes. I'm trying to write a query whose output is what is commonly known as a closure table: a many-to-many table that stores every path from each node to each of its descendants and to itself: 1 2 11 8 4 5 7 \/ | | \ | / 3 | \ 6 \ | \ / 9 | 10 \/ / 12 13 \ / 14 CREATE TABLE node ( id SERIAL