9 Jun 01:10
Re: xmltree and mdb
kristian kvilekval <kris <at> cs.ucsb.edu>
2005-06-08 23:10:36 GMT
2005-06-08 23:10:36 GMT
I've updated my archive with a some new search stuff which takes care of the problem outlined below. Combined with the patches from dave's archive the browser seems downright speedy. On Mon, 2005-05-23 at 14:24 -0700, kristian kvilekval wrote: > Yes, I see your point.. I didn't try it on directories. > > We need a way to know that the cache is incomplete and > therefore other sources should be searched again for > the incomplete tags. The cache should also be a union > of queries instead of simply a cache of the last query. > > I had thought of time stamping the keys. The first time > a key is searched on the timestamp would be 0, and after that > the timestamp would come from the winning metadata source. > However, I didn't want to add the complexity. Another > way would be to allow searches based on the original algorithm: > look at all the sources until the set of keys is fulfilled > combined with a good default meta datasource (fill all unknown keys > with a default value). > > I'll look into it. > > > On Mon, 2005-05-23 at 21:57 +0100, David Hough wrote: > > On Fri, 20 May 2005 20:58:38 +0100, kristian kvilekval <kris <at> cs.ucsb.edu> > > wrote: > > >(Continue reading)
RSS Feed