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,FREEMAIL_FROM
	autolearn=unavailable autolearn_force=no version=3.4.4
X-Received: by 10.224.13.136 with SMTP id c8mr15778953qaa.0.1377964021552;
 Sat, 31 Aug 2013 08:47:01 -0700 (PDT)
X-Received: by 10.49.104.148 with SMTP id ge20mr552488qeb.2.1377964021539;
 Sat, 31 Aug 2013 08:47:01 -0700 (PDT)
Path: 
 border1.nntp.dca3.giganews.com!border3.nntp.dca.giganews.com!border1.nntp.dca.giganews.com!border4.nntp.dca.giganews.com!border2.nntp.dca.giganews.com!nntp.giganews.com!q10no2295400qai.0!news-out.google.com!p7ni0qas.0!nntp.google.com!fx3no6325412qab.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail
Newsgroups: comp.lang.ada
Date: Sat, 31 Aug 2013 08:47:01 -0700 (PDT)
In-Reply-To: <cc680b29-51d8-4fea-ab7d-e893aa5064e5@googlegroups.com>
Complaints-To: groups-abuse@google.com
Injection-Info: glegroupsg2000goo.googlegroups.com;
 posting-host=105.236.92.204;
 posting-account=p-xPhAkAAADjHQWEO7sFME2XBdF1P_2H
NNTP-Posting-Host: 105.236.92.204
References: <9fc26b8a-7a5c-4941-81cb-8f0e9c17a660@googlegroups.com>
 <cc680b29-51d8-4fea-ab7d-e893aa5064e5@googlegroups.com>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <ec0c8433-fe61-482b-9b30-59c4eafbc23e@googlegroups.com>
Subject: Re: B-tree performance
From: Peter Brooks <peter.h.m.brooks@gmail.com>
Injection-Date: Sat, 31 Aug 2013 15:47:01 +0000
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable
X-Original-Bytes: 1879
Xref: number.nntp.dca.giganews.com comp.lang.ada:183245
Date: 2013-08-31T08:47:01-07:00
List-Id: <comp.lang.ada>

On Saturday, 31 August 2013 17:26:41 UTC+2, Shark8  wrote:
> I think that the correct optimization here would be highly dependent on t=
he information you're dealing with. If, for example, you're handling a dict=
ionary or phone-book, you could index off of the first letter [or two] and =
use that as your starting-range's endpoint.
>
Yes, that's true.

I'll be working with the hash codes of RDF URIs, which should be uniformly =
dense - well, actually, they will be because I'll be experimenting with has=
h functions to find one that is.

I suppose that I'll just have to try a few options an time the result.