Re: Ultra fast db access & searching?

Aerodyne wrote: 
Hi all,

Could some one help me out with this Q?

If I designed a db (MySQL or PostgreSQL) & it contained more than 5+
million users with all unique user names... how can I speed up db
access ...etc to search a new users name if it has already been taken?

All hints & tips welcome (plus good db books on this matter & some)...

The reason I ask is to know how sites like hotmail, gmail, ebay ...etc
all do it so quickly!  But I'd prefer to use either MySQL or
PostgreSQL.


TIA

Out side of a user name as the primary key or just indexed don't now. You should look at the 100 percent java database called HSQLDB. I moved away from MySQL to this DBMS.

Performance wise it runs rings around MySQL, PostgreSQL and most all of the other dbms's.. Its has a small footprint. You can run it as embedded, standalone or server. It was just ranked third as a enterprise databases after Oracle and DB2. All that info is at http://hsqldb.org/

If you want something even faster they have a commercial version called HXSQL. They have all of the performance information there at http://www.hxsql.com/

--


Thanks in Advance...
IchBin, Pocono Lake, Pa, USA http://weconsultants.servebeer.com/JHackerAppManager
__________________________________________________________________________

'If there is one, Knowledge is the "Fountain of Youth"'
-William E. Taylor,  Regular Guy (1952-)
.