The superiority of relative criteria in partial matching and generalization

摘要: Some familiar justifications for concluding that a data element D is an unacceptable match to pattern P are examined their suitability partial-matching applications. All of these absolute criteria found be in they rule out some plausible partial matches. A matching program, REIAX, described which justifies the conclusion on grounds other Db better P. The use such relative makes it possible compute all kinds mappings Kling [9] has claimed required account instutions about similarity. ability form unrestrictive allows RELAX construct generalizations have eluded approaches [5, 6].