Using distributed query result caching to evaluate queries for parallel data mining algorithms

被引：0

作者：

Taylor, MG ^{[1
]}

Stoffel, K ^{[1
]}

Hendler, JA ^{[1
]}

Saltz, J ^{[1
]}

机构：

[1] Univ Maryland, Dept Comp Sci, College Pk, MD 20742 USA

来源：

INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-IV, PROCEEDINGS | 1998年

关键词：

parallel; query caching; discriminant rules;

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

An increase in the speed of data mining algorithms can be achieved by improving the efficiency of the underlying technologies. Query engines are key components ill many knowledge discovery systems and the appropriate use of query engines can impact the performance of data mining algorithms. By laking advantage of hypothesis generation patterns, queries, generated from the hypotheses, call be evaluated more efficiently. Caching query results and using the cached results to evaluate new queries with similar constraints reduces the complexity of query evaluation and improves the performance of data mining algorithms. In a multi-processor environment, distributing the query result caches can improve the performance of parallel query evaluations. This Idea has been used in the ParDRI system and has resulted in significant improvements in the execution times of ParDRI.

引用

页码：1127 / 1132

页数：6