Perfomance & large database

Hi,

I have to build a 'high' performance database konwing that the requests will always be of the same type : find an address given an ID. This is the ONLY resquest performed but on a very large database. Since I'm working under linux, I've thought of creating my own structure to store the data, such as using a full disk and accessing only a part of it from an address found in a hash table. Since the disk can be seen as a file, it should work well (?).
The problem is that I fear this system might not be as performant as a standard database system (well optimised) . . .

Can someone advice me about which database would be the best to answer always the same kind of very simple request ??? Is the system I've thought of not too optimistic ???

Thanks

David Quere Received on Fri Apr 20 2001 - 10:39:46 CDT