| Oracle FAQ | Your Portal to the Oracle Knowledge Grid | |
Home -> Community -> Usenet -> comp.databases.theory -> Re: General Graphs in SQL
Yes, I am starting with directed graphs then I can extend it in SQL to
have (a,b) and (b,a) pairs for the undirected model.
This is a white paper for a company that has a graph database product. To sell it, they want me to do the same queries in pure SQL. Their product finds networks among nodes without a prior known relationship, while SQL requires you know what you are doing.
Finding a path is the easiest query ("Six degrees of Kevin Bacon"), and that is what I am trying to do now.
A more complex relationship query is finding a subgraph that shows a complex relationship (actual example from NYC: someone who failed to returned a U-Haul rental is related to a peson who bought fertilizer by blood relation and prison time together and they both visited a Dam on the same day = RED flag!). Received on Fri Dec 16 2005 - 14:43:40 CST
![]() |
![]() |