基于区域聚类的查询流处理  

Query Stream Processing Based on Region Clustering

作　　者：朱亮[1] 刘椿年[2] 

机构地区：[1]河北大学数学与计算机学院,保定071002 [2]北京工业大学计算机学院,北京100022

出　　处：《计算机工程》2008年第12期50-51,55,共3页Computer Engineering

基　　金：国家自然科学基金资助重大项目“非规范知识处理的基础理论与核心技术研究”(60496322,60496327)

摘　　要：提出一种处理区域查询流的新方法。选择并保存一些处理后的查询,将其进行区域聚类,构成较大的区域并检索和保存其元组。对新的查询,尽量使用内存中的元组,以减少对数据库I/O操作次数,进而加快查询速度。该方法对低维和高维数据都有效,实验证明该方法与朴素方法相比,其性能更高。This paper proposes a new method,named range query stream method.The basic idea of this method is region clustering that groups the search regions of past queries into larger regions and retrieves the tuples from the larger regions.To answer a newly submitted query,it makes the most of the tuples in main memory.Thus,this method seeks to minimize the response time by avoiding and reducing the number of I/O accesses to the underlying database.It does not suffer the much feared ＂dimensionality curse＂ as this method remains effective for high-dimensional data.Extensive experiments are carried out to measure the performance of this new strategy and the results indicate that it is significantly better than the na？ve method of evaluating these queries for both low-dimensional and high-dimensional data.

关 键 词：关系数据库 区域查询流 区域聚类 

分 类 号：TP391.72[自动化与计算机技术—计算机应用技术]