HDTenEightyP/NetNews huggingface dataset:
From: sm_rosen@ceres.rm.fccc.edu (Steve Rosen)
Newsgroups: comp.databases
Subject: How to create C-ISAM files?
Date: 28 Jan 93 14:52:05 GMT
Reply-To: sm_rosen@ceres.fccc.edu
Organization: Fox Chase Cancer Center - Phila, PA
Originator: sm_rosen@ceres.rm.fccc.edu


A few 4GL tools I am looking at support access to a 'virtual relational
database' via Unix C-ISAM files.  I have data in a flat file, fixed-length,
character record structure which was unloaded from a non-relational database
and can be reloaded into a relational database, but I don't necessarily
want to do this.  I want to access it as an indexed file because I won't be
going to it that often (i.e., it's an archive).

Can somebody tell me how to convert this to an indexed file (C-ISAM)?  Is
there some public domain tool/utility or some Unix feature that will do
this for me?  Thanks!
-- 
         ___________________________________________________________
        /                                                           \
       / Steve Rosen                     Fox Chase Cancer Center    /
      /                                  7701 Burholme Ave.        /
     /   Internet: sm_rosen@fccc.edu     Philadelphia, PA 19111   /
    /    Phone:    (215) 728-3665                                /
    \___________________________________________________________/
Newsgroups: comp.databases
From: goudswaa@fraser.sfu.ca (Peter Goudswaard)
Subject: Looking for Chris O'Neill
Organization: Simon Fraser University, Burnaby, B.C., Canada
Date: Thu, 21 Jan 1993 21:15:14 GMT

Chris, I tried to send you an email reply, but the address bounced.
Can you post here one that might work?

Peter Goudswaard
goudswaa@sfu.ca
Newsgroups: comp.databases
From: wolf@sarah.lerc.nasa.gov (Rick Wolf)
Subject: Re: Clarion users
Organization: NASA Lewis Research Center, Cleveland, OH
Date: Thu, 28 Jan 1993 18:31:46 GMT

Clarion is shipping a pre-release copy of version 3 now which includes
complete documentation.  So far it looks pretty stable although I
haven't had much time to spend with it yet.


-- 

*******************************************************************************
Rick Wolf 
Sverdrup Technology, Inc.
Newsgroups: comp.databases
From: pkim@gagme.chi.il.us (Peter Kim)
Subject: Re: Clarion
Organization: GAGME - Public Access UNIX of Chicago, Illinois, USA, Earth
X-Newsreader: TIN [version 1.1 PL7]
Date: Thu, 21 Jan 1993 05:39:58 GMT

Stuart Tener (tener@cs.widener.edu) wrote:
: Is anyone on this net into clarion? I just got the clarion 3.0
: pre-release! I am looking for fellow clarion programmers to discuss and
: clarion tips and tricks with.
: 
: What does anyone think of 3.0beta?
: 

I am not a heavy user but I was impressed with the beta version. It is
about time after such a long delay. 

Do you know if there is a way to get Clarion articles on CompuServe
without having to be a CompuServe member? 
Newsgroups: comp.databases
From: weiss@cs.wm.edu (David W. Weiss)
Subject: dBASE IV problem
Organization: The College of William and Mary
Distribution: na
Date: Thu, 21 Jan 1993 21:28:59 GMT



Following are a couple of procedures from a dBASE program
I wrote. It is part of a screen where a user enters some
information into memory variables. It issupposed to allow
the user to hit F1 and get a pop-up window of possible values
and then select one value from that window. It works great if 
they just type a value directly into the field or type nothing
in the field and just select a value using the pop-up window.
However, if they start to type something in the field and then
instead use the pop-up window and select a value the variable
will contain the typed value instead of what was selected from
the window. I think it has something to do with how the READ
command works but I haven't been able to get around it. 
Any suggestions or am I out of luck.



PROCEDURE Getrest
ON KEY LABEL F1 DO FieldHelp
@ 12,25 GET mLocality PICTURE "!!" ;
  MESSAGE "Press <F1> to see Localitys lookup list" COLOR B/W
READ
ON KEY
RETURN

PROCEDURE Fieldhelp
USE Localitys
DEFINE POPUP Locs FROM 11,28 TO 17,60 MESSAGE;
  "Use up and down arrow keys to highlight menu choice and press <Enter>"
n = 1
SCAN
    DEFINE BAR n OF Locs PROMPT Locality + " " + Loctext
    n = n + 1
ENDSCAN
ON SELECTION POPUP Locs DO Locselect
ACTIVATE POPUP Locs
@ 12,25 SAY mLocality COLOR GR+/W
CLOSE DATABASES
RETURN

PROCEDURE Locselect
GOTO BAR()
mLocality = Locality
DEACTIVATE POPUP
RETURN


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

Thanks a lot,

Dave
weiss@cs.wm.edu


Newsgroups: comp.databases
From: paola@ghost.dsi.unimi.it (Paola Formai)
Subject: pic or pick or pik (???)
Keywords: RDBMS, pic (?)
Organization: Computer Science Dep. - Milan University
Date: Mon, 25 Jan 1993 17:08:44 GMT
Summary: what is pi[ck] ?

I was told about a Unix Rdbms named Pick (or Pic or Pik). I never heard of it.
Anyone could explain me what is that stuff?

Thanks

paola@imiucca.csi.unimi.it

Paola Formai
CSI- Univ. of Milano, Italy
Newsgroups: comp.databases
From: mike@uunet!tellab5!odgate (Mike J. Kelly)
Subject: Re: Help with SQL statement
Organization: Odesta Corporation
Distribution: na
Date: Wed, 27 Jan 1993 16:28:31 GMT

rpeterse@watserv1.uwaterloo.ca (Raymond Petersen) writes:

>In article <1993Jan22.211051.4867@vpnet.chi.il.us> mike@vpnet.chi.il.us writes:
>>I have 2 tables lets say I have a Customer table and an order table.
>>I want to query the database for all customers and show their orders
>>for the past month.  I may have more than 1 order for a customer.

>>The problem is that if I don't have an order for a customer, the join will
>>not find a match and that customer will be left out of the report.

>>I still want to show the customer even if no orders are present.

>>Is this possible with SQL ??  was my explanation c

If you database doesn't support outer joins (which synthesizes a row full
of nulls as the join row from the orders table in this case if there is no
matching customer_id in orders), you can probably work around it using
UNION as follows:

select <the columns from customers you want>, <the columns from orders you want>
from customers c, orders o
where  c.customer_id = o.customer_id
UNION
select <the columns from customers you want>,NULL,NULL,NULL
from customers
where not exists ( select orders.customer_id from orders
		   where orders.customer_id = customers.customer_id )


Put one NULL in the second select statement for each column in the first
select that comes from the orders table.  This is one reason that some DB's
don't support outer joins: you can usually roll your own.


-- 
--
Mike Kelly               Odesta Corporation, Northbrook, Illinois, USA
...!clout!odgate!mike    - Until odesta.com is registered.
odgate!mike@clout.uucp   - From the Internet.
Newsgroups: comp.databases
From: bangell@cs.utah.edu (bob angell)
Subject: Re: Paradox question
Date: 27 Jan 93 09:05:37 MST
Organization: University of Utah Computer Science

In article <1993Jan27.110322.1326@actrix.gen.nz> Mary.Curtin@bbs.actrix.gen.nz writes:
>
>In an article, J. D. McDonald (mcdonald@aries.scs.uiuc.edu) wrote:
>> 
>> 1) I can't get the "modify" or "data-entry" things on a table to
>> come up automatically with the proper form for that table ... I
>> have to change it manually every time with Image. How does one do this?
>> Some sort of simple macro? 
>
>If you are setting up some sort of application for others to use, then
>you would use a script.  But if you just want to set up a working
>environment which suits you, try F10 Image Keepsettings (when you have
>used F10 Image Pickform to select the right form.
>
>> 2) I can Ask to my heart's content and it works fine, but getting a 
>> report on the result is a pain .. I have to COPY a report type to
>> the Answer table by hand every time I create a new Answer .. is there some 
>> way to make this stick .. I tried copying Answer over an old table to
>> which I had already attached a report, but that seems to lose the report 
>> already attached.
>
>That's fundamental to the way Paradox works.  Forms and reports are
>associated with particular tables.  Every time you Ask a query, you
>create a brand new Answer table, deleting any Answer table that was
>sitting in your current working directory.
>
>The way I worked was, for reports I wanted to produce often, to keep a
>second table (I referred to it as a 'skeleton table' but this
>terminology is strictly non-standard!) which has exactly the same
>structure as the Answer table I wanted to report from, but no data in
>it.  Use this second table to design reports, forms etc.  Every time
>you do a query and want to use one of the reports or forms, do a F10
>Tools Copy Justfamily "skeleton" "Answer".
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^

I believe "Copy" overwrites the table and could hose your reports....it
is safer to empty "skeleton", add "answer" "skeleton" from a script ...
that way you know exactly what is in the skeleton table at all times.

>(I'm guessing that you're more interested in manipulating your data
>than in creating applications to assist in entering or reporting on
>it.  If this is not true, then some other methods may be more
>appropriate.)  
>-- 
>\   \/   /  |  
> \/\/\/\/   |  mary.curtin@bbs.actrix.gen.nz
>

-Bob-

Bob Angell                               | Data Integration (multi-platform)
Principal, Management Systems Engineer   | Health Systems Engineering
Applied Information & Management Systems | Database design/development
1238 Fenway Avenue - SLC, UT 84102-3212  | Simulation/Modeling/Neural Nets
bangell@cs.utah.edu; Voice: 801-583-8544 | Product Reviewer-Major Publication

     [Standard Disclaimer: Speaking for the University of Utah, NOT!]




Newsgroups: comp.databases,comp.unix.sys5.r3,comp.unix.questions
From: dant@microsoft.com (Dan Tyack)
Subject: Re: Accessing MS SQL Server from Unix
Date: 25 Jan 93 17:44:34 GMT
Organization: Microsoft Corporation
Distribution: comp

In article <TODD.93Jan22062948@todd.kastle.com> todd@kastle.com writes:
>
>We are going to be developing a new application using a SQL relational
>database.  All of our developers have Unix PC workstations (Interactive
>Unix 3.0.1) which we've been using to develop the current project, and
>it would be most advantageous to keep these as they are.
>
>Already sharing the Ethernet with these boxes is a machine running
>Microsoft SQL Server, which is being used by an inventory application.
>The SQL Server runs on top of OS/2 1.3 and is accessed through named
>pipes, currently from workstations running Novell Netware.
>
>Is it possible to connect with the SQL Server from Unix?  What would we
>need to do this?  Thanks.
>
>
>--
> 
>Todd Scalzott, Systems Programmer                     todd@kastle.com   
>Kastle Development Associates                         ...!uunet!friend!todd
>



The SQL Bridge product from  Microsoft  supports this.  It is a 
protocol gateway which  supports access between PC clients and Sybase servers
and Unix and VMS clients and Lan based SQL Server.
Newsgroups: comp.databases
From: waynel@microsoft.com (Wayne Lampel)
Subject: Re: FOXPRO2: Question about defining Function Keys
Date: 23 Jan 93 23:30:12 GMT
Organization: Microsoft Corp.
Distribution: usa

In article <C17sI9.Bou@mach1.wlu.ca> derwin@mach2.wlu.ca wrote:
> I am trying to assign the FUnction keys to execute things like the
> <New> <Cancel> <OK> push buttons that are defined in the Control
> subscreen.
> 
> Can anyone think of a way to do this without repeating all the
> code in each of these things.
> 
> Syntax is wrong, but
> 
> ON KEY F2 ???GOT <New>; KEYBOARD "chr(13)" 
> 
> Or some such thing.. I question whether ON KEY can be used 'cuz
> it justs jumps, executes, then jumps back.
> 
> Any thoughts on this?

If the controls that you speak of are part of your application,
something like the following should work (or perhaps I missed the point <g>).

ON KEY LABEL F2 DO f2prog


PROCEDURE f2prog

_curobj = new_variable
KEYBOARD CHR(13)

RETURN
From: cnb@cnbisis.lerctr.org (Nelson Baird)
Newsgroups: comp.databases.theory
Subject: Re: Info needed for designing Data Dictionary
Date: Sun, 24 Jan 93 17:14:01 -0600
Organization: ISIS, Inc, Ferris TX

In <C169I8.7vF@unx.sas.com> saslbb@chestnut.unx.sas.com (Lisa Brown) writes:
>I am just getting started on a project which involves
>writing a data dictionary.  If anyone knows of any
>good journal articles or books on this subject, I would
>appreciate the information.

>Lisa Brown
>saslbb@unx.sas.com

As I have commented before on this issue.  There is not a recognized agreement on 
the folowwing terms from your request: 
 
1) good
2) data dictionary

Given the lack of agreement it masy be necessary to start withthe specification 
of what you want your "data dictionary" to accomplish for what audiance.  

Active dictionary?  Passive? 
 
Many environments or a single environment? (OP sys, DB, communications software,
   Languages etc.)  
 
Get any group of "qualified" professionals together and ask them to describe a
datadictionary.  Expect at least N+1 descriptions for every group of N participants.

-- 
 Thanks,            ! cnb@cnbisis.lerctr.org 
 C. Nelson Baird    ! The opinions are MINE. (not necessarily the company's)
                    ! Intelligent Solutions In Software, Inc                     
 -------------------+ 1750 Newton Rd             Ferris, TX 
 
Xref: sparky comp.databases.theory:707 comp.databases:9283
From: lorange@spot.Colorado.EDU (Hans L'Orange)
Subject: Re: Info needed for designing Data Dictionary
Organization: University of Colorado, Boulder
Date: Mon, 25 Jan 1993 15:40:48 GMT

cnb@cnbisis.lerctr.org (Nelson Baird) writes:

>In <C169I8.7vF@unx.sas.com> saslbb@chestnut.unx.sas.com (Lisa Brown) writes:
>>I am just getting started on a project which involves
>>writing a data dictionary.  If anyone knows of any
>>good journal articles or books on this subject, I would
>>appreciate the information.

>>Lisa Brown
>>saslbb@unx.sas.com

>As I have commented before on this issue.  There is not a recognized agreement on 
>the folowwing terms from your request: 
> 
>1) good
>2) data dictionary

>Given the lack of agreement it masy be necessary to start withthe specification 
>of what you want your "data dictionary" to accomplish for what audiance.  

>Active dictionary?  Passive? 
> 
>Many environments or a single environment? (OP sys, DB, communications software,
>   Languages etc.)  
> 


I think the key word in Lisa's post was "started".  If you don't know what
questions to ask or don't know the terminology to ask the question of the
experts, where do you start?  Where do you learn what a passive dictionary is
so that you can describe the specs?

All she has learned so far is "learn something somewhere else and then come
back and talk to me".

Hans
-- 
******************************************************************************
* "I have always imagined that Paradise  *       "Let there be songs,        *
*    will be a kind of library"          *         to fill the air"          * 
*        Jorge Luis Borges               *                Garcia - Hunter    *
From: weik@PrakInf.TH-Ilmenau.DE (Thomas Weik)
Newsgroups: comp.databases.theory
Subject: e-mail address of Oregon Graduate Institute
Date: 26 Jan 93 07:48:34 GMT
Reply-To: weik@PrakInf.TH-Ilmenau.DE (Thomas Weik)
Organization: Technische Universitaet Ilmenau

Hi,
I'm looking for the e-mail-address of David Maier at the Oregon Graduate
Institute because I desperately need a working paper of his group which
hasn't been published anywhere else.
Unfortunately uoregon.edu was the closest I could get so far.
I'd appreciate any further reference. Thanks a lot in advance!
Thomas Weik

-- 
_________________________________________________________________________
| Thomas Weik                      |                                     | 
| Institut Praktische Informatik   |                                     |
| TU Ilmenau                       |                                     |
| Postfach 327                     | Tel.: +49-3677-691207               |
| O-6300 Ilmenau                   | Fax:  +49-3677-691201               |
| Germany                          | e-mail: weik@PrakInf.TU-Ilmenau.DE  |
|__________________________________|_____________________________________|

   There is a theory which states that if ever anyone discovers
   exactly what the Universe is for and why it is here, it will
   instantly disappear and be replaced by something even more
   bizarre and inexplicable.

   There is another which states that this has already happened.

Douglas Adams: The Restaurant at the End of the Universe
From: sandahl@byron.u.washington.edu (Bonnie Sandahl)
Newsgroups: comp.databases.theory
Subject: ***** Entity/Relationship Diagramming Software ****
Date: 22 Jan 1993 19:39:31 GMT
Organization: University of Washington, Seattle
Distribution: world
Reply-To: sandahl@u.washington.edu
NNTP-Posting-Host: byron.u.washington.edu



  I'm looking for Entity-Relationship Diagramming software that runs under Windows
  3.1.  I've seen advertisements for ER/Win and System Architect but I don't 
  know if they're any good.  Is anyone using them out there?
  
  It would also be nice if the software included other tools such as DFD's or 
  Flow Charts.
  
  It would also be nice if it cost around $1,000...

  ****************************************************
  Nathan McCoy
  Internet:  sandahl@byron.u.washington.edu
  ****************************************************

Newsgroups: comp.databases.theory
From: markus@arlac.rhein-main.de (Markus Felten)
Subject: cummulation in view columns
Organization: MF
Date: Sun, 24 Jan 1993 13:33:27 GMT


Dear SQL Users

Well this should have been simple, but
supposed I have a table like this

create table material_amount(
	material	char(1),
	date		datetime,
	amount		float)

with sample data:

material	date	amount
-------------------------------
 A	 Jan 5 1993	  20
 B	 Jan 1 1993	 200
 A	 Jan 1 1993	 100
 A	 Jan 3 1993	  50
 B	 Jan 6 1993	  10

How can I build a VIEW material_total with [ total = sum(amount)
from now to date ],
the order of rows does not matter?

material_total then should look like this:

material	date	total
-------------------------------
 A	 Jan 1 1993	 100
 A	 Jan 3 1993	 150		( 100 + 50 )
 A	 Jan 5 1993	 170		( 100 + 50 + 20 )
 B	 Jan 1 1993	 200
 B	 Jan 6 1993	 210		( 200 + 10 )

Any help would be mostly welcomed.

Markus

--------------------------------------------------------------------------
Markus Felten	       			  Phone: +049 6171 59387
Systemanalyse u. Systementwicklung  
Lange Str.59              		  Email:  
markus@arlac.rhein-main.de 
6370 Oberursel (near Frankfurt a.M.)
Germany
--------------------------------------------------------------------------
Newsgroups: comp.databases.theory
From: lambrech@enuxhb.eas.asu.edu (Bob Barker)
Subject: Re: terms..
Reply-To: lambrech@enuxhb.eas.asu.edu (Bob Barker)
Organization: Arizona State University, Tempe AZ
Date: Sat, 23 Jan 1993 22:38:41 GMT


I wonder if anybody here could help me out:
 I'm trying to get a definition of some database terms for a friend who,
although he's worked with databases in the past, hasn't come across these terms
before.. if anybody here has any free time and could mail me just a simple
definition of each, I'd be much appreciative..

the terms are: simulated annealing, database mining, and greedy algorithm. They
appear in an announcement for a presentation by Bala Iyer at Santa Cruz that is
coming up in the future.

gracias por la informacion



--
Eric Lambrecht                                 lambrech@enuxhb.eas.asu.edu
     "One Policy, One System, Universal Service" - Theodore Vail
Newsgroups: comp.databases.theory
From: kyma@shell.portal.com (Matt J Young)
Subject: Problem
Organization: Portal Communications Company
Date: Fri, 22 Jan 1993 20:54:43 GMT


Taking Another Look

Consider an account executive who has an index of hourly sales summaries
of the following form:

    Region.spreadsheet.gross

These indexes are pointers to spreadsheets scattered, by implication,
across the enterprise according to region.  The executive has no other
information except to note that all spreadsheets are in desktop computers,
which are connected via his virtual path network, and that physical
links have cost associated with their usage.  In fact, the concept of
region has not even been defined according to any criteria.

No computers have been numbered, no object dictionaries, no servers,
no network management packages.

 The executive would first like to define region points, and then
query the spreadsheets on an hour to hour basis such that his daily
network costs are minimized.
From: cnb@cnbisis.lerctr.org (Nelson Baird)
Newsgroups: comp.databases.theory
Subject: Re: Wanted: refs on indexing schemes for oodb's
Date: Sun, 24 Jan 93 17:21:39 -0600
Organization: ISIS, Inc, Ferris TX

In <1993Jan21.004556.5114@usage.csd.unsw.OZ.AU> jas@spectrum.cs.unsw.oz.au (John Shepherd) writes:
>I'm interested in current work being done on indexing schemes and file
>structures which is targetted at object-oriented databases. In fact,
>any pointers to *recent* work in indexing/files in general would be
>interesting. If I receive substantial response, I'll summarise to the
>net.

I find myself in the embarassing position of desiring to see the results of your query, 
having some OODB info related (but unfortuantely proprietary), and not a lot of good pointers. 
 
Computer Associates does a fair job of describing Indexing in their IDMS doc.

I think I remember seeing something or ORICAL.

There are some ACM articles recent enough for me to remember reading them.  I had largely
considered the research closed for my needs.   

-- 
 Thanks,            ! cnb@cnbisis.lerctr.org 
 C. Nelson Baird    ! The opinions are MINE. (not necessarily the company's)
                    ! Intelligent Solutions In Software, Inc                     
 -------------------+ 1750 Newton Rd             Ferris, TX 
 
Newsgroups: comp.databases.theory
From: myoung@NEBULA.SSD.LMSC.LOCKHEED.COM
Subject: Semantic Database
Reply-To: myoung@NEBULA.SSD.LMSC.LOCKHEED.COM
Organization: LMSC, Sunnyvale, California
Date: Wed, 27 Jan 93 17:00:23 GMT

Spanning Tree Semantics:

Assume the user built a spanning tree, spanning say a collection
of file directories across an enterprise.  Now the user wished
to perform text searches over all files spanned, or perform
some file utility over the files, like back up for instance.
How would the user define his semantics, and how would the user 
traverse the tree once built.

Semantics of a Spanning Tree:

span -> id              (use the local node)
                               or
span -> move.span       (move one or more steps)

Files with unique filenames are identified as:

   span.file

to guarantee move at least one hop away from the current node,
and create a back up file name use:

  move.span.file_backup

Using the wave syntax, the traversal of the spanning tree is accomplished
with the following protocol:

  re(op($))            ! repeatedly traverse all outgoing paths.

The re-entry rules would prevent endless broadcast.

The user can use the spanning tree for regular file maintenance, or text
searches.  Any file, once placed on the spanning tree is accessible
with the same semantic regardless of locations, assuming the name is unique.
The spanning tree file system has disadvantages, and does not replace
the traditional network file systems.

The system requires that the semantic execution kernel exist in the
intermediate nodes of the networks.
Newsgroups: comp.databases.theory
From: orpheus@reed.edu (P. Hawthorne)
Subject: Storey's "View Creation"
Organization: Reed College, Portland OR
Date: Sun, 24 Jan 1993 09:12:33 GMT

I've been reading "View Creation: An Expert System for Dataase Design"
by Veda Catherine Storey and am wondering how much of a splash it made
in the database research community. It seems like a very applicable and
very implementable front end for most any DBMS. How seminal is this?

Or am I revealing how out of touch I am by even asking?

Theus (orpheus@reed.edu)

Newsgroups: comp.databases.theory