作　　者： ; ; ;

机构地区： 华南理工大学计算机科学与工程学院

出　　处： 《计算机应用研究》 2008年第12期3605-3609,共5页

摘　　要： 查询处理是语义缓存的一个关键问题,但是现有的查询处理算法在时空效率和裁剪结果的复杂度两个方面存在很大的局限性,这在一定程度上限制了语义缓存的实用性。为了克服这些缺陷,本文对语义缓存的裁剪过程进行优化处理,减少了对服务器的无效访问,并给出了生成探测查询和剩余查询的裁剪算法;算法分析从理论上证明了该优化机制的有效性,同时,仿真实验的性能比较也表明该优化方法在提高查询裁剪时空效率和降低剩余查询复杂度等方面均要明显优于没有优化的方法。 Query processing is a key problem in semantic caching. However,there are some deficiencies in the algorithms of the existent query processing, such as low efficiency of time and space as well as the complexity of the trimming resuh, which restricts the application of semantic caching. For overcoming the limitations, this paper developed a new method, which optimized the query trimming and invalid accessing to database, then gave the trimming algorithm of the probe query and the remainder query. Finally, the performance analysis of simulation experiment also indicatesthat the optimization technology is excellent more better than the non-optimization query trimming in improving the efficiency of time and space and reducing the complexity of trimming result.

关 键 词： 语义缓存 查询处理 查询裁剪 优化

领　　域： [自动化与计算机技术] [自动化与计算机技术]