HDTenEightyP/NetNews huggingface dataset:
From: johannes@imec.be (Peter Johannes)
Newsgroups: comp.databases,comp.periphs.printers
Subject: Help Paradox3.5/Imagewriter
Date: 11 Jan 93 13:43:01 GMT
Organization: IMEC V.Z.W,Interuniversitair Micro Electronica Centrum, Belgium
Originator: johannes@imec

Hi,

I am (still) trying to get High Ascii from a PC to an Imagewriter, 
when I run Paradox on the PC. 

Questions:

- is there something like an IBM-MODE on the imagewriter? Rumor has it that
  most printers have this and that it allows to print the complete Extended
  ascii set

- if not, how can I download it? The printer manual says downloading is 
  possible, that 'ascii high' can be selected, but I have no clue of
  how

- a minor problem: the printer is connected to the serial port (COM1) and
  sometimes I cannot get it to work when accessing it from paradox.
  (printer not ready)
  Although it works perfectly in DOS.

I would appreciate any help, 

Peter


-- 
+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Those who can do
Those who can't teach
(johannes@imec.be)
Newsgroups: comp.databases
From: EXTMO4H@mizzou1.missouri.edu (Missouri 4-H Youth Development Programs)
Subject: Re: Revelation: PUSH.SESSION/POP.SESSION
Organization: University of Missouri
Date: Wed, 06 Jan 93 13:49:24 CST

In article <cpetersn.726301104@vincent2.iastate.edu>
cpetersn@iastate.edu (Clifton R Peterson) writes:
 
>In <1993Jan6.040107.17339@massey.ac.nz> D.M.Todd@massey.ac.nz (D.M. Todd) writes:
>
>>Can someone tell me how to use PUSH.SESSION/POP.SESSION to save and
>>restore system variables in Advanced Revelation?
>
>>TIA
>
>>David
>
>Right out out of my System Subroutines book
>
I have AREV 3.0x.  Where can I find/get the System Subroutines book?
 
Curtis Bohl, Computer Programmer/Analyst
Missouri 4-H Youth Development Programs
EXT1120A@mizzou1.missouri.edu
Newsgroups: comp.databases
From: jhenders@sei.cmu.edu (Jordan Henderson)
Subject: ASK INGRES WINDOWS 4GL - 2.x, USING IT on SUN
Keywords: ASK INGRES WINDOWS 4GL SUN
Organization: The Software Engineering Institute
Date: Thu, 7 Jan 1993 11:55:13 EST


I am interested in hearing from anyone using the Ask Ingres Windows 2.x
product. Specifically:

	1) What release of Windows 4GL, 2.x ?

	2) What release of Ingres, 6.3 or 6.4 ?

	3) What platform are you using?
	   Database server machine, Sun 4/690 etc?
	   What OS version on server ?
	   Client machine ?
	   What OS version on client ?
	   X Windows X11R4, X11R5 ?
	   Motif, other ?

	4) What was involved when moving pre-existing code from 1.x to 2.x?
	   Were any changes at the source level required?
	   Did code that was working regress?

	5) Have you released any applications to your users?

	6) Have you had any problems with bugs during development?

Please reply directly to me.
If there is sufficent interest, I will post a summary.

Thank you
Jordan Henderson
#include	<std-disclaimer.h>
From: johnboyd@ocdis01.UUCP (John Boyd)
Newsgroups: comp.databases
Subject: Re: two foxpro questions
Date: 30 Dec 92 21:22:18 GMT
Organization: Tinker Air Force Base, Oklahoma

In article <9212301852.AA11765@chimi.engr.ucdavis.edu> mahadeva@chimi.engr.ucdavis.edu (Vimalan Mahadevan) writes:
>I am writing a data entry program program uising FoxPro and plan on writing
[deleted]
>2)  Supposing you  have a field which contains the middle initial of a person.
>I don't want the user to have to enter the period after the initial.  How
>can the program be instructed to automatically enter a period after the user
>enters the letter?
If you want a separate (sp) field just for the initial (debatable) then
just make the field one character long (not cross-culturally adequate), and
add the period on printed/listed output, and don't carry it in the data.
----------------------------------------------------------------------------
'Oklahoma, where the legislature runs without a brain' - with apologies to
  Rodgers and Hammerstein
Disclaimer: If you ask the Air Force, they'll tell you I don't know what
             I'm talking about anyway.
Xref: sparky comp.databases:8874 comp.databases.sybase:618
From: jgb@prism.gatech.EDU (James G. Baker)
Newsgroups: comp.databases,comp.databases.sybase
Subject: Sybase for SysVR4 (Dell)
Date: 7 Jan 93 13:40:20 GMT
Followup-To: comp.databases
Organization: Georgia Institute of Technology

Is Sybase available for System V R 4?  I am using Dell specifically
but was told that is is just supported on R3.  Is this for real?
I called Sybase but wasn't sure that I got a confident answer - or 
maybe just didn't want to believe it.

Thanks.

-- 
James G. Baker                   | Phone: (404) 853-9984 
School of Electrical Engineering | GIT: jgb@prism, jgb@ee, jgb@cc, jgb@eecom
Georgia Institute of Technology  | uucp: ...!{hplabs,purdue}!gatech!prism!jgb 
Atlanta, Georgia 30332-0250      | Internet: jgb@prism.gatech.edu
Newsgroups: comp.databases
From: jacobs@erc.cat.syr.edu (David Quinn-Jacobs)
Subject: SQL on UNIX, DOS, VMS, and the Mac?
Date: Fri, 8 Jan 93 14:24:30 EST

Is anyone aware of an SQL-based system which functions on UNIX, DOS, VMS,
and the Macintosh, besides Oracle?  (Oracle run-time licensing costs are too 
expensive for my customer's budget.)

I would like an RDMS which performs on all those platforms with few source
changes.  Having an architecture-independent GUI front end (such as 
OracleCard) is a real plus, but not a requirement.  VMS is not vital either
(in more than one sense).

Please respond to my email address since I cannot often access news.
Thanks in advance!  If there is a great deal of interest, I'll post a
summary.  If this is a FAQ, please do not waste more news space with flames.

------------------------------------------------------------------------------
Kathleen Quinn-Jacobs                    Telephone/FAX: (315) 855-7543
ReQuest Technologies, Inc.                      E-mail: jacobs@erc.cat.syr.edu
RD#2, Box 395             
West Winfield, New York 13491                       
------------------------------------------------------------------------------



 
-- 
------------------------------------------------------------------------------
   			       David Quinn-Jacobs

		  *          Plainfield Associates
Newsgroups: comp.databases
From: Lisa Bahler <bahler@thumper.bellcore.com>
Subject: request for info on OODBs
Organization: Bellcore
Date: Wed, 6 Jan 93 17:14:48 GMT

I recently saw a request for information on object-oriented databases
posted to this group, but there was no follow-up.  I'd like to prompt
some discussion in this area.

I have recently started looking at various OODBs.  Primarily, I am
interested in ObjectStore, Objectivity, and Versant.  Would people
share their good or bad experiences with these products and others?
Especially useful would be comments from people who are familiar
with more than one OODB.

Newsgroups: comp.databases
From: jamesc@netcom.com (James Chuang)
Subject: Re: dBase programming question
Organization: Netcom - Online Communication Services (408 241-9760 guest)
Date: Mon, 11 Jan 1993 21:32:36 GMT


> The question was how to define a dbase character variable

dBase III+ did not require definition of variable before usage.  To assign the
string "FOOBAR" to variable MyVar, just do this:

MyVar = "FOOBAR"

To assign a numeric to MyVar, just do this:

MyVar = 12345.67

To allow the user to input into MyVar, first set myvar to a value of any type, 
then do this:

@ 10,10 GET MyVar
READ

All these commands can be executed from the dot prompt.
jamesc
-- 
=========================================
If someone asks if you are a God, you say... YES!
Newsgroups: comp.databases
From: schieb@shark.gsfc.nasa.gov (Brian D. Schieber)
Subject: Looking for UNIX shareware DBMS...
Reply-To: schieb@shark.gsfc.nasa.gov (Brian D. Schieber)
Organization: Oceans & Ice Branch, NASA/GSFC/GSC
Distribution: na
Date: Fri, 8 Jan 1993 13:21:36 GMT

Newsgroups: comp.databases.theory
From: myoung@force.ssd.lmsc.lockheed.com
Subject: New Model
Reply-To: myoung@force.ssd.lmsc.lockheed.com
Organization: LMSC, Sunnyvale, California
Date: Thu, 7 Jan 93 18:31:27 GMT

I read the latest trade magazines on the subject of new distributed
processing technology and ATM.  They are close, but haven't quite gotten
it as far as it should be.

The current client server applications work just fine with the current
networking systems.  The issue here is replacing the client server model
with the semantic data model, and whether the replacement can be
accomplished without some virtual path network technology.

Example:

  Consider putting the entire corporate literature database under the
semantic model with schema such as:

   Reports have text, abstracts, key words, authors, they reference other
reports, and are attached to product development teams.

   Authors have resumes, and have worked on other product development teams,
and have written other reports.

  Given this schema, it can be construed as a network connection of data,
and queries are construed as traversals and extractions from the data.
For example: Which reports reference other reports which use a specified
key word.

  Data can be entered into the corporate semantic model regardless of its 
location, classes can be indexed across the corporate semantic model, and
class instances can be discovered by some exploration of the corporate
network.

  When the semantic model has certain properties, like: Single valued
traversals, existence of property values, and type consistency
along traversal; then a set of equivalence and inference axioms result,
and these axioms allow the definition of a traversal protocol of which
Wave is the most obvious example.

  The axioms define associative, transitive properties of paths, and
their related traversal programs.  Included is a kind of distributive
property which allows multi-variate recursive queries. The distributive
axiom requires two operations, the path splitting, and node hopping
functions.

  This is a different model then the client server model, and it requires all
the flexibility of a programmable messaging layer, it needs the self routing
capability of an application specific network layer.

  The semantic theory, as far as is published, seems to be rapidly closing
on an access strategy language which has a syntax almost totally defined
by theory, hence differences in implementations will be minimal.

  In order to short circuit the understanding process, I will try to
cross post some ideas in both the comp.database.theory and comp.dcom.cell-relay.
We want the data base theoreticians to include virtual path networks into
their model.  Hopefully they will begin to see that a traditional router
or bridge, is simply an index on some class; that a shortest path is simply
a semantic reduction.  Then they can begin to think about the network 
management issue in terms of semantic theory; and conversely, think about
the virtual path networks as a connectionist machine.
Newsgroups: comp.databases.theory
From: hlam@bnr.ca (Hayward Lam)
Subject: NeXT User Group Of Ottawa Meeting on January 7th
Reply-To: hlam@bnr.ca (Hayward Lam)
Organization: Bell-Northern Research Ltd.
Date: Tue, 5 Jan 1993 20:19:27 GMT


NeXT User Group of Ottawa Meeting on January 7th
------------------------------------------------


When : Thursday, 7:00pm
Where: ComputerActive
       21 Antares Dr., Unit 112,
       Ottawa, Ontario, Canada


Topics: 
***  Database on NeXT  ***
Demo and discussion on databases and development tools 
available on NeXT.
Inlcude Parabase, Sybase, Oracle, DBkit, Objective DBtool kit etc.
Topic will be oriented for users and developers alike.
Demo machine is a NeXTcube with NeXTdimension board.

(A guest will talk about their experience with database 
development. Not confirmed yet.)


***  General discussion  ***
CD-ROM drive available for 3.0 upgrade.
Software packages discount for user group members.
NeXTWorld Expo etc.


Please pass the news around to whoever might be interested.
Feel free to contact me if you have any questions.


Regards,
Hayward

phone: 613-763-3663
email: hlam@bnr.ca



Newsgroups: comp.databases.theory
From: fred@genesis.demon.co.uk (Lawrence Kirby)
Subject: Re: Data abstraction v/s information hiding 
Distribution: world
Organization: BT
X-Mailer: Simple NEWS 1.90 (ka9q DIS 1.19)
Date: Wed, 13 Jan 1993 00:15:34 +0000

In article <DAVIDM.93Jan6115747@consilium.com> davidm@consilium.com writes:

>>>>>> On 22 Dec 92 18:22:20 GMT, yab@cs.brown.edu (Yashesh Bhatia) said:
>
>> Data Abstraction & information hiding
>
>> Data abstraction, I feel is the hiding of the low level implentation of the 
>> data structure from the operations that are performed on it. 
>
>> I am not really sure as to what information hiding is, seems to be similar. 
>
>Your definition for data abstraction is actually much better as a definition
>for information hiding.  Data abstraction is more of a process of finding
>similarities in the definition of two separate data items and reorganizing the
>items so that both could take advantage of the same definition for those
>similarities (ie. instead of two similar definitions, there would be only one
>defintion).  People might claim that you can do data abstraction when you only
>have one item, but this is only preparing the one item for another TBD item
>that will take advantage of the abstraction.

I think the original definition is much closer. Abstraction is simply stripping
an entity down to its behaviour and ignoring the details of implementation.
Abstraction applies to one entity - it has nothing to do with combining more
than one entity. It is close to it's English dictionary definition (an
example of) which is

"process of stripping an idea of its concrete accompaniments"

-----------------------------------------
Lawrence Kirby | fred@genesis.demon.co.uk
Wilts, England | 70734.126@compuserve.com
-----------------------------------------
Newsgroups: comp.databases.theory
From: thomasl@mtl.mit.edu (Thomas J Lohman)
Subject: Re: Materialised views
Organization: MIT Microsystems Technology Laboratories
Date: Thu, 7 Jan 1993 18:52:43 GMT

In article <C0HtzK.BEL@gabriel.keele.ac.uk> csa09@keele.ac.uk (Paul Singleton) writes:

A note on "materialised views".  I think things would get very messy
when the underlying db table structure changed for any reason or when data
is added to the underlying tables.  The db manager would have to 
make checks to see if any of the newly added data affects the stored
view data.

>Also, do any commercial database products provide special storage or
>indexing schemes for unchanging data?  I.e. which do not compromise
>towards the need to incrementally change the data, as B-trees etc. do.

Yes, some commercial database products, such as Ingres, give you the
ability to remodify your tables to a static version of B-tree.  They also
give you the ability to reorganize it based on hashed key, which they say
gives you the quickest access for exact key matches.  If the table is
unchanging (static) then these would be your best storage structures.


--tom
From: davidm@consilium.com (David S. Masterson)
Newsgroups: comp.databases.theory
Subject: Re: Data abstraction v/s information hiding
Date: 6 Jan 93 19:57:47 GMT
Distribution: comp
Organization: Consilium Inc., Mountain View, California
In-reply-to: yab@cs.brown.edu's message of 22 Dec 92 18:22:20 GMT
X-Posting-Software: GNUS 3.13  [ NNTP-based News Reader for GNU Emacs ]

>>>>> On 22 Dec 92 18:22:20 GMT, yab@cs.brown.edu (Yashesh Bhatia) said:

> Data Abstraction & information hiding

> Data abstraction, I feel is the hiding of the low level implentation of the 
> data structure from the operations that are performed on it. 

> I am not really sure as to what information hiding is, seems to be similar. 

Your definition for data abstraction is actually much better as a definition
for information hiding.  Data abstraction is more of a process of finding
similarities in the definition of two separate data items and reorganizing the
items so that both could take advantage of the same definition for those
similarities (ie. instead of two similar definitions, there would be only one
defintion).  People might claim that you can do data abstraction when you only
have one item, but this is only preparing the one item for another TBD item
that will take advantage of the abstraction.
--
====================================================================
David Masterson					Consilium, Inc.
(415) 691-6311					640 Clyde Ct.
davidm@consilium.com				Mtn. View, CA  94043
====================================================================
"The real test of an artist, of course, is not whether you can see each blade
 of grass, but whether the eyes follow you across the room."
-- Stewart Evans
From: ram@plains.NoDak.edu (Prabhu Ram)
Newsgroups: comp.databases.theory
Subject: how to implement referential integrity ?
Date: 11 Jan 93 21:33:40 GMT
Article-I.D.: ns1.C0pL85.GHI
Distribution: na
Organization: North Dakota Higher Education Computing Network


	Hi,
	I am looking for information as to how referential integrity
	with respect to primary key tables and foreign key tables
	are implemented and am hoping someone in comp.databases.theory
	can help me.  Any additional information will be also be
	appreciated,
	thanks,
	-Prabhu
Newsgroups: comp.databases.theory
From: minard@qucis.queensu.ca (Brian Minard)
Subject: View Substitution
Keywords: Views, Substitution, Querying
Organization: Computing & Information Science, Queen's University at Kingston
Date: Mon, 11 Jan 1993 01:24:15 GMT

I am looking for papers which address the problem of the removal (or
reduction) of the number of temporary tables created during the
computation of an answer of a query against a view.

Of particular interest is the determination of what class of
query requires a temporary table, and whether any algorithms
exist which will avoid temporary tables for a wider class of
queries/views.

Any help would be greatly appreciated.  

Brian
From: csa09@keele.ac.uk (Paul Singleton)
Newsgroups: comp.databases.theory
Subject: Materialised views
Date: 7 Jan 93 17:02:07 GMT
Organization: Keele University, England

Do any commercial database products support "materialised views"
i.e. views which are stored partly or fully evaluated, rather than
being evaluated and discarded on demand?  This is a form of "memoising",
a fairly well-known concept in declarative programming languages.
It gets tricky when the underlying tables change, and the derived
view relations may have to be revised.

Also, do any commercial database products provide special storage or
indexing schemes for unchanging data?  I.e. which do not compromise
towards the need to incrementally change the data, as B-trees etc. do.
----
  __   __    Paul Singleton (Mr)           JANET: paul@uk.ac.keele.cs
 |__) (__    Computer Science Dept.        other: paul@cs.keele.ac.uk
 |  .  __).  Keele University, Newcastle,    tel: +44 (0)782 621111 x7355
             Staffs ST5 5BG, ENGLAND         fax: +44 (0)782 713082
From: ashafie@acsu.buffalo.edu (Afshin Shafie)
Newsgroups: comp.databases.theory
Subject: Help on Data Structures
Date: 5 Jan 93 20:44:13 GMT
Organization: UB


Hello,

I hope this is the right place to ask this question, if not please let
me know.

I have to develop a program (database) in C that will run on SunOS 4.1.2.
There will be about 4 fields for each entry and each field could be a 
search field. There is about 10 MB of data, so speed is very important.
So far, the few books that I was able to get my hands on don't say much
about data structures. If anybody could point me to a book or give me
some pointers/hints/suggestions on what data structure to use for this 
program, I would really apreciate it. 

Thanks in advance.


Afshin
(ashafie@acsu.buffalo.edu)
Newsgroups: comp.databases.theory
From: 890584r@dragon.acadiau.ca (Barrie Rody)
Subject: Help With String Comparisons
Organization: Acadia University
Date: Mon, 11 Jan 1993 22:50:46 GMT


    I am writing a database and I need some help in comparing strings.
What I need is an algorithm to compare 2 strings {PChar, array[]of Char}.
I need this algorithm to be able to identify similar strings.
ie. a misspelled word would be found in a list.
    I am writing this in Turbo Pascal for Windows.  Any pseudocode,
Pascal, C, C++ or text answers would be greatly appreciated.

Thanks in advance for any help,
Barrie.

-----+-----+-----+-----+-----+-----+-----+-----+-----+-----+-----+-----+-----+--
	Barrie Rody	        890584r@dragon.acadiau.ca
	4th. Year Computer Science
	Acadia University, Wolfville, Nova Scotia, Canada.
--------------------------------------------------------------------------------
Rugby /'rug-bi / n.  30 players on a field:  scrummin down, pushin and plowin,
	squashin, stompin, straight arming, binding and bending, ruckin and
	rollin, rakin and runnin, grunting, snortin and scissor'n, mauling,
	tackling, bruisin and bleedin, prop'n and hook'n, kicking, jumping,
	fakin and fumbling, callin the ball, passin backwards, makin the try,
	and coolin off with an ice cold beer.
--------------------------------------------------------------------------------
From: bigk@cs.uq.oz.au (Kathy Williamson)
Newsgroups: comp.databases.theory
Subject: Rules in Database Systems
Date: 7 Jan 93 05:39:36 GMT
Reply-To: bigk@cs.uq.oz.au


CALL FOR PAPERS

1st International Workshop on
Rules in Database Systems

Edinburgh, Scotland, 30 August - 1 September 1993



AIM OF THE WORKSHOP
Rules have been a major focus of research interest in database systems for 
more than a decade, the initial focus on deductive rules and integrity 
constraints being augmented by recent research into active rules.  The aim of 
this workshop is to bring together researchers working on both theoretical and 
practical aspects of rules in database systems, to examine the current state 
of the art, to explore relationships between different categories of rule 
system, and to identify complementary areas for further development.

SCOPE OF THE WORKSHOP
Papers are sought on topics including, but not restricted to:
~      Active rules - theoretical foundations, rule analysis, execution 
       models, optimisation, realtime behaviour, production rules, tools, 
       interfaces, application.
~      Deductive rules/integrity constraints - theoretical issues, 
       implementation experience, optimisation, incomplete information, 
       applications.
~      Integration of active + deductive rules.

Submissions can either be full papers (around 5000 words) or short papers 
(around 2000 words).  Authors should send 4 copies of papers to:  Dr Norman 
Paton, Department of Computing and Electrical Engineering, Heriot-Watt 
University, Riccarton, Edinburgh EH14 4AS (email norm@cee.how.ac.uk;  
tel +44 31 451 3428).  Springer-Verlag have provisionally agreed to publish 
the proceedings in their "Workshops in Computing" series.

PROGRAMME COMMITTEE
J.B. Bocca (Birmingham, UK)
A. Buchmann (Darmstadt, Germany)
O. Diaz (Pais Vasco, Spain)
K.J. Jeffery (RAL, UK)
T. Sellis (Nat Tech Uni Athens, Greece)
M. Bouzeghoub (M. Curie, France)
G. von Bueltzingsloewen (Karlsruhe, Germany)
K.R. Dittrich (Zuerich, Switzerland)
R. Manthey (Bonn, Germany)
M.H. Williams (Heriot-Watt, UK)
B. Bry (ECRC, Germany)
S. Chakravarthy (Florida, USA)
P.M.D. Gray (Aberdeen, UK)
N.W. Paton (Heriot-Watt, UK)
K.F. Wong (ECRC, Germany)

IMPORTANT DATES
Submission Deadline:               31 March 1993
Notification of Acceptance:        15 June 1993
Workshop Versions Due:             31 July 1993
Camera Ready Copy:                 31 October 1993