一种有效的空间数据仓库区域聚集查询索引结构  

An Efficient Indexing Scheme for Range Aggregate Queries in Spatial Data Warehouse

作　　者：陈细谦[1] 王占昌[2] 曹秀坤[2] 迟忠先[2] 

机构地区：[1]北京大学博士后流动站 [2]大连理工大学计算机科学与工程系,大连116024

出　　处：《计算机研究与发展》2006年第1期75-80,共6页Journal of Computer Research and Development

基　　金：中国博士后基金资助项目(2004035549)

摘　　要：空间数据仓库有效地支持对空间数据的管理和分析,提供更加全面的决策支持·讨论了一种有效的空间决策支持手段———空间区域聚集查询的实现·基于aggregate cubetree和aR-tree提出了一个可以有效地在空间维和非空间维上进行区域聚集查询的索引结构aCR-tree及其相关算法,并计算分析了查询算法的时间复杂度·与现有技术相比aCR-tree降低了存储代价和每次查询访问的节点数,通过实验证明,该索引结构可以提供较好的存储性能和查询性能·Spatial data warehouse provides efficient analysis environment for both spatial data and non-spatial data, which can satisfy the urgent need for embedding spatial data into decision support system. The range aggregate query on both non-spatial dimensions and spatial dimensions is a very important operation to support spatial on-line analytical processing （OLAP） . To optimize the operation, an indexing scheme named aCR-tree and its corresponding algorithms with asymptotical performance analysis are proposed based on aggregate cubetree and aR-tree. Using both synthetic and real enterprise data, experiments are conducted to demonstrate storage overhead and range aggregate query performance of the indexing scheme. The analytical and experimental results show that the costs of range aggregate queries and the storage space of aCR-tree are superior to that of the traditional storage structures.

关 键 词：空间数据仓库 区域聚集查询 空间联机分析 

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