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,ccec7cf654f5e8c3 X-Google-Attributes: gid103376,public X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news1.google.com!news3.google.com!news2.google.com!fu-berlin.de!uni-berlin.de!not-for-mail From: "news.snafu.de" Newsgroups: comp.lang.ada Subject: Re: creating database Date: Wed, 11 May 2005 12:43:24 +0200 Message-ID: <3ee5u7F2kn16U1@uni-berlin.de> References: <1115570998.707181.84650@o13g2000cwo.googlegroups.com> X-Trace: news.uni-berlin.de sTxXiCMKAhOIWBFB1z1ozgLuUoGi8OYYtzxRROWcokFcUQEIIWKzV7 X-Priority: 3 X-MSMail-Priority: Normal X-Newsreader: Microsoft Outlook Express 6.00.2900.2527 X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2900.2527 X-RFC2646: Format=Flowed; Original Xref: g2news1.google.com comp.lang.ada:10991 Date: 2005-05-11T12:43:24+02:00 List-Id: schrieb im Newsbeitrag news:1115570998.707181.84650@o13g2000cwo.googlegroups.com... > hi > > I'm trying to create a database using ada. I'm struggling to work out > how to implement the record type and storage. The data only has to be > stored in main memory. May be you should think about using an already existing RDBMS procudt, e.g. MySQL or PostgreSQL etc. Bindings between Ada and the corresponding natic bindings are available at various places (e.g. http://gnade.sourceforge.net/). Regards M.Erdmann PS: You will find also there odb which is a simple minded approach to object persistency which might fit you ideas better then using and rdbms. > > I was thinking of creating the ADT as a record with various fields, and > then an array with each element containing a record. However, I don't > know how many records there'll be so it seems inefficient to declare an > array of a particular size. > > Any advice one how to implement the database would be very much > appreciated. As an ada novice, I'm struggling. >