in reply to
Re: Re: Database searches with persistent results via CGI
in thread Database searches with persistent results via CGI
This of course is great under certain circumstances. One master table to store the most recent searches, with a value of last searched time, replacing them in LRU fashion is a good solution for this. Each of the records in this table would then point to a results table that would be used as a cache. This would speed things wonderfully for the best case.
However, if there is a high rate of insertion into the database, there needs to be a reasonably short timeout
on the cache so that a search includes all or nearly
all of the matches a fresh search would generate. There
are ways around this, too, of course.
If one keeps a table of recent insertions, such as the last 50, 500, 5000, or whatever number makes sense, then one can
add those to the search easily enough if they match. One could also be more picky and redo the search if the search was done before the oldest of the rows in one's recent insertions table. This shouldn't require any changes to existing tables, and that's a Good Thing(tm).
On a similar note, if one keeps with one's cached results table or with the table listing search strings the range over which the last search was made, and can prepare a new search to cover only any additional rows, then that is a major Win(sm). This also shouldn't require changes to
Christopher E. Stith
Do not try to debug the program, for that is impossible. Instead, try only to relaize the truth. There is no bug.
Then you will find that it is not the program that bends, but only the list of features.