On Mon, 25 Oct 2004, Muthukumar wrote:
> I heard Performance and parsing time using db based are fast. Can we
> adopt db based filter rules parsing on squid-2.5 series without using
> any redirectors there. How the squid-3.0 adaptation will be differed
> from now?
The difference is the parsing time. The lookup time is the same. When
using a db based filter parsing is done when building the db, when using a
flat file parsing is done when reading the configuration.
lookup time is determined mainly by the type of acl, not how it is stored.
> Can you prefer, how we can know filter rules parsing with flat files or
> db based conceptually? We are on-going with source files of squid's *cf*
> .c and .h files. We are on the analysis to improve squid filter rules
> parsing and filter adapation.
squid only have the flat file approach to acl specifications, parsing the
whole acl each time the configuration file is read, storing the parsed
result in memory for optimal lookup time. It should be noted that when the
acl is parsed it is no longer a flat file but using other structures
(depending on the acl type).
squidGuard have the option to select db based or flat file. As said
earlier the lookup performance is identical, but the startup performance
(parsing) is significantly different for very large lists.
Regards
Henrik
Received on Mon Oct 25 2004 - 03:24:37 MDT
This archive was generated by hypermail pre-2.1.9 : Mon Nov 01 2004 - 12:00:02 MST