作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2008, Vol. 34 ›› Issue (12): 50-51. doi: 10.3969/j.issn.1000-3428.2008.12.017

• 软件技术与数据 • 上一篇    下一篇

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

朱 亮1, 2,刘椿年2   

  1. (1. 河北大学数学与计算机学院,保定 071002;2. 北京工业大学计算机学院,北京 100022)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-06-20 发布日期:2008-06-20

Query Stream Processing Based on Region Clustering

ZHU Liang1, 2, LIU Chun-nian2   

  1. (1. School of Mathematics and Computer Science, Hebei University, Baoding 071002; 2. College of Computer, Beijing University of Technology, Beijing 100022 )
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-06-20 Published:2008-06-20

摘要: 提出一种处理区域查询流的新方法。选择并保存一些处理后的查询,将其进行区域聚类,构成较大的区域并检索和保存其元组。对新的查询,尽量使用内存中的元组,以减少对数据库I/O操作次数,进而加快查询速度。该方法对低维和高维数据都有效,实验证明该方法与朴素方法相比,其性能更高。

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

Abstract: 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.

Key words: relational database, range query stream, region clustering

中图分类号: