基于维层次性的Data Cube存储优化方法

根据Data Cube模式中维的层次性,提出了层次式B^＋树及维层次编码的概念,并应用于层次树形Cube（HT Cube）方法中．HT Cube将维划分为聚集维与分析维,在分析维上利用层次式B^＋树除去了冗余数据,并在查询过程中形成维层次编码,在聚集维上则利用维层次编码组合而成的分析维编码进行索引,从而可以高效地检索到聚集值．理论分析和实验证明,该方法不但节省了存储空间,而且可利用层次信息高效地进行各种OLAP查询,为Data Cube模式更新、OLAP查询导航和OLAP查询行为分析的实现提供了可能．     

数据空间化的决策支持框架

提数据空间化的决策支持框架,使之能够有效地将空间数据仓库,空间联机分析处理（OLAP）,空间数据采掘和空间联机分析采掘（OLAM）技术融为一体,以提供对具有空间分布特性信息的管理,查询和分析的能力。     

数据空间化的决策支持框架

提出了数据空间化的决策支持框架,使之能够有效地将空间数据仓库、空间联机分析处理(OLAP)、空间数据采掘和空间联机分析采掘(OLAM)技术融为一体,以提供对具有空间分布特性信息的管理、查询和分析的能力．     

GICDBS:一种支持动态图结构数据更新的索引方式

提出一种基于CDBS编码的索引方式-GICDBS,并详细阐述了其对图结构数据动态更新的支持.实验证明,GICDBS索引结构不仅可以实现线性的可达性查询时间效率和索引空间复杂度,而且能够有效地支持数据的动态更新.     

一种高效的空间索引结构

为高效地处理空间数据，必须对数据库建立索引机制以快速存取数据。然而，由于空间数据的特殊性使得传统索引方法不能很好地适应空间数据的存取。介绍了一种目前较流行的索引结构－R树及其主要算法。在所研究的空间分析数据库系统SADBS中实现了R树索引。     

基于双树双索引结构的移动查询方法

为实现对有限范围内海量移动对象的有效索引,构建通用的移动查询解决方案,针对移动对象在道路网格中的运动特点,提出了预测实时运动速度的速度积累模型和预测未来聚集位置的基于双树双索引结构的移动对象查询方法.双树双索引结构利用网格划分思想构建空间分割树,实现对现有GG TPR-tree查询结构的拓展,并结合GG TPR-tree索引及建立于内存中的Hash索引以满足各种类型的移动查询请求.仿真实验表明,在回答受限范围内海量移动对象的确定性查询和统计性查询时,与传统方法相比,双树双索引结构在查询结果准确率方面有明显的改善.     

GIS实体——关系数据模型的发展

介绍了地理信息系统的四种数据模型(传统的地理—关系数据模型、空间实体模型+空间索引数据模型、空间数据与关系数据库集成的数据模型以及空间数据与面向对象技术集成的数据模型)的结构特点和实现方法,并对空间数据与关系数据库集成的数据模型以及空间数据与面向对象技术集成的数据模型的最新进展和发展趋势作了分析。     

基于LevelDB的二维数据二级索引实现

随着科学研究中产生的空间数据尤其是二维数据量级的增长和NoSQL型数据库技术的发展,越来越多的空间数据被存储到NoSQL数据库中.LevelDB是一款开源的Key-Value型NoSQL数据库,由于它基于LSM架构并拥有较好的写入性能而被广泛应用.但是Key-Value结构的局限性使其无法有效地索引空间数据,对于这个问题本文提出了一种基于LevelDB和R-tree的二级索引,使其可以支持二维数据的索引和近邻查询.实验结果表明该结构有较好的可用性.     

QGrid:一种空间移动对象并行索引结构

为提高空间移动对象数据更新效率和查询准确率,提出了一种空间移动对象并行索引结构.利用主索引和辅助索引支持对空间对象进行基于范围的查询和基于对象标识的查询,还通过查询索引将更新操作和可能受其影响的查询操作相连接,在满足并行操作时间片语义的同时,避免了传统方法进行范围查询时对查询范围内相关对象及相关索引结构全部进行锁定的需求.实验结果表明:高负载环境下,该索引结构不但能保证查询准确率,其处理能力也明显优于传统索引结构.该索引通过提高系统并行度,使同一范围内的更新和查询操作可以并行执行,提升了系统整体运行效率.     

R-树聚集在空间数据仓库中的应用

 空间数据库存储空间对象的相关信息,在很多实际应用中需要汇总空间数据,但这种汇总非常耗费时间而且计算代价很高.受非空间数据仓库的启发,可以建立空间数据仓库来加速空间OLAP操作.考虑星型模式且着重于空间维的概念分层,这种分层主要根据空间R-树索引来建立.提出了一个空间查询算法,并考虑了数据更新.     

A spatial entropy reflecting distribution of spatial objects

Decision trees are mainly used to classify data and predict data classes. A spatial decision tree has been designed using Euclidean distance between objects for reflecting spatial data characteristic. Even though this method explains the distance of objects in spatial dimension, it fails to represent distributions of spatial data and their relationships. But distributions of spatial data and relationships with their neighborhoods are very important in real world. This paper proposes decision tree based on spatial entropy that represents distributions of spatial data with dispersion and dissimilarity. The rate of dispersion by dissimilarity presents how related distribution of spatial data and nonspatial attributes. The experiment evaluates the accuracy and building time of decision tree as compared to previous methods and it shows that the proposed method makes efficient and scalable classification for spatial decision support.     

A spatial entropy reflecting distribution of spatial objects

Decision trees are mainly used to classify data and predict data classes. A spatial decision tree has been designed using Euclidean distance between objects for reflecting spatial data characteristic. Even though this method explains the distance of objects in spatial dimension, it fails to represent distributions of spatial data and their relationships. But distributions of spatial data and relationships with their neighborhoods are very important in real world. This paper proposes decision tree based on spatial entropy that represents distributions of spatial data with dispersion and dissimilarity. The rate of dispersion by dissimilarity presents how related distribution of spatial data and non-spatial attributes. The experiment evaluates the accuracy and building time of decision tree as compared to previous methods and it shows that the proposed method makes efficient and scalable classification for spatial decision support.     

Spatial aggregations for spatial based decision 

For spatial based decision making such as choice of best place to construct a new department store, spatial data warehousing system is required more and more previous spatial data warehousing systems; however, provided decision making of nonspatial data on a map and so those cannot support enough spatial based decision making. The spatial aggregations are proposed for spatial based decision making in spatial data warehouses. The meaning of aggregation operators for applying spatial data was modified and new spatial aggregations were defined. These aggregations can support hierarchical concept of spatial measure. Using these aggregations, the spatial analysis classified by nonspatial data is provided. In case study, how to use these aggregations and how to support spatial based decision making are shown.     

Spatial aggregations for spatial based decision making in spatial data warehouses

For spatial based decision making such as choice of best place to construct a new department store, spatial data warehousing system is required more and more previous spatial data warehousing systems; however, provided decision making of non-spatial data on a map and so those cannot support enough spatial based decision making. The spatial aggregations are proposed for spatial based decision making in spatial data warehouses. The meaning of aggregation operators for applying spatial data was modified and new spatial aggregations were defined. These aggregations can support hierarchical concept of spatial measure. Using these aggregations, the spatial analysis classified by non-spatial data is provided. In case study, how to use these aggregations and how to support spatial based decision making are shown.     

A Voronoi-based spatial algebra for spatial relations

Spatial relation between spatial objects is a very important topic for spatial reasoning, query and analysis in geographical information systems (GIS). The most popular models in current use have fundamental deficiencies in theory. In this paper, a generic algebra for spatial relations is presented, in which (i) appropriate operators from set operators (i.e. union, intersection, difference, difference by, symmetric difference, etc.) are utilized to distinguish the spatial relations between neighboring spatial objects; (ii) three types of values are used for the computational results of set operations-content, dimension and number of connected components; and (iii) a spatial object is treated as a whole but the Voronoi region of an object is employed to enhance its interaction with its neighbours. This algebra overcomes the shortcomings of the existing models and it can effectively describe the relations of spatial objects.     

空间数据集成研究--以空间数据仓库的构建为例

随着空间数据复杂性的增加,现有的空间数据库和空间分析工具已经不能提供足够的决策支持,迫切需要建立大量具有历史数据,以及不同尺度的空间数据仓库．在建设空间数据仓库的过程中,数据集成是一个重要的环节,专门针对空问数据的集成更是一项艰巨的工作,本文在研究了现有的空间数据库,空间数据仓库以及空间数据集成的基础上,首先探讨了空间数据仓库模型的建立过程,然后系统提出了面向空间数据仓库数据模型的数据集成的两个主要的方面：不同数据源的空间数据的集成;不同尺度维上的空间数据的集成.     

A solution of spatial query processing and query optimization for spatial databases

Recently, attention has been focused on spatial query language which is used to query spatial databases. A design of spatial query language has been presented in this paper by extending the standard relational database query language SQL. It recognizes the significantly different requirements of spatial data handling and overcomes the inherent problems of the application of conventional database query languages. This design is based on an extended spatial data model, including the spatial data types and the spatial operators on them. The processing and optimization of spatial queries have also been discussed in this design. In the end, an implementation of this design is given in a spatial query subsystem.     

A solution of spatial query processing and query optimization for spatial databases

Recently,attention has been focused on spatial query language which is used to query spatial databases. A design of spatial query language has been presented in this paper by extending the standard relational database query language SQL. It recognizes the significantly different requirements of spatial data handling and overcomes the inherent problems of the application of conventional database query languages. This design is based on an extended spatial data model,including the spatial data types and the spatial operators on them. The processing and optimization of spatial queries have also been discussed in this design. In the end,an implementation of this design is given in a spatial query subsystem.     

空间面板滞后模型的权重选取方式探究

通过最大化空间滞后项与残差的相关系数,提出了空间面板滞后模型中权重矩阵的选取方法,并与2SLSCWB方法进行了对比,模拟和实例表明该方法效果很好.     

企业空间数据仓库的构建方法

在现有企业数据仓库多维模型的基础上,结合空间数据的特性和不同决策处理需求,提出了3种构建企业空间数据仓库的方法. 通过原型系统的验证,说明这些方法是有效可行的.