From: johnadams (johnadams@apple.com)
Date: Mon Nov 03 2003 - 13:30:12 EST
On Saturday, November 1, 2003, at 08:58 PM, Rob Shein wrote:
>
> Regarding questions 1 and 2:
>
> I'm not hugely familiar with the problem that LEAP has, but looking at
> this
> challenge from a logistical standpoint, I would say that you'd be far
> better
> off with a database containing the dictionary than a flat file, for
> performance reasons.
Not that I've been following this discussion that closely, but since
when do databases perform faster than
flat files on read?
If he was performing searches against data, sure, the database would be
faster because it could take advantage of search algorithms, but even
then data stored (sorted) in a binary-tree flat file would crush the
database in terms of raw performance time because it wouldn't have deal
with database overhead.
-john
---------------------------------------------------------------------------
Network with over 10,000 of the brightest minds in information security
at the largest, most highly-anticipated industry event of the year.
Don't miss RSA Conference 2004! Choose from over 200 class sessions and
see demos from more than 250 industry vendors. If your job touches
security, you need to be here. Learn more or register at
http://www.securityfocus.com/sponsor/RSA_pen-test_031023
and use priority code SF4.
----------------------------------------------------------------------------
This archive was generated by hypermail 2.1.7 : Sat Apr 12 2008 - 10:53:42 EDT