Path: utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!tut.cis.ohio-state.edu!ucbvax!UCLAMVS.BITNET!CSYSMAS
From: CSYSMAS@UCLAMVS.BITNET (Michael Stein)
Newsgroups: comp.lang.asm370
Subject: (none)
Message-ID: <8906012320.AA26287@jade.berkeley.edu>
Date: 1 Jun 89 22:57:00 GMT
Sender: daemon@ucbvax.BERKELEY.EDU
Reply-To: IBM 370 Assembly Programming Discussion List <ASM370%UCF1VM.bitnet@jade.berkeley.edu>
Distribution: inet
Organization: The Internet
Lines: 6

> I am looking to improve a routine that searches through core tables up to
> 2M in size (each element is 12-20 bytes depending on application).

What about a hash lookup?  If your 2M table is in virtual memory
and you don't need to reference all of it, a hash lookup will
be MUCH faster (depending on how many pages you touch).