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-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,a6dbac911d455814
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2001-11-12 09:53:12 PST
Newsgroups: comp.lang.ada
Path: 
 archiver1.google.com!news1.google.com!sn-xit-02!supernews.com!isdnet!diablo.theplanet.net!newspeer.clara.net!news.clara.net!news2.euro.net!uunet!ash.uu.net!xyzzy!nntp
From: Jeffrey Carter <jeffrey.carter@boeing.com>
Subject: Re: looking for a fast  re-usable non-pointer data structure ....
X-Nntp-Posting-Host: e246420.msc.az.boeing.com
Content-Type: text/plain; charset=us-ascii
Message-ID: <3BF008DA.5300944@boeing.com>
Sender: nntp@news.boeing.com (Boeing NNTP News Access)
Content-Transfer-Encoding: 7bit
Organization: The Boeing Company
X-Accept-Language: en
References: <9sookc$d83$1@neptunium.btinternet.com>
Mime-Version: 1.0
Date: Mon, 12 Nov 2001 17:37:30 GMT
X-Mailer: Mozilla 4.73 [en]C-CCK-MCD Boeing Kit  (WinNT; U)
Xref: archiver1.google.com comp.lang.ada:16348
Date: 2001-11-12T17:37:30+00:00
List-Id: <comp.lang.ada>

Tony Gair wrote:
> 
> Does anyone know of  reasonably fast data structure to store a large amount
> of records.

It would help if you provided more information about what precisely you
want. PragmARC.Queue_Bounded is fast, non-pointer, and a data structure,
but since you're using an AVL tree I doubt that it does what you want.

Balanced tree structures tend to be slow for insertion and deletion, but
fast [O(log N)] for searching. You might be interested in a skip list.
Skip lists are approximately O(log N) for searching, and O(1) for
insertion and deletion; I do not understand why people continue to use
balanced trees given the existence of skip lists. See
PragmARC.Skip_List_Unbounded for an implementation of a skip list.

It should be reasonably simple to implement a bounded skip list, just as
it is to implement a bounded list.

-- 
Jeffrey Carter