MYSQL: Get the Auto-Increment Values after Insert Statement

Nitin — Wed, 15 Jul 2009 12:24:32 +0000

Until sometime back, I was unaware of how I could get the value of an auto-incremented field after an Insert Statement. But recently I needed it for two of my projects simultaneously, so I explored the possibilities. As one of my project is in Java and other is in PHP, we will go through both of them.

So, here is the problem. In general, the PRIMARY KEY field is the AUTO_INCREMENT field. Now wen you insert a row, a new key is generated and you can’t get it through usual way as this row can be accessed only using the primary key.

So here is how it can be done:

In JAVA:

/*Insert a row into the desired table that generates
an auto increment field*/

stmt.executeUpdate("Insert into tableName (col1, col2) values (val1, val2)", Statement.RETURN_GENERATED_KEYS);

ResultSet rs = stmt.getGeneratedKeys();

int autoIncValue = -1;

if(rs.next())
{
autoIncValue = rs.getInt(1);
/*You can get more generated keys if they are generated in your code*/
}

In PHP:

The mysql_insert_id() function in PHP returns the AUTO_INCREMENT ID generated from the previous INSERT operation.

$con = mysql_connect("hostname", "username", "password");
if (!$con)
{
die('Error while connecting: ' . mysql_error());
}

$db_selected = mysql_select_db(database_name,$con);

$sql = "INSERT INTO tablename VALUES (val1,val2)";
$result = mysql_query($sql,$con);

echo "ID of last inserted record is: " . mysql_insert_id();

mysql_close($con);
?>

Note: Be sure to call mysql_insert_id() immediately after a query to get the correct value. The function returns 0 if the previous query does not generate an AUTO_INCREMENT value, or FALSE if no MySQL connection was established.

Enjoy!!

Sorting a 2-Dimensional Array in Java

Nitin — Sun, 05 Jul 2009 21:47:28 +0000

Recently while working for my project, I came across this situation when I had a 2-D array and I needed to sort it twice on 2 of its columns. Consider the following 2D array:

String[][] testString = new String[][] {
{"1", "2", "6"},
{"4", "5", "3"}
};

Sorting the above 2D array on zero column will give

{
{"1", "2", "6"},
{"4", "5", "3"}
}

whereas sorting it on second column will give

{
{"4", "5", "3"},
{"1", "2", "6"}
}

I did not want to do the most common as well as tedious thing, i.e. write my own sorting function like this:

public void myOwnSort(String [][] exampleArray) {
//code for sorting the array according to my wish.
}

I wanted to avoid this for 2 resons:

I would have to write the code for it ( lazy me!!).
Secondly, I can possibly never match the efficiency provided by the sorting functions of java.util.Arrays

So, my main aim was to look for a solution that would help me sort my 2-D array using the internal JAVA sorters.

I started digging into the JAVA docs (I must admit, I was a naive in JAVA at this point), and came across the Comparator Interface, using which we can tell the JAVA sorting function (Arrays.sort) on how to compare two elements of a 2D array. One must understand that a 2D array is essentially a 1D array with its each element as another 1D array.

String[][] testString = new String[][] {
{"1", "2", "6"},
{"4", "5", "3"}
};

Above, there are two arrays containing 3 strings each. We must now compare these two arrays to determine their order in the resultant 2D array. We can compare these two 1-D arrays in any way we like, we can compare them on the first column, third column or on the average length of the strings (just anything!!). Let us implement Comparator interface to define such a compare function:

class 2DcolumnComparator implements Comparator {
private int columnToSortOn;

//contructor to set the column to sort on.
2DcolumnComparator(int columnToSortOn) {
this.columnToSortOn = columnToSortOn;
}

// Implement the abstract method which tells
// how to order the two elements in the array.
public int compare(Object o1, Object o2) {
// cast the object args back to string arrays
String[] row1 = (String[])o1;
String[] row2 = (String[])o2;

// compare the desired column values
return row1[columnToSortOn].compareTo(row2[columnToSortOn]);
}
}

Above, we create a class 2DcolumnComparator which implements comparator interface and compare 1D array elements on the column passed to the constructor. Now, we can pass an instance of this class to the Arrays.sort function, and the 2D array will sorted on the desired column.

public class Analysis {

public static void main(String args[]) {
String[][] childrenArray = new String[MAXLIMIT][10];

//Populate the Array and sort
Arrays.sort(childrenArray,new 2DcolumnComparator(5));
}
}

Here, we instantiate the 2DcolumnComaparator class and pass the column to sort on as parameter to its constructor. Above, the 2D array will be sorted on its fifth column (starting from zero). You can, of course, change the compare function to order elements according to your wish.

That is all I needed to sort a 2-D Array. Happy Sorting!!!

Useful Resources:
http://java.sun.com/j2se/1.4.2/docs/api/java/util/Comparator.html
http://java.sun.com/j2se/1.4.2/docs/api/java/util/Arrays.html#sort(java.lang.Object[], java.util.Comparator)

Update: If you need to sort a 2D array of objects of any class which implements Comparable, you can look at the comment by Lars. Article last updated on 25 Feb 2010.

Public Mindjava

MYSQL: Get the Auto-Increment Values after Insert Statement

Sorting a 2-Dimensional Array in Java