一种面向空间数据的聚集查询处理方法  

Towards Processing Aggregate Queries upon Spatial Data

作　　者：金澈清[1] 赵福通[1] 郭卫斌[1] 

机构地区：[1]华东理工大学计算机科学与工程系,上海200237

出　　处：《华东理工大学学报（自然科学版）》2009年第1期107-111,共5页Journal of East China University of Science and Technology

基　　金：国家自然科学基金项目(60803020);上海市曙光计划(07SG32)

摘　　要：提出一种新的面向空间数据的聚集查询处理方法。该方法扩展了AMH和AMH*方法,首先将整个空间栅格化,再将若干频数接近的邻居栅格组合成遵循一定约束条件的桶。随着数据分布变化,各桶不断重组或者拆分,具有空间复杂度低、查询精度高等特点。理论分析与实验结果均表明新方法优于现有方法。This paper presents a novel method for processing aggregate queries upon spatial data. Oriented from AMH and AMH^＋ , the proposed method initially separates the whole space into some basic cells, following which cells are organized into a small number of buckets with specific constraints. With the change of the data distribution, buckets are merged into larger ones or divided into several smaller ones. Based on such summarized information affiliated with buckets, the processing can be made quickly and easily. Both theoretical analysis and experimental results show that the proposed method outperforms previous methods in both the space consumption and the quality.

关 键 词：聚集查询 空间数据 近似查询 直方图 桶 

分 类 号：TP311.131[自动化与计算机技术—计算机软件与理论]