Skip to content

Instantly share code, notes, and snippets.

@whiter4bbit
Created July 26, 2011 12:29
Show Gist options
  • Save whiter4bbit/1106640 to your computer and use it in GitHub Desktop.
Save whiter4bbit/1106640 to your computer and use it in GitHub Desktop.
without explicit index
Number of opens = 1
Rows seen = 0
Rows filtered = 0
constructor time (milliseconds) = 0
open time (milliseconds) = 0
next time (milliseconds) = 0
close time (milliseconds) = 0
optimizer estimated row count: 1341,10
optimizer estimated cost: 39090,35
Source result set:
Sort ResultSet:
Number of opens = 1
Rows input = 663
Rows returned = 0
Eliminate duplicates = false
In sorted order = false
Sort information:
Number of rows input=663
Number of rows output=663
Sort type=internal
constructor time (milliseconds) = 0
open time (milliseconds) = 0
next time (milliseconds) = 0
close time (milliseconds) = 0
optimizer estimated row count: 1341,10
optimizer estimated cost: 39090,35
Source result set:
Project-Restrict ResultSet (4):
Number of opens = 1
Rows seen = 673
Rows filtered = 10
restriction = true
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
optimizer estimated row count: 1341,10
optimizer estimated cost: 39090,35
Source result set:
Index Row to Base Row ResultSet for T1:
Number of opens = 1
Rows seen = 673
Columns accessed from heap = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70}
constructor time (milliseconds) = 0
open time (milliseconds) = 0
next time (milliseconds) = 0
close time (milliseconds) = 0
optimizer estimated row count: 1341,10
optimizer estimated cost: 39090,35
Index Scan ResultSet for T1 using index IDX at read committed isolation level using instantaneous share row locking chosen by the optimizer
Number of opens = 1
Rows seen = 673
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, 4}
Number of columns fetched=3
Number of deleted rows visited=0
Number of pages visited=55
Number of rows qualified=673
Number of rows visited=4045
Scan type=btree
Tree height=3
start position:
>= on first 2 column(s).
Ordered null semantics on the following columns:
stop position:
> on first 2 column(s).
Ordered null semantics on the following columns:
qualifiers:
Column[0][0] Id: 1
Operator: <
Ordered nulls: false
Unknown return value: true
Negate comparison result: true
Column[0][1] Id: 1
Operator: <=
Ordered nulls: false
Unknown return value: false
Negate comparison result: false
optimizer estimated row count: 1341,10
optimizer estimated cost: 39090,35
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment