From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Thread: 103376,bf02c238a92156a3
X-Google-Attributes: gid103376,public
X-Google-Language: ENGLISH,ASCII
Path: 
 g2news1.google.com!news1.google.com!fu-berlin.de!uni-berlin.de!not-for-mail
From: "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>
Newsgroups: comp.lang.ada
Subject: Re: Windows Ada database support.
Date: Mon, 29 Nov 2004 19:16:18 +0100
Organization: cbb software GmbH
Message-ID: <12ldk8eswlq2y.10ffhprj1el1l$.dlg@40tude.net>
References: <5e3e03a7.0411240431.7e037a4e@posting.google.com>
 <2004112420030750073%david@bottoncom>
 <mWopd.59182$Le1.1224388@news20.bellglobal.com>
 <vftyrbanzux4$.q4cw1i7499xx$.dlg@40tude.net>
 <opsh8equylm0et4w@news.online.de>
Mime-Version: 1.0
Content-Type: text/plain; charset="iso-8859-1"
Content-Transfer-Encoding: 8bit
X-Trace: news.uni-berlin.de iGBuuKjU8e0V7rjTO+3feg01pkLrDm0ezBCPU/SqDYZOKO0iI=
User-Agent: 40tude_Dialog/2.0.12.1
Xref: g2news1.google.com comp.lang.ada:6648
Date: 2004-11-29T19:16:18+01:00
List-Id: <comp.lang.ada>

On Mon, 29 Nov 2004 16:02:44 +0100, Frank Piron wrote:

> Fri, 26 Nov 2004 10:15:06 +0100 Dmitry A. Kazakov 
> <mailbox@dmitry-kazakov.de> wrote:
> 
>> And more importantly why that crappy SQL over and over again? I would 
>> like
>> to see a high level Ada.Database[.Relational?] package totally 
>> independent
>> on what happens beneath.
>>
> But what language for querying and manipulating data would you
> suggest?
> IMO it should
> 
> - be declarative
> - boolean closed
> - allow restricted quantification

Yes.

> Some LQL (Logical query language based on Predicate Calculus)
> would be nice.
> Example: (Database for Genealogical data)
> 
> Base Predicates(Tables): Person(x,s), Parent(x,y)     |(s = sex)
> Show all Fathers:
> 
> LQL:
> Father(x):=E(y)[Person(x,s) and
>                  s='MALE'    and
>                  Parent(x,y)
>                  ]
> 
> SQL:
> select Person.x
>       from Person, Parent
>        where Person.s='MALE' and
>              Person.x = Parent.x   (inner join for the E-Quantifier)
> 
> Similar to Prolog.
> 
> Other implementations would use only persistent types and their methods
> in a distributed environment (like Cach�).

Ideally it should be a direct use of Ada's ADT. It should be true ADT, not
just a data representation, also stored procedures (are they Turing
complete, BTW? (:-)) I don't know how realistic it will be in 2010, but
sooner or later a new generation of OO data bases will support ADT.

-- 
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de