RE: LDAP v. RDBMS for large datasets

["Arnold Shore" <ashore@dgs.dgsys.com>]

Since "... Touchy-feely answers are fine ..."

The huge business investment in relational databases justifies, I would
expect, investment by MS, Oracle, IBM in their performance.  Performance is
a real concern for them from a pure business perspective, and it's a 'jungle
out there'; see the stuff reported at www.tpc.org

For sheer performance, I'd expect to lean towards RDBMS's.

Arnold Shore
Annapolis, MD USA

-----Original Message-----
From: owner-openldap-general@OpenLDAP.org
[mailto:owner-openldap-general@OpenLDAP.org]On Behalf Of Paul Makepeace
Sent: Wednesday, May 31, 2000 10:29 PM
To: openldap-general@OpenLDAP.org
Subject: LDAP v. RDBMS for large datasets


I'm curious whether anyone has any opinion/evidence of whether a
fixed-length
query match "SELECT uid=xxx" would be quicker (generally, or in specific
cases) versus (uid=xxx) for large ranges of xxx, in the hundreds of
millions.
No other properties of either SQL or LDAP search filters are required.
Assume
LDAP-friendly high read:write ratio, no transactions, etc.

Sorry to be this vague, I'm really just after ball-park estimates, i.e one
is
drastically quicker than the other or they're about the same or perhaps even
odd-OS/platform specific situations. Touchy-feely answers are fine :-)

Thanks,
Paul


--
Paul.Makepeace@realprogrammers.com
Thus spake the Master Programmer:
  "Let the programmers be many and the managers few --
    then all will
      be productive." (http://misspiggy.gsfc.nasa.gov/tao.html)