Just a question about Michael's interesting post about the relative performance of QofQ's vs. turning queries into lists, structures, etc. and cacheing them...
It looks from the post that you're talking about doing searches on single columns of data. What about matching 2 columns? Example: I have a list of IPs that are banned from certain areas of the site. Obviously this needs to be cached to be checked on every request. Currently I'm caching a query that gets all banned IP infos, then do a QofQ to see if current IP is banned from current area. Would the "fastest" solution proposed - turning query into structure, cacheing structure (presumably in application scope) and searching structure - still work for this type of thing. I can't think offhand how you'd do the equivalent of WHERE area = '#request.area#' with a structure of structures, but I guess it's possible. Does it still measure up against QofQ's even though you're not just doing a simple search for one value with StructKeyExists()? cheers, Gyrus [EMAIL PROTECTED] play: http://norlonto.net/ work: http://tengai.co.uk/ PGP key available ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~| Archives: http://www.houseoffusion.com/lists.cfm?link=t:4 Subscription: http://www.houseoffusion.com/lists.cfm?link=s:4 Unsubscribe: http://www.houseoffusion.com/cf_lists/unsubscribe.cfm?user=89.70.4 This list and all House of Fusion resources hosted by CFHosting.com. The place for dependable ColdFusion Hosting. http://www.cfhosting.com
