LISTSERV at the University of Georgia
Menubar Imagemap
Home Browse Manage Request Manuals Register
Previous (more recent) messageNext (less recent) messagePrevious (more recent) in topicNext (less recent) in topicPrevious (more recent) by same authorNext (less recent) by same authorPrevious page (February 2001, week 2)Back to main SAS-L pageJoin or leave SAS-L (or change settings)ReplyPost a new messageSearchProportional fontNon-proportional font
Date:         Thu, 8 Feb 2001 19:00:52 -0500
Reply-To:     Sigurd Hermansen <HERMANS1@WESTAT.COM>
Sender:       "SAS(r) Discussion" <SAS-L@LISTSERV.UGA.EDU>
From:         Sigurd Hermansen <HERMANS1@WESTAT.COM>
Subject:      Re: Behaviour of many-many match merging in SAS
Comments: To: Don Stanley <don_stanley@XTRA.CO.NZ>
Content-Type: text/plain; charset="iso-8859-1"

I have tried to convey the same message in several SUGI presentations and other rantings. SAS makes it easy to check for primary key duplicates, failures of one-way and two-way referential integrity constraints, and other anomalies in data. If resolved, series of joins become neatly transitive and much of programming reduces to highly predictable set-logic operations. If left unresolved, the accuracy and consistency of results depend on the current state of the data. Sig

<-----Original Message----- <From: Don Stanley [mailto:don_stanley@XTRA.CO.NZ] <Sent: Wednesday, February 07, 2001 4:20 PM <To: SAS-L@LISTSERV.UGA.EDU <Subject: Re: Behaviour of many-many match merging in SAS

<I prefer to have my data structured in such a way to ensure that my <merge will work.


Back to: Top of message | Previous page | Main SAS-L page