orderbyelimination.out

derby database source code.good for you.

	next time (milliseconds) = 0
	close time (milliseconds) = 0
Source result set:
	Sort ResultSet:
	Number of opens = 1
	Rows input = 20
	Rows returned = 15
	Eliminate duplicates = true
	In sorted order = false
	Sort information: 
		Number of rows input=20
		Number of rows output=15
		constructor time (milliseconds) = 0
		open time (milliseconds) = 0
		next time (milliseconds) = 0
		close time (milliseconds) = 0
	Source result set:
		Union ResultSet:
		Number of opens = 1
		Rows seen from the left = 10
		Rows seen from the right = 10
		Rows returned = 20
			constructor time (milliseconds) = 0
			open time (milliseconds) = 0
			next time (milliseconds) = 0
			close time (milliseconds) = 0
		Left result set:
			Index Scan ResultSet for T1 using index I1 at serializable isolation level using share table locking chosen by the optimizer
			Number of opens = 1
			Rows seen = 10
			Rows filtered = 0
			Fetch Size = 16
				constructor time (milliseconds) = 0
				open time (milliseconds) = 0
				next time (milliseconds) = 0
				close time (milliseconds) = 0
				next time in milliseconds/row = 0
			scan information: 
				Bit set of columns fetched={2, 3}
				Number of columns fetched=2
				Number of deleted rows visited=0
				Number of pages visited=1
				Number of rows qualified=10
				Number of rows visited=10
				Scan type=btree
				Tree height=1
				start position: 
	None
				stop position: 
	None
				qualifiers:
None
		Right result set:
			Project-Restrict ResultSet (5):
			Number of opens = 1
			Rows seen = 10
			Rows filtered = 0
			restriction = false
			projection = true
				constructor time (milliseconds) = 0
				open time (milliseconds) = 0
				next time (milliseconds) = 0
				close time (milliseconds) = 0
				restriction time (milliseconds) = 0
				projection time (milliseconds) = 0
			Source result set:
				Index Scan ResultSet for T1 using index I1 at serializable isolation level using share table locking chosen by the optimizer
				Number of opens = 1
				Rows seen = 10
				Rows filtered = 0
				Fetch Size = 16
					constructor time (milliseconds) = 0
					open time (milliseconds) = 0
					next time (milliseconds) = 0
					close time (milliseconds) = 0
					next time in milliseconds/row = 0
				scan information: 
					Bit set of columns fetched={0, 1}
					Number of columns fetched=2
					Number of deleted rows visited=0
					Number of pages visited=1
					Number of rows qualified=10
					Number of rows visited=10
					Scan type=btree
					Tree height=1
					start position: 
	None
					stop position: 
	None
					qualifiers:
None
ij> select c3, c4 from t1 union select c2, c1 as c4 from t1 order by c4;
1          |C4         
-----------------------
-4         |-5         
-3         |-4         
-3         |-2         
-2         |-1         
4          |1          
3          |1          
2          |1          
4          |2          
3          |2          
1          |2          
4          |3          
2          |3          
3          |4          
2          |4          
4          |5          
ij> values SYSCS_UTIL.SYSCS_GET_RUNTIMESTATISTICS();
1                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                               
----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
Statement Name: 
	null
Statement Text: 
	select c3, c4 from t1 union select c2, c1 as c4 from t1 order by c4
Parse Time: 0
Bind Time: 0
Optimize Time: 0
Generate Time: 0
Compile Time: 0
Execute Time: 0
Begin Compilation Timestamp : null
End Compilation Timestamp : null
Begin Execution Timestamp : null
End Execution Timestamp : null
Statement Execution Plan Text: 
Sort ResultSet:
Number of opens = 1
Rows input = 15
Rows returned = 15
Eliminate duplicates = false
In sorted order = false
Sort information: 
	Number of rows input=15
	Number of rows output=15
	constructor time (milliseconds) = 0
	open time (milliseconds) = 0
	next time (milliseconds) = 0
	close time (milliseconds) = 0
Source result set:
	Sort ResultSet:
	Number of opens = 1
	Rows input = 20
	Rows returned = 15
	Eliminate duplicates = true
	In sorted order = false
	Sort information: 
		Number of rows input=20
		Number of rows output=15
		constructor time (milliseconds) = 0
		open time (milliseconds) = 0
		next time (milliseconds) = 0
		close time (milliseconds) = 0
	Source result set:
		Union ResultSet:
		Number of opens = 1
		Rows seen from the left = 10
		Rows seen from the right = 10
		Rows returned = 20
			constructor time (milliseconds) = 0
			open time (milliseconds) = 0
			next time (milliseconds) = 0
			close time (milliseconds) = 0
		Left result set:
			Index Scan ResultSet for T1 using index I1 at serializable isolation level using share table locking chosen by the optimizer
			Number of opens = 1
			Rows seen = 10
			Rows filtered = 0
			Fetch Size = 16
				constructor time (milliseconds) = 0
				open time (milliseconds) = 0
				next time (milliseconds) = 0
				close time (milliseconds) = 0
				next time in milliseconds/row = 0
			scan information: 
				Bit set of columns fetched={2, 3}
				Number of columns fetched=2
				Number of deleted rows visited=0
				Number of pages visited=1
				Number of rows qualified=10
				Number of rows visited=10
				Scan type=btree
				Tree height=1
				start position: 
	None
				stop position: 
	None
				qualifiers:
None
		Right result set:
			Project-Restrict ResultSet (5):
			Number of opens = 1
			Rows seen = 10
			Rows filtered = 0
			restriction = false
			projection = true
				constructor time (milliseconds) = 0
				open time (milliseconds) = 0
				next time (milliseconds) = 0
				close time (milliseconds) = 0
				restriction time (milliseconds) = 0
				projection time (milliseconds) = 0
			Source result set:
				Index Scan ResultSet for T1 using index I1 at serializable isolation level using share table locking chosen by the optimizer
				Number of opens = 1
				Rows seen = 10
				Rows filtered = 0
				Fetch Size = 16
					constructor time (milliseconds) = 0
					open time (milliseconds) = 0
					next time (milliseconds) = 0
					close time (milliseconds) = 0
					next time in milliseconds/row = 0
				scan information: 
					Bit set of columns fetched={0, 1}
					Number of columns fetched=2
					Number of deleted rows visited=0
					Number of pages visited=1
					Number of rows qualified=10
					Number of rows visited=10
					Scan type=btree
					Tree height=1
					start position: 
	None
					stop position: 
	None
					qualifiers:
None
ij> -- test recognition of single row tables
-- even when scanning heap
create table u1(c1 int, c2 int);
0 rows inserted/updated/deleted
ij> create table u2(c2 int, c3 int);
0 rows inserted/updated/deleted
ij> create table u3(c3 int, c4 int);
0 rows inserted/updated/deleted
ij> insert into u1 values (1, 1), (2, 2);
2 rows inserted/updated/deleted
ij> insert into u2 values (1, 1), (2, 2);
2 rows inserted/updated/deleted
ij> insert into u3 values (1, 1), (2, 2);
2 rows inserted/updated/deleted
ij> create unique index u1_i1 on u1(c1);
0 rows inserted/updated/deleted
ij> create unique index u2_i1 on u2(c2);
0 rows inserted/updated/deleted
ij> create unique index u3_i1 on u3(c3);
0 rows inserted/updated/deleted
ij> select * from
u1,
u2,
u3
where u1.c1 = 1 and u1.c1 = u2.c2
order by u3.c3;
C1         |C2         |C2         |C3         |C3         |C4         
-----------------------------------------------------------------------
1          |1          |1          |1          |1          |1          
1          |1          |1          |1          |2          |2          
ij> values SYSCS_UTIL.SYSCS_GET_RUNTIMESTATISTICS();
1