Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!spool.mu.edu!news.cs.indiana.edu!bronze!copper!rschmidt From: rschmidt@copper.ucs.indiana.edu (roy schmidt) Newsgroups: comp.os.msdos.apps Subject: Re: How to link databases in dBase III ? Message-ID: <1991Feb19.014406.12129@bronze.ucs.indiana.edu> Date: 19 Feb 91 01:44:06 GMT References: <36912@netnews.upenn.edu> <1991Feb17.232443.15314@bronze.ucs.indiana.edu> <41031@ucbvax.BERKELEY.EDU> Sender: news@bronze.ucs.indiana.edu (USENET News System) Organization: Indiana University, Bloomington Lines: 27 brand@janus.Berkeley.EDU asks: (roy schmidt) writes: >>dBase is a semi-relational data base system, so you can do exactly what > >Would you mind explaining why it is only semi-relational? I thought that >since you could set up relations between databases then that made it a >(fully) relational database? cf. E. F. Codd "Is Your DBMS Really Relational?" Computerworld Oct 14, 1985, and "Does Your DBMS Run by the Rules?" Computerworld Oct 21, 1985. The two articles above lay out twelve rules as a rating scheme to determine if a DBMS is *fully* relational. The same rules are also in Codd's latest book, _The Realtional Model for Database Management, Version 2_ Reading, MA: Addison-Wesley, 1990. The rules really boil down to a simple criterion: every operation in the database must be done using RELATIONAL facilities, and *only* RELATIONAL facilities. Check out the original in the articles or the book for details. -- -------------------------------------------------------------------------- Roy Schmidt | #include Indiana University | /* They are _my_ thoughts, and you can't Graduate School of Business | have them, so there! */