Tom Lane e55985d3be Tweak indexscan cost estimation: round estimated # of tuples visited up ... to next integer. Previously, if selectivity was small, we could compute very tiny scan cost on the basis of estimating that only 0.001 tuple would be fetched, which is silly. This naturally led to some rather silly plans...		2000-03-30 00:53:30 +00:00
..
_deadcode	Add:	2000-01-26 05:58:53 +00:00
Makefile	Repair planning bugs caused by my misguided removal of restrictinfo link	2000-02-07 04:41:04 +00:00
allpaths.c	New cost model for planning, incorporating a penalty for random page	2000-02-15 20:49:31 +00:00
clausesel.c	A little further tweaking of the range-query selectivity logic:	2000-03-23 23:35:47 +00:00
costsize.c	Tweak indexscan cost estimation: round estimated # of tuples visited up	2000-03-30 00:53:30 +00:00
indxpath.c	Repair logic flaw in cost estimator: cost_nestloop() was estimating CPU	2000-03-22 22:08:35 +00:00
joinpath.c	Plug some more memory leaks in the planner. It still leaks like a sieve,	2000-02-18 23:47:31 +00:00
joinrels.c	Repair planning bugs caused by my misguided removal of restrictinfo link	2000-02-07 04:41:04 +00:00
orindxpath.c	Repair logic flaw in cost estimator: cost_nestloop() was estimating CPU	2000-03-22 22:08:35 +00:00
pathkeys.c	Plug some more memory leaks in the planner. It still leaks like a sieve,	2000-02-18 23:47:31 +00:00
tidpath.c	New cost model for planning, incorporating a penalty for random page	2000-02-15 20:49:31 +00:00