Details
-
Bug
-
Status: Open
-
Major
-
Resolution: Unresolved
-
10.7.1.1
-
None
-
Windows XP environment
-
Normal
-
Performance
Description
When a very large table (500k rows) is used with a column is indexed. select * from tab where pid > 0 order by pid takes extremely longer time than select * from tab order by pid. Actually, it is 100 times slower. However, in IJ, ther performance seems to be similar. PID column is indexed.
Here is the code snipplet
import java.sql.Connection;
import java.sql.DriverManager;
import java.sql.ResultSet;
import java.sql.SQLException;
import java.sql.Statement;
public class TestPerformance {
//20343 mill-sec
static String s1 = "SELECT TIMESTAMP, HOSTPORT AS \"HOST ID\", PID, SESSIONID, REQUESTID, " +
"SUBREQUESTID, STEPID, TID, COMPONENT, BUILDNUM, " +
"LOGLEVELORIG AS \"LEVEL\", LOGGER, OPERATION, OBJECTTYPE, OBJECTPATH, " +
"STATUS, MESSAGE, DATA, NDX FROM LOGDATA871218 where PID > 0 ORDER BY PID";
//297 million sec.
static String s2 = "SELECT TIMESTAMP, HOSTPORT AS \"HOST ID\", PID, SESSIONID, REQUESTID, " +
"SUBREQUESTID, STEPID, TID, COMPONENT, BUILDNUM, " +
"LOGLEVELORIG AS \"LEVEL\", LOGGER, OPERATION, OBJECTTYPE, OBJECTPATH, " +
"STATUS, MESSAGE, DATA, NDX FROM LOGDATA871218 ORDER BY PID";
public static void main(String[] args) throws InstantiationException, IllegalAccessException, ClassNotFoundException {
Statement stmt3;
try
catch (SQLException e)
{ // TODO Auto-generated catch block e.printStackTrace(); }
}
}