HDTenEightyP/NetNews huggingface dataset:
From: rule@apple.com (Jeff Rule)
Newsgroups: comp.databases,comp.databases.ingres
Subject: Re: Looking for a USABLE database
Date: 28 Jul 92 22:29:30 GMT
Organization: Apple Computer

In article <4352@disuns2.epfl.ch>, baechler@liasun7.epfl.ch (Emmanuel Baechler) writes:
> _ The INGMENU environnemnt is a true horror to use. It is incredibly rigid
>   and poorly designed. Several menu levels do not even contain an abort
>   option (and when it exists, it is not displayed in the menu), which leaves
>   the ^C as the only option to cancel when you made the wrong choice in some
>   cases!
> 

This is generally true of any character-cell based query tool.  What you are longing for
is a GUI interface to the database.

> _ there's no environnment allowing "standard users", like lab people or doctors,
>   to to their searches and requests in a simple and intuitive way, what they find
>   on much simpler tools, like FileMaker on a MacIntosh
> 
>

For Ad-hoc queries there are a couple of really good tools that can be used to access a DB
from the Mac.  They will hide the ugly command line interface of the DBMS.  One
is GQL from Andyne corp.  The other is Clear Access from Fairfield Software

Both tools can use DAL (and a number of other middle-ware solutions SQL*NET, DBlib etc..) 
to access any number of DBMS engines (RDB, DB2, INGRES, Oracle, Sybase etc....) on 
any number of operating systems (VMS, Vax/Unix, AIX, MVS) and multiple transports
(TCP/IP, Local Talk,Token Ring, SNA, Async etc....).  What you will find is that you can plug 
and play most any  DBMS with these tools.  You are going to pay extra for the tools, but 
the are well worth it in user productivity and ease of use when accessing the database.

-Jeff Rule
Apple Computer/Database Resource Management
Newsgroups: comp.databases
From: thompson@stars.gsfc.nasa.gov (William Thompson, code 682.1, x2040)
Subject: Turning off output in VMS
News-Software: VAX/VMS VNEWS 1.4-b1  
Organization: NASA/GSFC-Laboratory for Astronomy and Solar Physics
Date: Wed, 29 Jul 1992 14:00:00 GMT

I tried to Email this, but it got rejected, so I'm posting my reply.

In article <1992Jul21.195448.7486@stortek.com>, you write...
> 
>In a DCL Com file, how do you turn off all
>output to the screen so that the user can not
>see what's taking place within the com file.
>More specifically, when you run RPT you get
>messages to the screen saying 125 lines written
>to filename.RPF and then when the RPF command is
>invoked, you get more messages. I don't want the
>user seeing them, and I don't want to put this
>job in a batch mode.  Theres got to be a way
>to supress these messages from RPT and RPF.

I'm not specifically acquainted with the software you're trying to run, but
I'll try to answer your question.  First of all you can include the line

	$ SET NOVERIFY

To turn off other output, you can enter

	$ DEFINE /USER  SYS$ERROR   NL:
	$ DEFINE /USER  SYS$OUTPUT  NL:

immediately before each instance of running the RPT and RPF programs, assuming
they are executable files and not command files themselves.  The effect of the
DEFINE/USER statement only lasts until the next executable program exits.

Hope this helps.

Bill Thompson
Newsgroups: comp.databases
From: howard@homebase.vistachrome.com (Howard Kennedy)
Subject: Progress Info Wanted
Organization: Vista-Chrome Incorporated
X-Newsreader: Tin 1.1 PL4
Date: Wed, 22 Jul 1992 18:05:03 GMT

	We are currently using Oracle.  We are considering using Progress at least
	for one of our projects.  We need information and opions about the
	following products:

	Progress 4GL.
	Progress First Track.
	Progress Results.
	Progress Fast Attack.

	We would also like to hear from sites that have converted from
	Oracle to Progress.

	Thanx.
-- 
Howard E. Kennedy uucp: ...!uunet!rde!howard  inet: howard@vistachrome.com
From: doug.hewko@synapse.isis.org (Doug Hewko) 
Newsgroups: comp.databases
Subject: dataease
Date: 28 Jul 92 08:51:00 GMT
Distribution: world
Organization: SYNAPSE BBS - GATINEAU, QUEBEC - 819-561-4321
Reply-To: doug.hewko@synapse.isis.org (Doug Hewko) 

Does anyone here familiar with DataEase?

..Doug Hewko
---
 . DeLuxe. 1.25 #483sa . Life is doing things, not making things.
   
Newsgroups: comp.databases.theory
From: marti@nugget.inf.ethz.ch (Robert Marti)
Subject: Re: Any example of actual implementations of B-Tree's?
Keywords: b-tree indexes indexing
Organization: Dept. Informatik, Swiss Federal Institute of Technology (ETH), Zurich, CH
Date: Fri, 31 Jul 1992 14:10:04 GMT

In article <naran.712476183@sfu.ca>, naran@fraser.sfu.ca (Travers Naran) writes:
|> I am writing a database program for myself and is going to be mostly
|> disk-based. But now, I have the theory for B-Trees (Not binary trees, the B
|> stands for something else) but no algorithms or any books that even talk about
|> using it. All the books I have found so far are concerned about normalization
|> and other stuff I already know about. 
|> 
|> How are B-Trees actually implemented? Data structures, algorithms, etc.
|> Any examples by FTP or on the Net in general? Pieces of code, database sourcee
|> codes, etc.

As far as I know, the B stands for Boeing, the company where Rudolf Bayer
and Ed McCreight worked for when they invented this data structure.  (Of
course, it could also stand for balanced, or Bayer, too ... )

Niklaus Wirth's "Algorithms and Data Structures" book contains the code
for inserting, searching, and deleting entries in a B-tree which resides
entirely in main memory.  (Depending on the edition, this code is written
in Pascal or Modula-2.)

As for disk-based B-tree code, it becomes somewhat more tricky.  Usually,
each node of a B-tree is mapped to a disk block (page).  As a result,
you need to know the interface to the underlying buffer manager which
will typically provide you with procedures like RequestPage, DropPage,
ReadPage, WritePage, FixPage, ReleasePage, and maybe a few others.

You may want to study the code of some of the available storage systems
(e.g. WiSS, the Wisconsion Storage System) or database management systems
(e.g., REQUIEM, University INGRES, or Postgres), although I don't know
off the top of my head which ones provide B-trees.

-- 
Robert Marti                    |  Phone:    +41 1 254 72 60
Informationssysteme             |  FAX:      +41 1 262 39 73
ETH-Zentrum                     |  E-Mail:   marti@inf.ethz.ch
CH-8092 Zurich, Switzerland     |
Newsgroups: comp.databases.theory
From: srb@barakam.b17d.ingr.com (Sreedhar Barakam)
Subject: Secure databases, distributed datbases
Organization: Intergraph Corp.,
Date: Fri, 31 Jul 1992 14:07:28 GMT


Are there any references as to how the security issues are handled when
secure databases are part of a distributed environment?  To handle the
security of users on different databases and their passwords, any kind of
a distributed query would necessitate somekind of online user-prompts for
remote database connections.  Any information regarding this would be 
appreciated.

Thanks in advance

Sreedhar.
From: agonzale@nmsu.edu (Agustin Gonzalez-Tuchmann)
Newsgroups: comp.databases.theory
Subject: Re: Deductive databases
Date: 22 Jul 92 00:19:25 GMT
	<1992Jul9.104158.29560@Urmel.Informatik.RWTH-Aachen.DE>
	<gerry.711607927@coral.cs.jcu.edu.au>
	<1992Jul20.165732.28986@daffy.cs.wisc.edu>
Organization: NMSU Computer Science


Datalog is turing-incomplete because it does not
support function symbols.
--
--------------------------------- * -----------------------------------
Agustin Gonzalez-Tuchmann                    Graduate student
Dept. of Computer Science                    dbase-l list owner
New Mexico State University                  Office: SH-131
P.O. Box 30001, Dept. 3CU                    Phone: (505) 646-6229
Las Cruces, N.M. 88003-0001                  e-mail: agonzale@nmsu.edu
Newsgroups: comp.databases.theory
From: raghavav@deneb.cs.rpi.edu (Vijay Raghavan)
Subject: Re: Any example of actual implementations of B-Tree's?
Organization: Rensselaer Polytechnic Institute, Troy, NY
Date: Fri, 31 Jul 1992 01:25:42 GMT

In article <chaw.712522251@Xenon.Stanford.EDU> chaw@Xenon.Stanford.EDU (S. S. Chawathe) writes:
>al045@cleveland.Freenet.Edu (Gergely Tapolyai) writes:
>>B in B-Tree _is_ for Binary.  B-Tree, B+ tree, Bit-Tree and their
>
>That's strange, considering that a B-Tree is not binary at all!
>I remember hearing strange tales about the B standing for the
>name of one of the inventors, who was working at Boeing....etc.
>:-)
>
>-Chaw

B-tree is BALANCED tree not binary tree. Of course you have Balanced trees 
which are binary called AVL trees.  

vijay


-- 
Vijay Raghavan, ROSE group | Your magic reunites, what customs sternly separate
Dept of Computer Sc, RPI   | all men shall be brothers,
Phone: (518)-276-4838      | whenever your gentle wings tarry 
EMAIL: raghavav@cs.rpi.edu | - Schiller (Ode of Joy)
Newsgroups: comp.databases.theory
From: jeusfeld@picasso.informatik.rwth-aachen.de (Manfred A. Jeusfeld)
Subject: Re:  Databases and Deduction
Organization: University of Aachen, W-Germany
Date: Tue, 21 Jul 92 15:58:52 GMT

Francois Bry writes on application of deductive databases:

>> + Should deduction replace conventional programming paradigms in databases? 
>> I do not think so. [...]

Well, Francois. I agree that many things can be declared/solved by deductive
rules in a very efficient and convincing way that is hardly to be achieved
by "conventional" programs. You can add user interface and software configuration
control to your list.

BUT: If your future DB contains as many rules as facts, how does that
integrate with data structures of conventional programming languages?? People
do not pay for a nice data model but for applications solving some problem.
I do not believe that SQL cursors are the last word to combine a DBMS and
an application program. If that were true, then OODBMS will be a much better
environment for application developers.

PS: Funny to see F. Bancilhon as an advocate for deductive DB's :-)

-- 
...............................................................
    Manfred Jeusfeld      email:  jeusfeld@informatik.rwth-aachen.de
    RWTH Aachen
    Informatik V        Tel.Nr. +49 +241/80-21510
    Ahornstr. 55        Fax     +49 +241/80-21529
    5100 Aachen / Germany         
...............................................................
Newsgroups: comp.databases.theory
From: chaw@Xenon.Stanford.EDU (S. S. Chawathe)
Subject: Re: Any example of actual implementations of B-Tree's?
Organization: CS Department, Stanford University, California, USA
Date: 30 Jul 92 18:50:51 GMT

al045@cleveland.Freenet.Edu (Gergely Tapolyai) writes:
>B in B-Tree _is_ for Binary.  B-Tree, B+ tree, Bit-Tree and their

That's strange, considering that a B-Tree is not binary at all!
I remember hearing strange tales about the B standing for the
name of one of the inventors, who was working at Boeing....etc.
:-)

-Chaw


Newsgroups: comp.databases.theory
From: nirad@newdelphi.ceu.uq.oz.au (Nirad Sharma)
Subject: Recent lit. survey on existing DDBMSs
Organization: Continuing Education Unit, The University of Queensland
Date: Tue, 21 Jul 1992 10:14:40 GMT

Can anyone provide me with a reference for a recent literature survey on the
current state of and descriptions of implemented distributed database management
sytems ?
--
Nirad Sharma  (nirad@ceu.uq.oz.au)			Phone : (+61 7) 365 7575
Continuing Education Unit				Fax :	(+61 7) 365 7099
The University of Queensland.  QLD  4072.  AUSTRALIA
Newsgroups: comp.databases.theory
From: meskes@ulysses.informatik.rwth-aachen.de (Michael Meskes)
Subject: Re: Any example of actual implementations of B-Tree's?
Organization: Rechnerbetrieb Informatik  /  RWTH Aachen
Date: 31 Jul 92 09:06:50 GMT

In <chaw.712522251@Xenon.Stanford.EDU> chaw@Xenon.Stanford.EDU (S. S. Chawathe)
writes:

>al045@cleveland.Freenet.Edu (Gergely Tapolyai) writes:
>>B in B-Tree _is_ for Binary.  B-Tree, B+ tree, Bit-Tree and their

>That's strange, considering that a B-Tree is not binary at all!

agreed

>I remember hearing strange tales about the B standing for the
>name of one of the inventors, who was working at Boeing....etc.
>:-)

Yes, one possible interpretation is the name of one of the inventors, who was
R. Bayer, a professor from Munich, Germany, cf. the following article:

Bayer R. and E.M. McCreight, "Organization of operating  on B-Trees",
Acta Informatica 9:1, 1972, pp 173 - 189

Mostly, especially in english language literature, it is said that the B is
standing for Balanced.

In the original article there was also literature searched, that describes the
implementation, if I remember right. Try to use

Nicklaus Wirth
Algorithms + Data Structures = Programs
Prentice Hall

Michael
-- 
Michael Meskes, Lehrstuhl fuer angewandte Mathematik insb. Informatik,
RWTH-Aachen, Ahornstr. 55, D-W-5100 Aachen
Email: meskes@ulysses.informatik.rwth-aachen.de
Xref: sparky comp.databases.theory:292 misc.wanted:7314
From: ggao@apee.ogi.edu (Gengying Gao)
Newsgroups: comp.databases.theory,misc.wanted
Subject: Wanted: Information of 'Progress Program'
Date: 26 Jul 92 23:46:41 GMT
Article-I.D.: ogicse.40550
Distribution: usa
Organization: Oregon Graduate Institute, Applied Physics & Electrical Engineering, Beaverton

Is anybody here familiar with 'progress program' ?
Any information about books, papers, or discussion 
are very welcome. 
Thanks,
 
- Geny
ggao@apee.ogi.edu








Newsgroups: comp.databases.theory
From: naran@fraser.sfu.ca (Travers Naran)
Subject: Any example of actual implementations of B-Tree's?
Keywords: b-tree indexes indexing
Organization: Simon Fraser University, Burnaby, B.C., Canada
Date: Thu, 30 Jul 1992 06:03:03 GMT

I am writing a database program for myself and is going to be mostly
disk-based. But now, I have the theory for B-Trees (Not binary trees, the B
stands for something else) but no algorithms or any books that even talk about
using it. All the books I have found so far are concerned about normalization
and other stuff I already know about. 

How are B-Trees actually implemented? Data structures, algorithms, etc.
Any examples by FTP or on the Net in general? Pieces of code, database sourcee
codes, etc. 

Thanks in advance.

Also, is there any books out there that talks to us people who actually write
the down and dirty code for databases? :-)

-- 
--------------------------------------------------------------------------
Travers Naran						| "We don't like
Mail address: naran@fraser.sfu.ca or naran@sfu.ca       |  change. WHACK!
Simon Fraser University, British Columbia, Canada	| WHACK! WHACK!"
Cmpt. Science student wanna-be				| -Garth 
Trekker, Leaper, Red Dwarf'er, Prober, etc.		|  "Wayne's World"
--------------------------------------------------------------------------
From: moss@cs.umass.edu (Eliot Moss)
Newsgroups: comp.databases.theory
Subject: Re: Any example of actual implementations of B-Tree's?
Date: 31 Jul 92 18:00:06 GMT
Reply-To: moss@cs.umass.edu
Organization: Dept of Comp and Info Sci, Univ of Mass (Amherst)
In-reply-to: al045@cleveland.Freenet.Edu's message of 30 Jul 92 17:52:43 GMT

Ignoring the issue of what the B stands for, another source for actual code is
the Exodus storage manager and related software (E database programming
language, etc.) from Wisconsin. Suggest you send mail to zwilling@cs.wisc.edu
(Mike Zwilling) for further info. We have also built a B-tree package for our
persistent object store, but it's not yet in releaseable condition.
--

		J. Eliot B. Moss, Associate Professor
		Department of Computer Science
		Lederle Graduate Research Center
		University of Massachusetts
		Amherst, MA  01003
		(413) 545-4206, 545-1249 (fax); Moss@cs.umass.edu
From: raghavav@deneb.cs.rpi.edu (Vijay Raghavan)
Newsgroups: comp.databases.theory
Subject: SQL3 standard: FTP site
Date: 28 Jul 92 14:34:20 GMT
Organization: Rensselaer Polytechnic Institute, Troy NY

Title says it all. Does any one know of an FTP site for the SQL3 standard.

vijay

-- 
===============================================================================
Vijay Raghavan, ROSE group | Your magic reunites, what customs sternly seperate
Dept of Computer Sc	   | all men shall be brothers,
RPI. Ph:(518)-276-4838     | whenever your gentle wings tarry - Schiller
From: raghavav@deneb.cs.rpi.edu (Vijay Raghavan)
Newsgroups: comp.databases.theory
Subject: Re: SQL3 standard: FTP site
Date: 30 Jul 92 18:18:31 GMT
Organization: Rensselaer Polytechnic Institute, Troy, NY

In article <=azxc--@rpi.edu> raghavav@deneb.cs.rpi.edu (Vijay Raghavan) writes:
>Title says it all. Does any one know of an FTP site for the SQL3 standard.
>
>vijay
>

I have to date received no positive reply for my query. But there seems to be 
a strong interest in the standard(I have received more than 30 replies asking
for information to be passed on to them).  

If anybody knows how one can at least obtain a hard copy of the standard, 
please let me know.  I shall summarize on the net.  

I am sure there must be somebody in the standards committee reading this 
newsgroup.

vijay

-- 
Vijay Raghavan, ROSE group | Your magic reunites, what customs sternly separate
Dept of Computer Sc, RPI   | all men shall be brothers,
Phone: (518)-276-4838      | whenever your gentle wings tarry 
EMAIL: raghavav@cs.rpi.edu | - Schiller (Ode of Joy)
Newsgroups: comp.databases.theory
From: ganeshj@cs.tamu.edu (Ganesh Jayadevan)
Subject: Info on Dist databases
Keywords: Distributed databases
Organization: Computer Science Department, Texas A&M University
Date: Sat, 25 Jul 1992 21:02:28 GMT

Hi Netters,
	I am doing a survey on distributed databases that
have been implemented so far. Can someone give me some references
in form of research publications and magazine articles?
I would very much appreciate your help.`
Thanks a million in advance.

P.S: Kindly reply directly to my mail address " ganeshj@cs.tamu.edu "
ganesh Jayadevan




--
:wq

Newsgroups: comp.databases.theory
From: ganeshj@cs.tamu.edu (Ganesh Jayadevan)
Subject: Info on distributed databases
Organization: Computer Science Department, Texas A&M University
Date: Sat, 25 Jul 1992 21:04:14 GMT

?
From: ganeshj@cs.tamu.edu (Ganesh Jayadevan)
Newsgroups: comp.databases.theory
Distribution: world
Followup-To: 
Organization: Computer Science Dept., Texas A&M University
Subject:Need info on Dist Databases 
Keywords: Distributed databases

Hi guys,
 I am doing a survey on distributed databases that have been 
already built commercially available or otherwise. I'll appreciate any references that you may be able to provide.
-- 
:wq




From: ganeshj@cs.tamu.edu (Ganesh Jayadevan)
Newsgroups: comp.databases.theory
Distribution: world
Followup-To: 
Organization: Computer Science Dept., Texas A&M University
Subject:Dist Databases 
Keywords: Distributed databases

Hi guys,
 I am doing a survey on distributed databases that have been 
already built commercially available or otherwise. I'll appreciate any references that you may be able to provide.
You may mail to me directly to ganeshj@cs.tamu.edu.
Thanks in advance
ganesh
-- 
:wq




From: ganeshj@cs.tamu.edu (Ganesh Jayadevan)
Newsgroups:comp.databases.theory 
Distribution: world
Followup-To: 
Organization: Computer Science Dept., Texas A&M University
Subject:Distributed databases 
Keywords: 

Hi Netters,
	I am doing a survey on distributed databases that
have been implemented so far. Can someone give me some references
in form of research publications and magazine articles?
I would very much appreciate your help.`
Thanks a million in advance.

P.S: Kindly reply directly to my mail address " ganeshj@cs.tamu.edu "
ganesh Jayadevan


From: ganeshj@cs.tamu.edu (Ganesh Jayadevan)
Newsgroups:comp.databases.theory 
Distribution: world
Followup-To: 
Organization: Computer Science Dept., Texas A&M University
Subject:Distributed databases 
Keywords: 

Hi Netters,
	I am doing a survey on distributed databases that
have been implemented so far. Can someone give me some references
in form of research publications and magazine articles?
I would very much appreciate your help.`
Thanks a million in advance.

P.S: Kindly reply directly to my mail address " ganeshj@cs.tamu.edu "
ganesh Jayadevan


--
:wq
From: phani@uts.amdahl.com (Phani Bodduluri)
Newsgroups: comp.databases.theory
Subject: Reference material on Tuxedo (OLTP application)
Date: 29 Jul 92 20:17:32 GMT
Reply-To: phani@tde.uts.amdahl.com (Phani Bodduluri)
Distribution: usa
Organization: Amdahl Corporation, Sunnyvale CA


Hi --

It looks like I'll live with Tuxedo for next few months in my new
group. I follow this group with lot of interest, and the discussion
is more interesting, compared to other groups that deal with relational
databases.

I'd appreciate if you provide any info. either on net or send me email 
regarding the following:

1. Are there any good references that explain Tuxedo(better than what
   AT&T manuals do ??!!)

2. Do you think Tuxedo is ultimate solution in commercial applications??

  (Personally, I believe that Oracle or Sybase will be more successful
   in real world due to the facts such as availability of more powerful
   tools to insert and retrieve info. from databases, backup etc.,. I was
 kind of biased towards Oracle, since it was my ex-employer !!)

3. Any ref. sources to read about differences between TOPEND and TUXEDO
   I think TOPEND is NCR's and TUXEDO is AT&T's products.


Thanks alot 

Have a nice day.
----
phani

Commercial Applications Test Group		phani@uts.amdahl.com
Amdahl Corporation				Phone: 408 737 5776 (off)
From: joey@berkeley.edu (Joe Hellerstein)
Newsgroups: comp.databases.theory
Subject: Re: Semantic query optimization
Date: 29 Jul 92 22:29:02 GMT
Organization: Postgres Research Group
NNTP-Posting-Host: elysium.cs.berkeley.edu
In-reply-to: vdbuss@bigeye.cs.indiana.edu's message of 29 Jul 92 09:31:03 GMT

In article <1992Jul29.093110.8162@news.cs.indiana.edu> vdbuss@bigeye.cs.indiana.edu (Jan Van den Bussche) writes:

>   I'm looking for references to work done in semantic query optimization,
>   especially in the context of object-oriented databases.
>
>   Best wishes, --Jan

Take a look at SIGMOD '92, a paper by Pirahesh, Hellerstein and Hasan
entitled "Extensible/Rule-Based Query Rewrite Optimization in
Starburst".  

Joe Hellerstein
From: vdbuss@bigeye.cs.indiana.edu (Jan Van den Bussche)
Newsgroups: comp.databases.theory
Subject: Semantic query optimization
Date: 29 Jul 92 09:31:03 GMT
Organization: Computer Science, Indiana University


I'm looking for references to work done in semantic query optimization,
especially in the context of object-oriented databases.

Best wishes, --Jan
Newsgroups: comp.databases.theory
From: jian@cs.hw.ac.uk (Jian Hu)
Newsgroups: comp.databases
Subject: Features of MEDICAL Databases
Keywords: medical databases
Date: 27 Jul 92 10:56:28 GMT
Organization: Dept of Computer Science, Heriot-Watt University, Scotland

I'm involving a project to deal with medical databases and I need to have
some knowledge of the distinct features of the medical databases or medical
information systems. Could anybody give me some hints or recommend some
references?

Thanks in advance!

J. Hu

-- 
    Jian  Hu                              JANET:  jian@uk.ac.hw.cs
    Dept. of Computer Science,            UUCP:  <EUROPE>!ukc!hwcs!jian 
    Heriot-Watt University,                 or:  jian@hwcs.uucp
    +44 31 225 6465 ext. 544              ARPA:  jian@cs.hw.ac.uk  
Newsgroups: comp.databases,comp.databases.informix,comp.sources.wanted,alt.sources.wanted
From: pete@wvus.org (Pete Gregory)
Subject: WANTED: govt. grant tracking system
Organization: World Vision U.S.
Date: Thu, 23 Jul 92 19:57:59 GMT

We are interested in acquiring a government grant tracking system for use
in our organization.  We are a UNIX/Informix non-profit shop.

Thanks....
-- 

Pete Gregory       |  Internet: pete@wvus.org
UNIX SA            |  Bangpath: ames!elroy!wvus!pete
World Vision U.S.  |  Slowpath: 919 W. Huntington Dr., Monrovia, CA 91016