explicit index

gistfile1.txt

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:       488322,63

Source result set:
	Project-Restrict ResultSet (4):
	Number of opens = 1
	Rows seen = 0
	Rows filtered = 0
	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:       488322,63

	Source result set:
		Index Row to Base Row ResultSet for HOTELS:
		Number of opens = 1
		Rows seen = 0
		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:       488322,63

			User supplied optimizer overrides on T1 are { index=IDX1 }
			Index Scan ResultSet for T1 using index IDX1 at read committed isolation level using share row locking chosen by the optimizer
			Number of opens = 1
			Rows seen = 0
			Rows filtered = 0
			Fetch Size = 1
				constructor time (milliseconds) = 0
				open time (milliseconds) = 0
				next time (milliseconds) = 0
				close time (milliseconds) = 0

			scan information:
				Bit set of columns fetched={1, 2, 6}
				Number of columns fetched=3
				Number of deleted rows visited=0
				Number of pages visited=0
				Number of rows qualified=0
				Number of rows visited=0
				Scan type=btree
				Tree height=3
				start position:
					None
				stop position:
					None
				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
					Column[0][2] Id: 2
					Operator: <
					Ordered nulls: false
					Unknown return value: true
					Negate comparison result: true
					Column[0][3] Id: 2
					Operator: <=
					Ordered nulls: false
					Unknown return value: false
					Negate comparison result: false
				optimizer estimated row count:         1341,10
				optimizer estimated cost:       488322,63