HDTenEightyP/NetNews huggingface dataset:
Organization: University of Illinois at Chicago
Date: Thursday, 19 Nov 1992 13:01:30 CST
From: <U23176@uicvm.uic.edu>
Newsgroups: comp.databases
Subject: Clipper & C & Array

Hi, there, I am new in clipper programming and have some questions here:
1.  Usually in what cases a clipper program needs to call C functions
    through the clipper extend system?
2.  An array in clipper can hold up to about 4,000 elements.  If there are
    several array variables in the program, would there be a problem
    for the memory if the arrays hold a lot of elements?  If so, what is
    the general rule to use clipper arrays with large number of elements?

Thanks!
From: villas@ax.apc.org
Newsgroups: comp.databases
Date: 16 Nov 92 09:50 PST
Subject: Re: Normalizing 2NF -> 3NF
Nf-ID: #R:1992Nov15.163413.17527@news.uiow:423069006:ax:49800010:000:921
Nf-From: ax.UUCP!villas    Nov 16 09:50:00 1992


Considering the normalization of (A*,B,C), where A -> B, B -> C and A* is
the PK, I would go with (A*,B) and (B*,C). My reasons are:

   - If you go with (A*,B) and (A*,C), there no longer exists (or can be
     implied) the B -> C dependencie, so the set of original dependencies
     is being modified;

   - If you get to BCNF (Boyce-Codd Normal Form), you would also go with
     (A*,B) and (B*,C), since every "determinant" must be a candidate key
     (in this case, they are the PKs in each relation), but that's not 3FN
     (as a matter of fact, a step further 3FN).

Regards,
Villas.

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
- Marcos V. Villas                  
- Instituto Brasileiro de Analises Sociais e Economicas              
- Rua Vicente de Souza, 29 (Botafogo)
- 22251-070, Rio de Janeiro, Brasil
- Internet: villas@ibase.br; FAX: (55-21)286-0541; Tel: (55-21)286-0348
From: jeffs@matt.ksu.ksu.edu (Jeff Smith)
Newsgroups: comp.databases
Subject: Re: Does the -space option work for any Paradox users?
Date: 23 Nov 92 19:52:56 GMT
Organization: Kansas State University
NNTP-Posting-Host: matt.ksu.ksu.edu

rhaven@cruzio.santa-cruz.ca.us writes:


>It sounds like you are starting your script from the command line when you
>(or your batch file) starts Paradox.  This is fine, but the -space arguement
>won't display until after that script has ended.  If you want to see the 
>startup memory allocation, make sure you are starting Paradox "raw",
>without any other arguments except for "-space".

>The current feeling is about -codepool 750 for a 4 mb machine, maybe a little
>more.  You will be trading query, report, and sort speed for increased PAL
>performance (although things will _still_ be faster).

Well I just realized what was wrong.  Boy I feel stupid.....
We load Paradox through a system of two batch files and those
batch files were not taking into account for parameter passing.

I relized this after I was trying to execute a script from the
command line: i.e.   paradox survey
and it didn't work so I found the parameter passing problem.  
I havent tried it yet, but I suspect it should work now!

Thanks

Jeff Smith
From: bj+@CMU.EDU (Brandon Chin)
Newsgroups: comp.databases
Subject: FoxPro 2.0 requirements
Date: 16 Nov 92 10:35:16 GMT
Article-I.D.: andrew.8f20M4W00VQjA5sqhV
Organization: Junior, Social & Decision Sciences, Carnegie Mellon, Pittsburgh, PA

Anyone know what the minimum hardware requirements for FoxPro 2.0 are?

Will it run on a 286? (gasp!) How much memory does it need, etc.

Thanks,
-brandon.
Newsgroups: comp.databases
From: csc4213@gsusgi2.gsu.edu (Uncle Remus)
Subject: Re: FoxPro 2.0 requirements
Organization: Georgia State University
Date: Wed, 18 Nov 1992 14:52:24 GMT

bj+@CMU.EDU (Brandon Chin) writes:

>Anyone know what the minimum hardware requirements for FoxPro 2.0 are?

>Will it run on a 286? (gasp!) How much memory does it need, etc.

I wouldn't run it on anything less than a 386SX with 2mb RAM. In reality, I'd
only run in on a 486-33 8MB RAM 300MB HD

Josh

-- 

Uncle_Remus - 404-355-0001   "Yeah, I've heard of Internet" - GSU User Services
       "I tried safe sex once, but I couldn't remember the combination" - Me
  "If you're gonna rock the boat, make sure you know who owns the ship" - Me
csc4213@gsusgi2.gsu.edu, Uncle_Remus, The Remulater, Josh, Guttman, Anton_Levey
Newsgroups: comp.databases
From: cpetersn@iastate.edu (Clifton R Peterson)
Subject: Re: Revelation ghost files after tradeup
Organization: Iowa State University, Ames IA
Date: Sun, 22 Nov 1992 23:06:31 GMT

In <By4Csz.CpI@nic.umass.edu> dtodd@titan.ucc.umass.edu (David M. Todd) writes:


>During a tradeup from 1.16 to 3.0 one upgrade of a directory/location
>bombed, leaving what I assume were temporary files in the following
>format:  DICT.CASES.91226  Some of these were able to be deleted, but
>several continue to show in LISTTABLES and reference real files on the
>disk, but don't exist to DELETETABLE.  Suggestions?

Not having had to come up from any lower than 2.12, I'm not sure, but one
very sure way to delete files is to manually remove the entries from the
REVMEDIA file of the volume and delete the associated DOS files from DOS.

You can SETALIAS VOLUME_LOCATION SYSPROG REVMEDIA REVMEDIA to get REVMEDIA
available for editing if you don't have a password on the SYSPROG account.
Then Do a LISTVOL on the affected volume and jot down the DOS names of the
problem files.
Then do a DELETEROW REVMEDIA for the problem files.
Then delete the DOS files from DOS with DEL.

They will be then gone.

Make a backup of your stuff before doing this in case you make errors.

Clif

>|~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ David M. Todd ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~|
>|Department of Psychology, University of Massachusetts, Amherst, MA 01003 USA|
>|Phone: 413/545-0158 ___ <DTodd@Titan.ucc.UMass.EDU> _____  Fax: 413/545-0996|
-- 
 _________________________________________________________________________
/ Clifton R. Peterson    1108 Burnett		(515)232-5254	    	  \
| B.S. Chem E            Ames IA  50010                                   |
\_______________"42"_is_one_hell_of_an_answer!!___________________________/
From: derwin@mach2.wlu.ca (Daryl Erwin)
Newsgroups: comp.databases
Subject: FOXPRO2 - Programming question (Menu & Flow)
Date: 19 Nov 92 14:49:12 GMT
Distribution: na
Organization: Wilfrid Laurier University

Background:

I created a project with a number of screens. I have a menu created a menu
using the menu builder. I want the menu to show up with the command
window. I think I need some sort of busy loop.

Problem:

How do I create a busy-loop that still checks for menu selections
and will let me get out of it when I select 'exit-app' from my menu. 
What should 'exit-app' do?

Do I turn of the command window then do a read?

Any pointers whould be nice. Thanks.
-- 
Daryl Erwin                                     Net Address: derwin@mach2.WLU.CA
Information Systems (woo-eee a new name!)       Surface Mail: P4-1, Main Campus 
Wilfrid Laurier University, Waterloo, Ontario 
Bus:(519) 884-1970 x2910                                          ... Go Hawks!
Newsgroups: comp.databases
From: jcole@osiris.cso.uiuc.edu (Joan Cole)
Subject: Re: Character supression/FoxPro 2.0
Organization: US US Army Corps of Engieneers - Construction Eng Research Lab
Date: Fri, 20 Nov 1992 18:28:15 GMT

The way I always do the get on passwords is @ X,Y GET passwdvar COLOR N/N
Black on black is invisible (although not secure from print-screen)

Newsgroups: comp.databases
From: les@chinet.chi.il.us (Leslie Mikesell)
Subject: Round robin scheduler?
Organization: Chinet - Public Access UNIX
Date: Tue, 17 Nov 1992 22:54:20 GMT

Can someone suggest an algorithm for doing round robin tournament
scheduling where one table has a list of contestants and their states,
one table has a list of judges and their states, and one table has
a list of contest times and locations.  What I want to do is to
match more or less random groups of contestants for a series of
rounds with the constraint that the judge must never be from the
same state as any of the contestants, and contestants should not
compete against any of the same players in subsequent rounds.
Each contestant will compete in a fixed number of rounds, with
the scheduling all done ahead of time (no winners against winners).
Perhaps this isn't a good thing to try to do in a database program,
but all the other info is there already.

Les Mikesell
  les@chinet.chi.il.us
From: elgaard@diku.dk (Niels Elgaard Larsen)
Newsgroups: comp.databases
Subject: Re: Normalizing 2NF -> 3NF
Date: 16 Nov 92 13:51:35 GMT
Organization: Department of Computer Science, U of Copenhagen

marti@nugget.inf.ethz.ch (Robert Marti) writes:

>In article <1992Nov15.223825.16263@odin.diku.dk>, elgaard@diku.dk
>(Niels Elgaard Larsen) writes:
>|> bonak@herky.cs.uiowa.edu (Esmail Bonakdarian) writes:
>|> >E.g., given a relation with three attributes, A, B, and C, where
>|> >attribute A is the PK, the following dependencies exist:
>|> >  R(A*  ,B   ,C)
>|> >    A -> B
>|> >         B -> C
>|> >i.e, A determines B, and B in turn determines C.
>|> >3NF would split this up into two relations:
>|> >  R'(A*,B)
>|> >  and
>|> >  R"(A*,C)  OR  R"(B*,C)
>|> >Which of these two latter relations is the "correct" one according to
>|> >the theory? Or does it always depend on the given semantics of the data
>|> >being modeled? It seems to me that I've seen both.
>|> 
>|> Both are correct since both (A,C) and (B,C) are on 3NF. That does of course
>|> not mean that they are equally good. Depends on the queries on the database.

>[note that I have slightly edited the original posting to conserve space]

>In the following, I assume that the functional dependency (FD)
>B -> A does _not_ hold, since if it did, no normalization would
>have been necessary in the first place.

>I haven't been looking at the theory books (Maier, Ullman) in a
>loooong time, but the solution with R'(A*,B) and R"(B*,C) is much
>better than the other one with R'(A*,B) and R"(A*,C).  Why?  Well,
>if you perceive an FD B -> C in the real world, you probably would
>like your system to enforce this integrity constraint.  (FDs and
>MVDs are really just special cases of integrity constraints.)  The
>simplest (and in some systems still the _only_) way to enforce an
>FD is to make its left hand side a key for a relation consisting of
>the attributes listed on both its left and right hand side.  (In
>older SQL-based systems, this has to be done by CREATing a UNIQUE
>INDEX for column B of table R".)

Yes, but this might not be efficient. Fx, if there are two groups of users
that wants to see an (A,B) and an (A,C) view resp., it requires a lot of
unnecessary joins. Eg, (A,B,C) == (Name,Address,Phone#). You typically look up
addresses from names and phone-numbers from names---not phone# from addresses.

A DBMS should be able to check other integrity constraints than primary keys. 
-- 
         Niels Elgaard Larsen          
         Institute of Computer Science,        
         University of Copenhagen      
         E-mail: elgaard@diku.dk 
Newsgroups: comp.databases,comp.os.msdos.programmer
From: bduncan@ve3ied.UUCP (Bill Duncan)
Subject: Re: FoxBase to `C' Contract: How much should I ask for? Help
Organization: TFMCS
Date: Mon, 16 Nov 1992 23:23:18 GMT

In article <RcR3TB2w165w@valnet> valnet!herrj@news.cs.indiana.edu writes:
>tpradeep@cs.tamu.edu (Pradeep K Tapadiya) writes:
>
># Howdy friends,
># 
># I have been approached by a company to write a generic FoxBase to
># `C' converter. The user-interface needs to be converted to "printf"
>
>Sounds like fun!
>
># So far I used to program on per hour basis. This is the first time
># I have been asked to bid for a project. I do not how many man-hours
># this work would involve. Since this is my first break, I do not
># wish to loose this contract. Would the experienced readers on the
># net advice me on how much I should bid for this contract? Any
># kind of advise/strategy is appreciated.
>
>You might try posting to misc.jobs.contract or looking for its FAQ.
>Try the latter first.
>
>

You don't give us any clue on the scope of the problem.  I converted a
non-trivial FoxBase application (300+ related files) in about a month.
But it was my own FoxBase code.. ;-), so of course I didn't have the
ramp up time learning the application.

I developed a number of tools functions which emulated the FoxBase counterparts.

The new system was almost identical in operation, but on avaerage was 16x
faster, and a fraction of the size (on a MessyDOS machine).  The FoxBase
system required 500+K of RAM which was a problem because of TSR's.  The new
system was done in small model.  The executable was about 60K.  I forget how
many LOC there was, but it was non-trivial.

Bill Duncan, (bduncan@ve3ied.uucp)
From: lapworth@mizar.usc.edu (Bill Lapworth)
Newsgroups: comp.databases
Subject: Microsoft Access & Visual Basic
Date: 20 Nov 1992 10:34:48 -0800
Organization: University of Southern California, Los Angeles, CA
NNTP-Posting-Host: mizar.usc.edu

Can anyone tell me how much overlap there is between _Access Basic_, the
programming language of Microsoft Access, and _Visual Basic_?  Would
knowning one put me a long way up the learning curve of knowing the
other?
From: aahz@netcom.com (Mean Green Dancing Machine)
Newsgroups: comp.databases
Subject: Re: How About COMP.DATABASES.PARADOX ?
Date: 18 Nov 92 19:17:23 GMT
Article-I.D.: netcom.1992Nov18.191723.5056
Organization: Don't blame me, I voted for Bill 'n' Opus

In article <mr.722063992@ogre> mr@ogre.cica.indiana.edu (Michael Regoli) writes:
>
>However, in the Grand Scheme of Things, it should probably look
>something like "comp.databases.ibmpc" from which, if traffic allows:
>
>  comp.databases.ibmpc.dbase    comp.databases.ibmpc.pdox
>  comp.databases.ibmpc.foxpro   comp.databases.ibmpc.pcfile

The problem with this architecture is that dBase, for one, can also be
used on a Mac or Unix box.  How does Windows fit into this?  Windows/NT?
OS/2?  With more and more applications ported to multiple OSs, it makes
little sense to ghettoize applications this way, even if they currently
run on only one platform.
-- 
                         --- Aahz (the *other* Dan Bernstein)
                             @netcom.com 

Hugs and backrubs -- I break Rule 6

Trying to be happy is like trying to build a machine for which the only
specification is that it should run noiselessly.
Newsgroups: comp.databases
From: gary@delfin.com (Gary Bartow)
Subject: Query by example?
Organization: Delfin Systems, Sunnyvale, CA.
Distribution: usa
Date: Thu, 19 Nov 1992 22:28:36 GMT

I just heard the phrase "Query By Example" and was wondering if anyone knew what it was all about.  It seems to be a technique to help users form their queries more precisely.
Newsgroups: comp.databases
From: ntruelove@aardvark.ucs.uoknor.edu (STEP OUT OF THE CAR PLEASE)
Subject: Re: Query by Example
Originator: usenet@midway.ecn.uoknor.edu
Date: Fri, 20 Nov 1992 18:11:00 GMT
News-Software: VAX/VMS VNEWS 1.41    
Organization: University of Oklahoma - University Computing Services

I'll take a stab at this one.  Query by example is graphical structured query
tool that simplifies queries.  A 'Query Form' looks has columns just like the
table it is designed to query.  A checkmark is placed under any column desired
in the results, which are placed in a table called ANSWER.  Any comparisons or
tests are also placed in theses columns.  

Multi-table queries can be performed by linking several query forms through the
use of tilde variables.  This is the closest thing I've ever seen to true
object-oriented computing.  While it is not programming, it does replace SQL
in Paradox, and the ASCII code generated by the query form can be saved to a
script file to be re-used at a later time.

I have oversimplified things for the purpose of illustration.  There are
powerful features for adding, deleting, forming groups, etc., that I will leave
it to you to explore.


Naren
Newsgroups: comp.databases
From: mclemore@rebec.asd.contel.com (Ken McLemore)
Subject: Re: Query by example?
Reply-To: mclemore@rebec.asd.contel.com (Ken McLemore)
Organization: CONTEL Federal Systems
Distribution: usa
Date: Mon, 23 Nov 1992 14:05:23 GMT

i've seen QBE in paradox but are there other implementations
available for DBs conforming to ANSI SQL ?  if so, are they
commerical and/or shareware ?  we're looking for an mechanism for
non-database types to perform queries, any leads would be helpful.
thanks in advance, ken
Newsgroups: comp.databases
From: Peter.Weekes@bbs.actrix.gen.nz
Subject: Re: How About COMP.DATABASES.PARADOX ?
Organization: Actrix Information Exchange
Date: Mon, 16 Nov 1992 08:18:41 GMT

I vote yes ! 

Peter
-- 
Peter Weekes          PARADOX Consultant             |
Box 7163              Parasitologist                 | 
Wellington South      Epidemiologist                 |   
New Zealand           Peter.Weekes@bbs.actrix.gen.nz |           
Newsgroups: comp.databases,comp.databases.ingres
From: cs_mj@gsbacd.uchicago.edu (Mark Jaeger)
Subject: Re: Ingres questions
Organization: 
Distribution: usa
Date: Fri, 20 Nov 1992 21:40:03 GMT

In article <25987@sybase.sybase.com>, wong@sybase.com (J. Wong) writes:
> In article <1992Nov11.180040.7771@dcatlas.dot.gov> sethg@dcatlas.dot.gov 
> (Seth Grimes) writes:
>>I don't know of any workaround other than vertically partitioning your tables.
>>On the other hand, Ingres 6.5 to be released in the spring will support BLOBs
>>and presumably remove the 2000-byte limit (based on Ingres's current page
>>size of 2048 bytes) on general fields.
> 
> Wrong!  INGRES 6.5 will support BLOBs as columns, but will not remove the 2000
> byte limit on tuple size.

That's my understanding also.  You will be able to have a table with a
BLOB column, and that column takes n bytes as part of a row (where n is
small, say, less than 20), but the _data_ returned for the column is a
BLOB type (i.e., very large).  What's really stored in the table itself
is not the BLOB value, but rather just a pointer to it.  

If I understand things correctly, you'll still be limited to an absolute
maximum of 2008 bytes per row (2048 less 40 byte per page overhead),
counting a BLOB as n bytes (from above).

It probably was not prohibitively hard for Ingres to implement this,
since it probably involved use of the Object Manager and creation of a
new INGRES datatype.  They might have had to make changes to the ADF
(abstract data facility) and the GCC code (communications) to support
the possibility of so much more data being passed back and forth.  

The 2000-byte limit is so ingrained in LAR (the logging and recovery
system) that it's probably a _much_ more difficult limit to break.

--Mark Jaeger				internet: cs_mj@gsbvax.uchicago.edu
Graduate School of Business		yellnet:  (312) 702-0328
University of Chicago			faxnet:   (312) 702-0233
Disclaimer: My opinions are my own and not those of my employer.
Ich bin ein Virus.  Mach' mit und kopiere mich in Deine .signature.

Newsgroups: comp.databases
From: moursand@lonestar.utsa.edu (Bowen M. Moursund)
Subject: Re: Insufficient Memory error in dBase IV
Organization: University of Texas at San Antonio
Date: Mon, 16 Nov 1992 21:57:19 GMT

In article <1992Nov16.153726.19234@bmers145.bnr.ca> jfile@bnr.ca writes:
>I have a form that has about 35 gets and 35 says complete with
>parameters for range, error, message etc.  When the form is displayed,
>I get the "Insufficient memory, Press any key to continue" message.  Then

Jonathan - This sounds like a BUCKET problem. If a value of 3 didn't work,
try 4. You might also try adjusting the DOS environment variable DBHEAP up
or down: the default is 50. SET DBHEAP=10 or SET DBHEAP=90.

- Bowen -
From: ummalik@ccu.umanitoba.ca (Ijaz Rashid Malik)
Newsgroups: comp.databases
Subject: Re: A few Paradox App. WorkShop Queries *AGAIN*
Date: 18 Nov 92 12:32:56 GMT
Organization: University of Manitoba, Winnipeg, Canada


Hi,
Still seeking help for following question....

>I had a few questions about Paradox's application workshop and I would
>very much appreciate any help I can get.

>1. How can I attach Action Objects to the menu items if I design both
>   seprately?
>2. How can I display the results of a Query when I run it from within
>   application workshop or "my" application as part of a user request?
>   Is there any way to display the actual answer table? I have tried
>   many ways but all it gives me is the number of records in answer--if
>   this option is checked while designing query in app. work shop.
>3. Is there any way to compile my app. or scripts so that they run faster?

Thank you very much in advance!!!

Malik
ummalik@ccu.umanitoba.ca
Xref: sparky comp.databases:7884 comp.databases.oracle:2215 comp.databases.ingres:1907
Newsgroups: comp.databases,comp.databases.oracle,comp.databases.ingres
From: dbmoore@us.oracle.com (Dennis Moore)
Subject: Re:  I heard a Rumor about Oracle 7 and Forms
Organization: Oracle Corporation, Redwood Shores CA
Date: Mon, 16 Nov 1992 18:32:01 GMT
X-Disclaimer: This message was written by an unauthenticated user
              at Oracle Corporation.  The opinions expressed are those
              of the user and not necessarily those of Oracle.

In article <13NOV199213095729@erich.triumf.ca> grant@erich.triumf.ca (Peter A. Grant) writes:
>In article <1992Nov13.184731.21707@cs.rochester.edu>, zhang@cs.rochester.edu (Zhang Ju) writes...
>> 
>>I heard a rumor which goes that the delay of ORACLE 7 is because of its
>>incompatibility with Forms 3. So Oracle 7 is actually waiting for Forms 4.
>>...
>
>
>That's the first I've heard of that rumor!  From all that I've seen or 
>heard ORACLE7 supports SQL*Forms 2.3 and 3.0.  It's being released before
>Forms 4.0 is even out in beta (GUI - text mode it is already I believe).
>
>I think that rumor is completely false...
>
[long .sig deleted]

SQL*Forms 3.0 is supported against ORACLE7.  SQL*Forms 2.3 is not, although
Applications customers using Application Object Library (Application Foundation)
are still supported with it.  Please contact your local support organization if
you want to clarify your support status.

-- Dennis Moore, my own opinions, etcetcetc
Newsgroups: comp.databases
From: cargibbs@atlas.cs.upei.ca (Rick Gibbs)
Subject: Clipper S'87 and DOS 5.0
Organization: University of Prince Edward Island
Date: Mon, 16 Nov 1992 23:54:32 GMT

	I am re-sending this message, as the first one was chewed up in
transmission somehow: For years I have used Clipper S'87 on an old xt and
the applications ran smoothly enough. 
	However, when I up-graded to a 386 and DOS 5.0, those same 
applications crash and I get an "OUT OF MEMORY" message. What gives?
	Will I have to re-compile the source code in Clipper 5.01?
Presently, if I boot up with a plain system disk in A: drive, I can run
the applications..... I think EMM386 is the culprit...
	Any ideas ???

Rick Gibbe
cargibbs@atlas.cs.upei.ca
From: shm@syl.syl.nj.nec.com (Shailendra Majmundar)
Newsgroups: comp.databases
Subject: Which one to choose - Pioneer, DB Vista or Databoss 3.5??
Date: 15 Nov 92 22:25:03 GMT
Article-I.D.: research.1992Nov15.222503.27187
Reply-To: shm@syl.nj.nec.com
Organization: NEC Systems Laboratory, Inc.

I need to implement a small relational in Windows 3.1 in a very short time 
period.  Since FoxPro 2.5 is not out yet, I am looking at Pioneer's Packages 
that go with VB Pro. I am also looking at brotures of Databoss 3.5 and DB 
vista in which I have no experience. Could someone share their experience 
with Databoss and DB vista or pass any suggestions please?

Many thanks in advance,

Sam (shm@syl.nj.nec.com)