Re: Joins and the Optimizer - a question
Posted in 1997
In article <5jhfs0$3tf$1@news8.gte.net>, Paul Drake <pdrake1@gte.net> writes >I have a question about the optimizer (higher than Informix 7.11 since this >doesn't seem to occur) when dealing with joins: > >Suppose I have two tables that I join by a field like Id (where a.Id = >b.Id). I make an index on both tables on that field (Id), and I make them >clustered. It would seem to me that the best method when pulling back a >large data set would not be the hash join, but rather the sort-merge join, >mainly because it would NOT have to do the sort, since the table is already >sorted by that field. It would just have to do the merge. > >Thanks, >Paul Remember clustered indexes do not stay clustered - When a new row is added is goes on the end of the table. Therefore this will not work. -- David Williams