HDTenEightyP/NetNews huggingface dataset:
From: rjanes@fox.nstn.ns.ca (Robert Janes)
Subject: Misys Custom Reporter - HELP!!!!
Organization: Micronav International
Date: Wed, 12 Aug 1992 13:10:58 GMT

I am having trouble with the Misys Custom Reporter (5.1) running as a 
single user on a 386 machine with 550K memory free.  The following problems 
occur when I attempt to test report scripts:

1) weird ASCII characters appear in the report and the program crashes
2) the prgram exits to DOS
3) the program reboots the computer
4) error messages such as "Unable to access at end of file ..." or "File 
unit 1 in use" appear.

Everything seemed fine until I installed version 6.0 of the Misys Inventory 
System.  The guy I talked to on the support line said the two programs are 
compatible.  I have already tried reinstalling the reporter (and also 
version 6.0 of Misys) and also I removed all memory resident programs but 
nothing helps.  Anyone have any ideas?  I am stumped!  Thanks in advance.

Mike Mac Cormack



Micronav International Inc
P.O.Box 1523 / 104 Marine Drive
Sydport Industrial Park,
Sydney, N.S. Canada B1P 6R7
Tel: 902-564-8833      Fax: 902-564-8764
Newsgroups: comp.sys.novel,comp.databases
From: joe@eng3.sci.com (Joe LaRocque)
Subject: Unexpected Errors with Paradox on Novel
Reply-To: joe@eng3.sci.com (Joe LaRocque)
Organization: SCI Technology, Inc., Huntsville, Al.
Distribution: usa
Date: Fri, 21 Aug 92 14:28:16 GMT

We are having some problems in running Paradox 3.5 on a Novell 3.1 network.
When executing Paradox we sometimes receive 'unexpected errors' and are
dropped back to DOS.  The error codes we are seeing are:

	1.  4C7CGP0057
	2.  0492GP14D7
	3.  02E6GP00FF
		or
	4.  469DGP1B57

These errors appear on either a 386SX PC or a Dell 486DX.  

If anyone could explain why these error codes are occuring, or how to 
prevent them, we would owe them our undying gratitude.

Thanks in advance for the assistance.


Joe La Rocque
joe@eng3.sci.com
SCI
Huntsvile, AL
From: jdr@starflight.Corp.Sun.COM (Jon Roland)
Newsgroups: comp.databases
Subject: Re: nested SQL select
Date: 21 Aug 92 05:41:55 GMT
Reply-To: jdr@starflight.Corp.Sun.COM
Organization: Sun Microsystems, Inc.
NNTP-Posting-Host: starflight.corp.sun.com

In article 1758@neptune.inf.ethz.ch, marti@nugget.inf.ethz.ch (Robert Marti) writes:
>In any case, I don't have a "one-SQL-statement-solution" to your
>problem, either ...
>
>I didn't follow that thread.  While I (again, see above) agree that
>SQL has its flaws ("brain-damaged" is a bit too strongly worded for
>my taste), you will certainly have a hard time to "stamp it out" --
>at least for the time being.  Even Mike Stonebraker, whose QUEL
>language design is regarded by most academics to be superior to
>SQL, has termed SQL "intergalactic data speak".  (Sorry, I don't
>remember where.)
>
>jr> Relational algebra allows expressions which have no SQL
>jr> equivalents, because SQL is not an implementation of relational
>jr> theory, and doesn't threaten to become one in the future.
>
>An interesting statement.  Could you give me a few examples of
>relational algebra expressions which have no SQL equivalent?
>(Please only use operators from the set {selection, projection,
>union, difference, cartesian product}.  This set of operators
>has been shown to be complete.)

You discussed one in your own posting. A single relational algebra
expression can be composed that does not translate into a single SQL
statement, but requires several of them. Granted, it does translate,
but so clumsily that one has to complain.

More serious, however, is the fact that in relational algebra operators
applied to relations yield relations, whereas in SQL they do not always
do so. To be a relation, a table's rows must be unique, and SQL can
yield tables with redundant rows.

Of course, we must distinguish between relational algebra, calculus, and
Codd's relational theory -- which is based on them but extends them.
Relational theory reasonably allows self-referencing or recursion, which
SQL does not.

However, I would contend that relational algebra (and calculus) lack 
sufficient structure to provide an adequate theoretical foundation for
commercial databases.

There is no really good substitute for Turing-computable languages, even
only for use in data access.

Mike Stonebraker's latest language, developed with his students at
Berkeley, is Postquel, used with their Postgres db. It is in the Quel
tradition, but not upward-compatible with it. You might also look at
Rubix, a nice functional language, and Q'Nial, considered as a database
language.

I am emailing you the "SQL Shortcomings" thread.

---

jdr@starflight.corp.sun.com, starflt@uunet.uu.net
Jon Roland
Starflight Corporation, 1755 E Bayshore Rd #9A,
Redwood City, CA 94063-4142, 415/361-8141
From: orpheus@reed.edu (P. Hawthorne)
Newsgroups: comp.databases.theory
Subject: A Graph Theory Newsgroup, Perhaps?
Date: 18 Aug 92 08:47:40 GMT
Article-I.D.: reed.1992Aug18.084740.26726
Organization: Reed College, Portland OR


  Graph theory is at the heart of so many fields that it is somewhat
obscured by its own versatility.

  I feel that there ought to be a graph theoretic newsgroup, if only for
the insights that such a multidisciplinary newsgroup could offer.

  I'd be interested in hearing from others, to see if a more formal
approach to creating such a newsgroup is warranted.


  Theus (Prometheus Hawthorne - Jones, orpheus@reed.edu)
Newsgroups: comp.databases.theory
From: jfr@redbrick.com (Jon Rosen)
Subject: Re: Optimistic Concurrency Control
Organization: Red Brick Systems, Los Gatos, CA
Date: Wed, 12 Aug 1992 16:20:27 GMT

In article <Bsu6u4.3vr@wpi.WPI.EDU> rcarter@wpi.WPI.EDU (Randolph Carter <Joseph H. Allen>) writes:
>jfr@redbrick.com (Jon Rosen) writes:
>>In article <DAVIDM.92Aug10113706@consilium.com> davidm@consilium.com (David S. Masterson) writes:
>>>>>>>> On 9 Aug 92 20:52:20 GMT, davidw@cascade.demon.co.uk (David Wilkinson)
>>>>>>>> said:
>>>> Does anyone know of any references about optimistic concurrency control in
>>>> distributed database systems? I've read lots about the theory, but would
>>>> like to know how it works out in practice.
>
>>>We used optimistic locking in our system in order to prevent locking the
>>>database while a human-speed transaction was going on.
>
>>  We are investigating optimistic concurrency as a form of locking for
>>  our relational query database management system
>
>Does (can) the application program itself retry when rollback occures?  I'm
>curious about the implication to users in systems where transactions fail
>and must be retried.  I know this is a standard technique in RDMS, but I can
>think of examples of systems where this is unacceptable.  So I'm just
>wondering if applications which use databases with modern concurrency
>control techniques are written to attempt retries themselves or if they
>usually abort all the way back to the user.  The textbooks I've read imply
>that they abort all the way back to the user (that they have to "resubmit"
>the transaction).  Perhaps they abort all they back to the user but remember
>the data entered in the transacation so that the user only has to hit a
>retry key?
 
 Of course, that all depends on the application.  First of all, any 
 reasonable SQL application (I am assuming SQL here but other data
 access languages would be included as well) must be prepared for
 any statement to fail for a number of reasons.  In some cases, the
 application may be able to determine that it is possible to retry
 the transaction.  In others, it will be necessary to alert the user.
 This depends on what the transaction is doing.  For instance, in an
 ATM application, if the transaction aborted because the balance
 record had been updated by another transaction between the first
 transaction's read and its attempted update, this could be a pretty
 serious situation if you don't alert the "user" (i.e., customer -
 maybe s/he doesn't want to withdraw money if s/he found out the
 actual balance was lower than expected).  And of course, it could
 depend on what the other transaction was.  If it was a deposit,
 there might be no need to alert the customer before permitting the
 transaction to be retried (in which case, it would probably succeed).

 I am not suggesting that OCC is a good thing to use in high-volume
 OLTP apps.  In fact, my investigation shows the literature uniformly
 stating that OCC is best used in query-intensive low-volume OLTP apps. 

 Jon Rosen
Newsgroups: comp.databases.theory
From: jah@cs.mu.OZ.AU (James Harland)
Subject: Second CFP: Workshop on Deductive Databases at JICSLP'92
Originator: jah@munta.cs.mu.OZ.AU
Reply-To: jah@cs.mu.OZ.AU (James Harland)
Organization: Department of Computer Science, University of Melbourne
Date: Tue, 18 Aug 1992 06:12:17 GMT


		 Second Call for Participation

		Workshop on Deductive Databases
	         Saturday, 14 November, 1992
		    in conjunction with the
       Joint International Conference and Symposium on Logic Programming
		November 9-13, 1992, Washington D.C., USA

The development of deductive database systems, which apply logic
programming techniques to databases, has been of growing interest in recent
years, and has resulted in a significant amount of interaction between
researchers of varying backgrounds. This workshop is intended to provide a
forum for theoreticians, implementors and those involved in applications to
exchange ideas on the development of deductive databases systems. Topics
may include (but need not be limited to) program transformations, parallel
and distributed execution, optimization and implementation techniques, and
applications.

Abstracts and/or proposals for system demonstrations should be send to the
address below:

	 Prof. Kotagiri Ramamohanarao
	 Department of Computer Science
	 University of Melbourne
	 Parkville, 3052
	 Australia

	 email: rao@cs.mu.oz.au
	 Phone: +61 3 282 2400
	 Fax:   +61 3 282 2444

Abstracts should be no more than 8-10 pages in length, and there is no
restriction on the format to be used. However, Latex/Tex format is
preferred, particularly styles similar to those used for submissions and/or
camera-ready copy for the main conference. Submission by email rather than
printed copies is strongly encouraged. 

Copies of all accepted abstracts will be distributed to participants at the
workshop. In order to provide continued access to the abstracts presented
at the workshop, the proceedings will be available as a University of
Melbourne technical report.

Submission Dead-line: September 7, 1992
Notification Sent: October 1, 1992
Final Manuscript Due: October 15, 1992

Organizing Committee: Kotagiri Ramamohanarao, Guozhu Dong, James Harland
From: ftmx@acad3.alaska.edu
Newsgroups: comp.databases.theory
Subject: data and/or info
Date: 18 Aug 92 18:19:47 GMT
Organization: University of Alaska Fairbanks


	Anyone who has data or other materials about the relations of
introcellular organs? I am interested in the research of
interorgan-relationship. Anyone who has information about this please tell me.
Thank you very much. Anyone who is interested in this please don't hesitate to
contact me.
Thank you very much.
From: John.Roddick@levels.unisa.edu.au
Newsgroups: comp.databases.theory
Subject: BNCOD '93 - When is it?
Date: 18 Aug 92 05:47:37 GMT
Organization: University of South Australia

Does anyone know when and where BNCOD is next year?  I can't find it in
COMP.ANNOUNCE.CONFERENCES

John.

-------------------------------------------+-------------------------------
John Roddick                               | Ph:  (08) 302 3463
School of Computer and Information Science | Itn: +61 8 302 3463
University of South Australia              | Fax: (08) 302 3381
THE LEVELS      SA 5095                    | Net: Roddick@UniSA.edu.AU
SOUTH AUSTRALIA                            |
From: davidm@consilium.com (David S. Masterson)
Newsgroups: comp.databases.theory
Subject: Re: Optimistic Concurrency Control
Date: 12 Aug 92 20:36:25 GMT
	<1992Aug11.050133.23420@redbrick.com>
Organization: Consilium Inc., Mountain View, California
In-reply-to: jfr@redbrick.com's message of 11 Aug 92 05:01:33 GMT
X-Posting-Software: GNUS 3.13  [ NNTP-based News Reader for GNU Emacs ]

>>>>> On 11 Aug 92 05:01:33 GMT, jfr@redbrick.com (Jon Rosen) said:

> The advantages of optimistic concurrency [...] are the high level of
> concurrency without lock contention that can be achieved.  We at Red Brick
> find this particularly interesting because query servers do not have the
> need to provide a high level of concurrency control for transaction
> processing.  We are willing to sacrifice TPS rates in exchange for high
> availability and query performance.  Much of the overhead of TPS-bound
> systems occurs inside the lock manager, particularly if a seperate process
> is involved in handling locking activity.

Rdb/VMS implements read-only snapshot files (I imagine others do to) that
allow queries to operate concurrently with write transactions.  How does this
affect your view of the usefulness of optimistic locking?
--
====================================================================
David Masterson					Consilium, Inc.
(415) 691-6311					640 Clyde Ct.
davidm@consilium.com				Mtn. View, CA  94043
====================================================================
"When the government attempts to regulate everything, all is lost."
-- Thibaudeau
Newsgroups: comp.databases
From: kxs5829@ultb.isc.rit.edu (K.X. Saunders )
Subject: Re: Sybase 4.2 BUG.  Is there anybody else who thinks this is a bug!!!
Originator: kxs5829@ultb
Organization: Rochester Institute of Technology
Date: Fri, 21 Aug 1992 03:49:50 GMT

In article <1992Aug19.231324.2259@infonode.ingr.com> srb@barakam.b17d.ingr.com (Sreedhar Barakam) writes:
>I have a Sybase 4.2 server(on SunOS 4.1.2) which has two tables
>t1,t2. They are populated like this:
>
>  t1  t2
>  c1  c1
>  1   1
>      2
>      3
>      4
>      5
>      6
>      7
>      8
>      9
>     10
>
>For the following query:
>
>select * from t1 where c1 <any (select c1 from t2)
>
>The results are:
> c1
> -----------
>           1
>           1
>           1
>           1
>           1
>           1
>           1
>           1
>           1
>If you have two 1's in t1 the results would be 1 being returned 18 times.
>You could come up similar examples for operator >.    Imagine getting 10000

	Yeah, it's a bug.  There is only one row in the table you are selecting
from.  So the result table cannot consist of more rows than you started with.

	- Kyle

-- 
+-"Remember, [MS]DOS is sort of a UNIX deviant already" - dmoscny@piglet.-----+
|    // Only /\          kxs5829@ultb.isc.rit.edu                 cincinatti. |
| \ //      /--\MIGA     kyle@nick.csh.rit.edu                    oh.us       |
| \X/ SQLdb - $40 rdbms  Rochester Institute of Technology                    |
Newsgroups: comp.databases
From: dlw@odi.com (Dan Weinreb)
Subject: Re: OODB Experiences/Opinions (Objectivity)
Reply-To: dlw@odi.com
Organization: Object Design, Inc.
Date: Mon, 17 Aug 92 22:17:04 GMT

In article <1992Aug14.191216.20576@slc.com> marcs@slc.com (Marc San Soucie) writes:

   > Journal of Object Oriented Programming. June 92. pp 27-43.

   3. It appears that not all of the products were evaluated with equal rigor.
   At least one of the evaluations appears to be based upon an evaluation copy
   of the product, which was available to the authorUs for a period of one
   month in early 1991. Evaluation of other products were based upon extensive
   use. What is often apparent after extensive use is often not apparent
   during a one month evaluation - for example usability, scalability and
   robustness.

I'd like to go even farther than Jacob and Marc.  From reading the
article, I did not get the impression that the authors did a one month
evaluation on each of the OODBMS's they describe.  It strongly
appeared to me that for most of the products, they simply read the
manual.  People reading the article should keep in mind the inherent
limitations of an evaluation that's not based on actual use.

Newsgroups: comp.databases
From: dlw@odi.com (Dan Weinreb)
Subject: Re: Info on OODBMs needed
Reply-To: dlw@odi.com
Organization: Object Design, Inc.
Date: Mon, 17 Aug 92 22:20:21 GMT

In article <GDZ572@netmbx.netmbx.de> jrobie@netmbx.netmbx.de (Jonathan Robie) writes:

   dlw@odi.com (Dan Weinreb) writes:

     We are looking for some OODBMs to run on a SPARC.

Just for the record, it was not I who wrote the above.  Perhaps the
above came from a posting in which I replied to someone who asked the
question.  In fact, my company makes an OODBMS product that runs on a
SPARC (as well as many other Unix workstations plus Windows), so if I
wanted one, I would not have to look far.

Dan Weinreb

Object Design, Inc.
1 New England Executive Park
Burlington, MA 01803
+1 617 270-9797
From: scott@shuksan.boeing.com (Scott Moody)
Newsgroups: comp.databases
Subject: Versant -- info desired
Date: 17 Aug 92 21:45:24 GMT
Organization: The Boeing Co., MMST, Seattle, Wa.
X-Newsreader: Tin 1.1 PL4

We are hearing that Versant is breaking into the commercial OODBMS 
world and will be used in IBM's Data Integration work, sitting
below a PCTE tool interface.

Does anyone have information about Versant that could be
distributed to this newsgroup?

Thanks in advance.
-- 
Scott Moody   (206) 477-4295   "There are no answers .. just cross references"
     scott@shuksan.boeing.com  
     uunet!bcstec!shuksan!scott
Newsgroups: comp.databases
Subject: Re: Paradox 4.0 & Paradox for Windows
From: kkoeser@vitro.com (Ken Koeser)
Date: 12 Aug 92 16:15:53 -0500
Organization: Vitro Corporation
Nntp-Posting-User: eswgrk

In article <01GNETVGTN38003PR8@NAUVAX.UCC.NAU.EDU>, DEVRIES@NAUVAX.UCC.NAU.EDU (Ernie DeVries) writes:
> The word from Borland, as of last week, is that Paradox 4.0 will ship 8/17/92.
> 
> There is no firm word on Paradox for Windows.  It will probably be in the
> September/October time frame.  Quattro Pro for Windows is expected to ship
> about 2 weeks after Paradox 4.0.

Does anyone know of planned updates to products which use Paradox, specifically 
Paradox Engine and ObjectVision?  I'd like to take advantage of the BLOB
fields in other apps that use Paradox tables, but not in Paradox itself. 
Thanks

Ken Koeser
Vitro Corporation
kkoeser@vitro.com
Newsgroups: comp.databases
From: tedboone@brahms.udel.edu (Edward F Boone)
Subject: Re: FoxPro 2.o and Win 3.1 ??
Organization: University of Delaware
Date: Fri, 14 Aug 1992 22:39:09 GMT

In article <1992Aug14.184614.1298@nntpd2.cxo.dec.com> lindsey@tincup.enet.dec.com (Randy Lindsey) writes:
>
>In article <1992Aug13.211229.1@acad3.alaska.edu>, fscll@acad3.alaska.edu (Christopher Lee Lott -- One foot in the grave and the other slipping) writes...
>>I am sure this is probably an FAQ, but I am 
>>trying to get FoxPro 2.0 to work with Windows 3.1
>> 
>>I used the install applications option in the setup and chose 
>>the FoxPro Extended version, but when I try to run it the screen 
>>goes black like it should right before it runs a dos app, but then it 
>>bumps me back into windows.... 
>> 
>>does anyone know how I can get this working? I hate having to exit windows 
>>all the time to get into My FoxPro database!
>
>FoxPro Extended uses a DOS extender which is NOT compatible with Windows 3.1.
>However, Fox, oops, I mean Microsoft, will soon have an update which is.
>In the meantime, you have to run FoxPro standard under Windows.  All of this
>refers to Windows in 386 mode, I believe.  In real or standard modes, I
>don't think Windows has a conflict.
>
>The problem is in management of extended memory.  The DOS extender used
>by FoxPro doesn't support VCPI or one of those other standards which
>Windows uses.
>
I will second this opinion.  The only option right now is to run the
UNextended version of FoxPro...until FoxPro for Windows comes out.  This
is scheduled for December/January, but knowing Microsoft....
Anyway, I have used FoxPro for Windows, and it is great!  So hold on for
a couple more months!

Ted
From: wanling@swl.spec.ptg.sony.co.jp (Quak Wan Ling)
Newsgroups: comp.databases
Subject: What is a real-time database?
Date: 18 Aug 1992 21:33:32 -0500
Organization: UTexas Mail-to-News Gateway
NNTP-Posting-Host: cs.utexas.edu

Can anyone please tell me what is a real-time database ?
What are its features and what application areas does it have ?
Please recommend books or papers for reading.

Thanks.

------------------
Quak Wan Ling	<wanling@swl.spec.ptg.sony.co.jp>

Sony Precision Engineering Center (S) Pte Ltd
Tel: (65)776-5858	Fax: (65)779-5657
------------------
From: TONY@SLACVM.SLAC.STANFORD.EDU (Tony Roder)
Newsgroups: comp.databases
Subject: Re: Looking for a database (I'm a nonprogrammer..)
Date: 14 Aug 92 18:44:33 GMT
Article-I.D.: SLACVM.92227.104433TONY
Distribution: na
Organization: Stanford Linear Accelerator Center

In article <BsJ3I3.1tx@cs.dal.ca>, goldrick@ug.cs.dal.ca (Majeed  Goldrick)
says:
>
>I am looking for a very rudimentary database program with an idiot-proof
>user interface.  The data entry screen(s) should be able to be set up
>much like a printed page - it could be character-based or WYSIWYG
>(Windows programs are O.K.).  This primary interface form should be able
>to be cross referenced against other forms with related information (I
>guess this is where relational database comes from??).  For example,

I recommend Alpha Four.  It's a very user-friendly, menu-driven relational
db program with which I've had satisfactory experience.  Available from
Egghead [800-EGGHEAD] at $95 for the 'upgrade' version, i.e. if you send
the title page of any other db program or program that has db capabilities.
Egghead will explain it better than this.  Hope it's also available in
Canada....

-----------------------------------
Tony Roder, speaking his mind .....
Newsgroups: comp.databases