HDTenEightyP/NetNews huggingface dataset:
From: tthieman@agsm.ucla.edu (Todd Thiemann)
Subject: RDBMS Foreign Character Set Support
Followup-To: tthieman@agsm.ucla.edu
Summary: Requesting level of internationalization among RDBMS vendors
Keywords: foreign character internationalization
Organization: UCLA, Anderson Graduate School Of Management
Date: 21 Aug 92 13:40:33 PDT


Greetings,

I am attempting to discover what the level of support is among the
various RDBMSs is for foreign character sets.  If you could answer
via email, I would gladly summarize the results and post them on
the net.

For instance, I know that ORACLE V6 supports 8-bit characters (e.g. German
umlauts, Spanish tildes) and ORACLE V7 will add 2-byte character sets
(e.g. Asian and Arabic).  What about the other vendors such as 
Informix, Ingres, Interbase/Borland, Sybase, and Rdb/DEC?

Aufwiedersehen, au revoir, adios,

Todd

tthieman@agsm.ucla.edu
From: edwards@world.std.com (Jonathan Edwards)
Subject: Re: distributed transactions
Organization: The World Public Access UNIX, Brookline, MA
Date: Fri, 21 Aug 1992 12:44:30 GMT

In article <9208210244.AA07031@hplwk.hpl.hp.com> albert@HPLWK.HPL.HP.COM (Joseph Albert) writes:
>
>If a non-blocking commit protocol is used, any transaction started at
>a remote site which went down can be aborted, releasing its locks, and
>leaving the database in a transaction-consistent state.
>
Could you site some references or examples for this statement?
Certainly the conventional 2-phase commit protocol (which is what is
implemented by all commercial instances of distributed TP that I know of)
can easily leave you in a blocked-or-inconsistent state.
See Bernstein and Goodman: Concurrency Control and Recovery in Database
Systems. They state as a 'proposition' that any distributed transaction
protocol has to be blocking in the presence of communication failures or
total failures.



Newsgroups: comp.databases
From: devine@49ers (bob devine)
Subject: Re: nested SQL select
Organization: Digital Equipment Corporation
X-Newsreader: Tin 1.1 PL3
Date: Wed, 12 Aug 1992 20:22:32 GMT

thompson@stars.gsfc.nasa.gov (William Thompson, code 682.1, x2040) writes:
: Not to start any flame wars, but is anything else but SQL being worked on as a
: standard for intercommunication between different vendors databases?  We're
: going to be using SQL because we have that requirement.  

Just got word from the SQL group that SQL92 doc is ready for review.
Don't bother me with requests because I don't have any copies!!

Otherwise, look at work being done at Xbase which is the effort
to allow a "standard" Dbase-like interface.  The ODBC API is
also gaining more adherents (check the industry rags for latest).

Bob Devine
From: abledsoe@sdf.lonestar.org (Al Bledsoe)
Newsgroups: comp.databases
Subject: Re: Looking for uniVerse/INFORMATION/PICK/Reality/Unidata users
Date: 21 Aug 92 14:03:56 GMT
Organization: sdf Public Access UNIX, Dallas--unrestricted free shell access

In article <1992Aug19.112532.40833@uvmark.uucp> jim@uvmark.uucp (Jim Todhunter) writes:
>
>Hello out there!  I am trying to compile a list of users of the uniVerse,
>INFORMATION, PICK, Reality, or Unidata environments on the net.  If you
>are a developer or user of one or more of these products, please respond
>via e-mail.
>
>Thank you,
>
>Jim Todhunter
>
>-- 
>James W. Todhunter, Director, Research & Development
>jim%uvmark@merk.com
>VMark Software, Inc.  30 Speen Street  Framingham, MA  01701-1800 USA
>Telphone: (508) 879-3311  Facsimile: (508) 879-3332

NLFC, Inc.
11615 Forest Central
Dallas, TX  75243

Laboratory Information System Vendor on UniVerse
( fix the RELEASE statement! )
---
abledsoe@sdf.lonestar.org
Newsgroups: comp.databases
From: davidj@cton.cton.com (David Johnson)
Subject: Wanted: PD source for report writer
Organization: Computone, Corp.
Date: Fri, 21 Aug 92 14:30:58 GMT


I am looking for PD source for a report writer (based on any database) which
preferably has an interactive user interface for specification.

Any help would be greatly appreciated.

dave
Newsgroups: comp.databases
From: edwards@world.std.com (Jonathan Edwards)
Subject: Re: Hot Standby DBMS's
Organization: The World Public Access UNIX, Brookline, MA
Date: Sat, 22 Aug 1992 12:34:50 GMT

In article <1992Aug21.073707.6235@anasaz> briand@anasaz (Brian Douglass) writes:
>The two systems are not in lock step.  The above transaction would arrive
>at machine 1 as a DEPOSIT transaction and would be processed by the
>DEPOSIT process.  The very same transaction would be routed to machine 2
>for the same processing.  There is no need the individual DEPOSIT processes
>to even know about each other.  The coordination that does have to take
>place is that machine 2 completes the transaction successfully.  If it
>doesn't, then this transaction remains open in a log on machine 1.  It does
>NOT affect the consistency of the data on machine 1.  Machine 1 is just
>storing up transactions that are uncompleted on machine 2.  At this point
>it should be programatic to insure that when machine 2 does ressurect, it
>does catchup with machine 1, and all transactions are processed singularly
>by machine 2.
>
I am talking about inconsistency between the two databases, not within them.
It is an elementary fact that complex multithreaded systems are not
deterministic. Just reproducing the input-transaction stream on another
system will NOT GIVE YOU THE SAME RESULTS. I used the example of two operators
requesting an update on the same record. One wins, but not necessarily the
same one on both systems. Unless you add special application code to resolve
this, there will be an inconsistency between the databases. But hey, we don't
even need this. What about timestamps placed inthe database? These will be
different on the two systems, leading to inconsistencies (the two databases
are NOT EQUAL).
Duplexing inputs is simply not a general approach to data replication.
Thank you for your comments. Goodbye.
From: albert@HPLWK.HPL.HP.COM (Joseph Albert)
Newsgroups: comp.databases
Subject: Re: Proposed Bug in Sybase 4.2
Date: 20 Aug 92 04:32:59 GMT

Followup-To: 
Distribution: 
Organization: Hewlett-Packard Laboratories -- Database Technology Dept
Keywords: 

In article <1992Aug19.180433.16976@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 both of the following queries:
>
> select t1.c1 from t1,t2 where t1.c1 < t2.c1  
>select * from t1 where c1 <any (select c1 from t2)
>
>The results are:
> c1
> -----------
>           1
>           1
>           1
>           1
>           1
>           1
>           1
>           1
>           1

This is NOT a bug, but the correct answer to the query according to the
specified semantics of SQL. (If you don't agree with the semantics of
SQL, that is a different issue.)

When you write a query, 

SELECT t1.c1 FROM t1,t2 WHERE t1.c1 < t2.c1  

you are asking for a result which could be defined by:

1. take the cross product of t1 and t2
2. select those tuples from this cross product in which t1.c1 < t2.c2
3. project the result of step 2 onto the column t1.c1

of course, the dbms does not have to compute according to this 3-step
procedure, i'm just using it to define the correct result.

the query you seem to be interested in is either:

a. select all t1 tuples for which there exists a t2 tuple with t1.c1 < t2.c1

-or-

b. select all t1 tuples for which t1.c1 is smaller than the c1 field of
   every t2 tuple.

such existential and universal quantification is most naturally expressed
in the domain calculus, but, alas, for better or worse we are stuck with
SQL as a standard. in SQL, one uses the EXISTS function, which is really
a test for emptiness of a correlated subquery (which can be used to construct
queries semantically equivalent to any query requiring a quantifier in
relational calculus):

a. SELECT c1 FROM t1 WHERE EXISTS (SELECT * FROM t2 WHERE t1.c1 < t2.c1);

b. SELECT c1 FROM t1 WHERE NOT EXISTS 
                (SELECT * FROM t2 WHERE ((t1.c1 > t2.c2) OR (t1.c1 = t2.c2)));


I'm surprised that the Sybase customer support people thought that
this was a bug.

Joseph Albert
albert@hplabs.hp.com
Newsgroups: comp.databases
From: schreiber@fzi.de (Hartmut Schreiber)
Subject: Re: OODB Experiences/Opinions (Objectivity)
Followup-To: comp.databases
Keywords: none
Reply-To: schreiber@fzi.de
Organization: Forschungszentrum Informatik (FZI), Karlsruhe, Germany
Date: Thu, 20 Aug 1992 08:54:36 GMT

Organization: Objectivity Inc.
Date: Thu, 20 Aug 92 07:33:10 GMT

In article <1992Aug20.073310.13832@objy.com>drew@objy.com (Drew Wade) writes:
> In article <1992Aug17.221704.17350@odi.com> dlw@odi.com writes:
> >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.
> >
> 
> I'll go yet farther...they didn't even read our manual!  We weren't
> in the report.  Oh, well...
> 
> -drew wade
> objectivity, inc.

Did you ever try to get Objectivity/DB manuals without actually purchasing
the software?

You won't get it!  Oh, well...

--

Hartmut (schreiber@fzi.de)
From: mr@ogre.cica.indiana.edu (Michael Regoli)
Newsgroups: comp.databases
Subject: dbIV 1.5: Combining Labels and Reports
Date: 13 Aug 92 17:08:17 GMT
Organization: Indiana University


][

I've got a quick question:  Has anyone been able to get the format of
labels combined with a report?

For instance, what I need is to print a roster of names, four across:


XXXXXXXXXXXXXXXXX  XXXXXXXXXXXXXXXXX  XXXXXXXXXXXXXXXXX  XXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXX  XXXXXXXXXXXXXXXXX  XXXXXXXXXXXXXXXXX  XXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXX  XXXXXXXXXXXXXXXXX  XXXXXXXXXXXXXXXXX  XXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXX  XXXXXXXXXXXXXXXXX  XXXXXXXXXXXXXXXXX  XXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXX  XXXXXXXXXXXXXXXXX  XXXXXXXXXXXXXXXXX  XXXXXXXXXXXXXXXXX

all down the page.  However, I'm printing on wide (14-7/8" x 11")
paper and I'd like to have page breaks and page headers like those 
available with report forms.

So, what I'm doing now (which is *very* slow and cumbersome) is
printing my four-up labels to disk, then using a paginator (very much
like the Unix "pr" command) to format the labels with page headings
and page numbering.

With a database of over 15,000 names, file sizes are in the several
megabyte range.  

What is a good solution to this??

--
michael regoli
mr@cica.indiana.edu
regoli@iubacs.BITNET
..{ames, rutgers}!iuvax!cica!mr
From: Bruce_H_Ring@cup.portal.com
Newsgroups: comp.databases
Subject: Re: SQL Windows???
Date: Sat, 22 Aug 92 16:30:14 PDT
Organization: The Portal System (TM)



In a posting, mas@mipl8.jpl.nasa.gov (Marc Sarrel) asks:

> Does anyone know the name and phone number
> of the company that makes SQL Windows???

	Gupta Technologies, Inc.
	800-876-3267 (in the USA)
	410-224-8315 (outside the USA)

Bruce Ring
Gupta Technologies, Inc.
bruce_h_ring@cup.portal.com
Newsgroups: comp.databases
From: jpalmucc@bbn.com (Jeff Palmucci)
Newsgroups: comp.databases
Subject: Help choosing Unix DB
Date: 13 Aug 92 20:32:18 GMT
Distribution: usa
NNTP-Posting-Host: bbn.com

Posted for a friend, please reply directly to him.

----------------------------------------

Hello,
  I need some advice on the relative virtues of Informix vs Oracle vs Progress.
I will be  developing a database application for a large law firm.  
The application will do report generation for the most part.  It will need to
have a client/server architecture with a Unix host (the hardware is not
set but will probably be Intel based).  My experience has been with PC/Mac
databases and I am not familiar with the offerings under Unix.  I would 
appreciate hearing from anybody who has an opinion on the relative strengths 
and weaknesses of these three databases and/or your own favorite.  Also any 
information on articles that compare these products would be greatly 
appreciated. 

Please send e-mail to kermisch@bbn.com.

Thank you,
  Ron Kermisch
Newsgroups: comp.databases,comp.databases.theory
From: edwards@world.std.com (Jonathan Edwards)
Subject: Hot Standby
Organization: The World Public Access UNIX, Brookline, MA
Date: Mon, 17 Aug 1992 16:20:36 GMT

In the transaction-processing world, there is the concept of a 'hot standby'
system, which is a geographically separated system containing a copy of the
database, and capable of coming online very quickly. The replicated data must
be close to current, and guaranteeing complete synchronization is required
by some applications. A further feature is the ability to 'catchup' 
incrementally to missed changes after an outage, without a complete database 
copy. Our database (homebrew non-relational) does this.
Are there any other databases that can do this?

I know that Tandem has some capability, but it is not synchronous (it can
fall behind, probably because performance would be unacceptable otherwise).
I don't think it can incrementally catch up.
Vendors often suggest doing 'remote mirroring' of the database disks, which
requires extremely high bandwidth (like FDDI) which is very expensive, and
doesn't do catchup.
I would think that all the efforts building distributed databases should have
yielded some kind of capabilities along these lines. Can anyone fill me in?

Jonathan Edwards		edwards@intranet.com
IntraNet, Inc.			617-527-7020
From: albert@HPLWK.HPL.HP.COM (Joseph Albert)
Newsgroups: comp.databases
Subject: Re: OODB Experiences/Opinions
Date: 20 Aug 92 16:23:22 GMT


Various people write:

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

[discussion of review of OODBs deleted]

Either the most recent, or 2nd most recent SIGMOD Record has an article
by V. Soloviev comparing three OODBMS's. I can't remember which three off
the top of my head.

Joseph Albert
albert@hplabs.hp.com
Newsgroups: comp.databases
From: junkerj@ccmail.orst.edu (Joe F. Junker)
Subject: Canned PARADOX scripts?
Organization: College of Engineering, Oregon State University
Date: Wed, 19 Aug 1992 23:55:37 GMT

Does anybody know a source for canned PARADOX scripts or insightful 
techniques?  We own a network copy of PARADOX in our office but we really 
are not using it to its potential.  No one here has had the time to really 
refine scripts for our needs.  I tend to wing my queries manually and port 
to and from a worksheet for alot of editing and combining.

I would love to find a source for scripts or advise to:

1) Compare two databases and look for possible duplicates (based on 
similarity) before combining them.  We frequently do group mailings for 
events we put on with other entities and have to combine our lists but 
would rather not spend alot of mailing and printing money on duplications.

2)  Monitor as a new record is being manually input and (continually) list 
possible existing records that might duplicate the new entry.

3) Scan an existing database for possible double entries (ie  Bob Smith 
and Robert Smith) 

4) Making queries that link more than one database.

In general I would be very greatful for any information on ftp sites, BBS, 
or discussion groups that are specific to PARADOX or might contain 
canned scripts.  

Thanks for whatever help you can provide.

-joe junker
 
 Joseph F. Junker
 Industrial Energy Engineer
 Oregon State University
 Energy Extension
 344 Batcheller Hall
 Corvallis, Oregon  97333-2405
 Phone: (503) 737-5034
 Fax:   (503) 737-3462
 Email: (Internet) junkerj@ccmail.orst.edu
Newsgroups: comp.databases
From: dhepner@cup.hp.com (Dan Hepner)
Subject: Re: Hot Standby DBMS's
Date: Fri, 21 Aug 1992 19:30:47 GMT
Organization: Hewlett-Packard
X-Newsreader: Tin 1.1scd1 PL4

From: edwards@world.std.com (Jonathan Edwards)

>>Since all locks need to be obtained on both systems before the 
>>transaction is eventually committed, lock race conditions (defective
>>design) result in deadlocks.  The system as a whole remains perfectly 
>>serialized.

>Lock races are inherent functionally: what happens when two operators want
>to update the same record.

While a race in one sense, this is a benign race unlike the disruptive
race described by:

>My point is that the winner will not necessarily be the same on a 
>system recieving a copy of the input stream.

If so, your transactions will deadlock, and will not complete. In the
system described, all locks must be obtained on all systems before the 
transaction can complete.  The locking behavior is that of two unrelated
databases.  This is not a claim that there is no problem here: the races 
must be prevented in order to do any work, a well known problem in
transactional application design.  But that inability to do work is 
the penalty of screwing up, rather than an out-of-sync copy of the 
database or some other manifestation of non-serialized behavior.

Dan Hepner
Newsgroups: comp.windows.ms.programmer,comp.databases
From: tjohn@ecst.csuchico.edu (Todd A Johnston)
Subject: Need Feedback on QELIB (Database libraries) DLL's
Followup-To: tjohn@cscihp.ecst.csuchico.edu
Summary: Info on experiance's with Pioneers QELIB 
Keywords: DLL, QELIB, database, SQL
Organization: California State University, Chico
Date: Thu, 13 Aug 1992 16:31:05 GMT

	I would like to get some feedback on Pioneer's QELIB database
library for windows.  I am a Window's developer writing some front-ends
for Novell's Netware SQL.  Any experiance or suggestions would be appreciated.

					Thanx
                                             Todd A Johnston
                                             tjohn@cscihp.ecst.csuchico.edu
From: rson@rhi.hi.is (Reynir Hugason)
Newsgroups: comp.databases
Subject: P*INK Sql (Macintosh)
Date: 16 Aug 92 15:31:17 GMT

Can anybody elaborate on this product? I did get the brochure from MacVONK,
but they seem to be discontinuing this product.. why? and is there somebody
else taking over?

What other SQL alternatives exist for the Macintosh apart from
Oracle and Pink?

Inquring minds want to know ..
Xref: sparky comp.databases:6205 comp.databases.theory:374
From: matt@bacchus.esa.OZ.AU (Matthew Atterbury)
Newsgroups: comp.databases,comp.databases.theory
Subject: Re: Hot Standby
Date: 19 Aug 92 23:09:26 GMT
Organization: Expert Solutions Australia.

In article <Bt4yqE.H0q@world.std.com> edwards@world.std.com (Jonathan Edwards) writes:
> 
> In the transaction-processing world, there is the concept of a 'hot standby'
> system, which is a geographically separated system containing a copy of the
> database, and capable of coming online very quickly. The replicated data must
> be close to current, and guaranteeing complete synchronization is required
> by some applications. A further feature is the ability to 'catchup' 
> incrementally to missed changes after an outage, without a complete database 
> copy. Our database (homebrew non-relational) does this.
> Are there any other databases that can do this?
> [...]

    We (Expert Solutions Australia) have developed a non-relational
    database that does all these things: replicated/redundant,
    synchronous, disk caching (for catastrophic) recovery, "active"
    (it can distribute updates to interested parties), etc, and it's
    fast. We are in the process of putting an SQL front-end onto it to
    make it more user-friendly. If anyone is interested, I have a
    paper on it I can mail to you (nroff -mm or PS format). It is not PD.

    cheers ...
-- 
-------------------------------------------------------------------------------
Matt Atterbury [matt@bacchus.esa.oz.au]   Expert Solutions Australia, Melbourne
UUCP: ...!uunet!munnari!matt@bacchus.esa.oz.au            "klaatu barada nikto"
ARPA: ...!uunet!murtoa!bacchus.esa.oz.au!matt         "consider this a divorce"
Newsgroups: comp.databases,comp.databases.theory,comp.databases.oracle
From: sjha@prism.poly.edu (Salil Kumar Jha)
Subject: Is this a bug or a limitation of the SQL language
Organization: Polytechnic University, New York
Date: Sun, 23 Aug 92 07:40:48 GMT

I tried to do this query in Oracle and DB2 and both failed. I know its
not allowed but why not?

Assume the use of the classic oracle emp table

select * from emp 
where salary between
(select salary from emp where ename = 'Larry')
and
(select salary from emp where ename = 'John')

Isnt this the best way of finding all people whose salaries lie between those
of Larry and John (without knowing whose is larger)

sjha@prism.poly.edu

Newsgroups: comp.databases
From: mas@mipl8.jpl.nasa.gov (Marc Sarrel)
Subject: SQL Windows???
Organization: Jet Propulsion Laboratory
Distribution: comp
Date: Fri, 21 Aug 1992 23:22:15 GMT


Does anyone know the name and phone number of the company that makes
SQL Windows???

advTHANKSance

Marc
--
Marc Sarrel			"Strange as it seems,
Jet Propulsion Laboratory	 There's been a run of crazy dreams,
mas@mipl8.jpl.nasa.gov		 And a man who can interpret could go far --
				 Could become a star."
From: cjh@holmes.acc.Virginia.EDU (Carol J. Hughes)
Newsgroups: comp.databases
Subject: database application generators
Date: 20 Aug 92 15:18:22 GMT
Organization: University of Virginia
Originator: cjh@holmes.acc.Virginia.EDU

I would like feedback on code generators for database applications.
What do you use and what are the pros and cons?  Have you switched
from one product to another, and if so, why? 

Thanks in advance.

Joan Hughes
From: johnb@fexco.ie (John Bowler)
Newsgroups: comp.databases
Subject: Another test
Distribution: world
Date: Sat, 15 Aug 92 21:07:22 GMT
Organization: Foreign Exchange Company Ltd.

This is a second test post to the databases newsgroup.
Newsgroups: comp.databases
From: Peter.Sherman%bbs@wisper.com (Peter Sherman)
Date: Wed, 19 Aug 92 19:26:32 EDT
Organization: Wisper Technologies
Subject: FoxPro 2.0 Dist. Kit ONLY $199!!!
Distribution: world
X-Posting-Software: UnixBBS 1.02a S/N 095921

 
      I've had this for only a few months.  In excellent condition, and
all documentation included.  I don't need it.  It allows FoxPro users
to create stand alone executables of their programs for
UNLIMITED ROYALTY FREE DISTRIBUTION!!!
 
     Lowest price I've seen it for $279.  Lists at over $300.  It
can be yours for only $199!!! And Fox will usually give you the latest
version for free (if you're a registered user and ask nicely).  I
can transfer the registration, no problem!
 
     Well, if anyone's interested, please send e-mail!
 
             -Pete
--
Peter Sherman, user of the UnixBBS System @ wisper.com
E-Mail: Peter.Sherman%bbs@wisper.com
  \      //   //                          
   \    //   T E C H N O L O G I E S    General Purpose Computer Wizards (sm)
    \  //\  // ` ((   // ) ((/  //''    Wethersfield, Connecticut
     \//  \// //  )) //    ((/ //       USA  (203) 257-7670, 9600-8-N-1