left/right join concept

I'm trying to understand the terminology a bit. A left or right join can only exist for an outer join. For an inner join, the terminology would be out of context because inner joins are symmetrical (whereas outer joins are asymmetrical). Would this be a correct understanding? Anything to add

Re: /tmp/mysql.sock dissapears

Hi, Okay, ill remove the extra log then. The problem isnt that the socket doesn't get created, its that it randomly disappears when mysql has been running for weeks already. So, /tmp's permissions are correct, and everything works for a undecided amount of time, then it just disappears and mysql

Sql 5 new installation and root password?

I have just installed MySQL 5. The server is running, but I'm not able to connect to the server as root. I have not set any root password, since I have not found any way to do this in version 5 (it was rather good documented in version 4). I have tried this solution to set the root password,

Re: Sql 5 new installation and root password?

On Saturday 01 March 2008 13:45, Jørn Dahl-Stamnes wrote: I have just installed MySQL 5. The server is running, but I'm not able to connect to the server as root. I have not set any root password, since I have not found any way to do this in version 5 (it was rather good documented in version

Re: left/right join concept

That sounds like the technical answer. I prefer an analogy a 5th grader could understand. If you have 2 overlapping circles, and inner join is the area that overlaps. A left/outer join is the all of the left circle plus the content of the right circle that overlaps. A right/outer join is

Re: left/right join concept

Somewhat tangential, but for whatever it is worth I agree with the view expressed at http://weblogs.sqlteam.com/jeffs/archive/2008/02/13/on-right-outer-joins.aspx: Right joins should be avoided (IMHO). Anything to add or correct, please? -- Rob Wultsch -- MySQL General Mailing List For

Efficiently storing a directed graph

I have a directed graph (nodes and edges) that I want to store efficiently: given two nodes, I want to quickly find the shortest path between them. The graph is NOT acyclic (it's not a tree), is fairly sparse (about 1 edges for 2500 nodes), and changes occasionally. I know PostgreSQL/MySQL

Re: Efficiently storing a directed graph

Kelly, I'm not married to using SQL: are there other efficient solutions to store directed graphs? Could I hack something up in Perl or Ruby and then serialize my in-memory graph to a file (for efficient saving/reloading)? Did you look at Dijkstra's algorithm? PB -- MySQL General Mailing

Re: Efficiently storing a directed graph

Good Evening Peter- //so if I look at this algorithm from wikopedia I see something like //Java/C#/C++ no problem //How would you implement this in PL/SQL ? public Dictionary CalculateMinCost(Location _startLocation) { //Initialise a new empty route list Dictionary _shortestPaths = new

Importing and exporting from MySQL, escape slash problem

PHP List, MySQL List In my PHP environment, I have Magic Quotes turned off, and I use the mysql_real_escape_string() function clean strings of SQL syntax before inserting them into my database. So the data stored in my database does not have escape characters in it. Particularly, double and

Re: [GENERAL] Efficiently storing a directed graph

Kelly Jones wrote: I have a directed graph (nodes and edges) that I want to store efficiently: given two nodes, I want to quickly find the shortest path between them. The graph is NOT acyclic (it's not a tree), is fairly sparse (about 1 edges for 2500 nodes), and changes occasionally. I

Re: Efficiently storing a directed graph

//How would you implement this in PL/SQL ? Have a look at http://hansolav.net/blog/ImplementingDijkstrasAlgorithmUsingTSQL.aspx? PB [EMAIL PROTECTED] wrote: Good Evening Peter- //so if I look at this algorithm from wikopedia I see something like //Java/C#/C++ no problem //How would you