A solution for digital image management in spatial databases

Digital Orthographic Map (DOM) can be used in various applications because it contains both image features and terrain information. Spatial database management systems aim at the effective and efficient management of data related to a space,engineering design and so on. Thereby spatial database provides an efficient solution for managing DOM. According to large amounts of the DOM data in storage, a data compression based on wavelet is introduced into the storage. Another strategy to solve this problem is to decompose the raw image into tiles and store the tiles individually as separate tuples. The metadata of DOM can be used to organize and manage spatial information,especially for spatial data sharing and fast locating. A tool for browsing, zooming and querying the DOM data is also designed. We implemented these ideas in SISP (Spatial Information Sharing System) and applied the subsystem into the DOM management of Beijing City, which is an component of the Beijing Spatial Information Infrastructure.     

A solutiong for digital image management in spatial databases

Digital Orthographic Map (DOM) can be used in various applications because it contains both image features and terrain information. Spatial database management systems aim at the effective and efficient management of data related to a space，engineering design and so on. Thereby spatial database provides an efficient solution for managing DOM. According to large amounts of the DOM data in storage，a data compression based on wavelet is introduced into the storage. Another strategy to solve this problem is to decompose the raw image into tiles and store the tiles individually as separate tuples. The metadata of DOM can be used to organize and manage spatial information， especially for spatial data sharing and fast locating. A tool for browsing， zooming and querying the DOM data is also designed. We implemented these ideas in SISP (Spatial Information Sharing System) and applied te subsystem into te DOM management of Beijing City，which is an component of the Beijing Spatial Information Infrastructure.     

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.     

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.     

Processing Constrained K Closest Pairs Query in Spatial Databases

In this paper, constrained K closest pairs query is introduced, wbich retrieves the K closest pairs satisfying the given spatial constraint from two datasets. For data sets indexed by R trees in spatial databases, three algorithms are presented for answering this kind of query. Among of them, two-phase Range＋Join and Join＋Range algorithms adopt the strategy that changes the execution order of range and closest pairs queries, and constrained heap-based algorithm utilizes extended distance functions to prune search space and minimize the pruning distance. Experimental results show that constrained heap-base algorithm has better applicability and performance than two-phase algorithms.     

Version based spatial record management techniques for spatial database management system

The search operation of spatial data was a principal operation in existent spatial database management system，but the update operation of spatial data such as tracking are occurring frequently in the spatial database management system recently. So，necessity of concurrency improvement among transactions is increasing. In general database management system，many techniques have been studied to solve concurrency problem of transaction. Among them，multi-version algorithm does to minimize interference among transactions. However，to apply existent multi-version algorithm to improve concurrency of transaction to spatial database management system， the waste of storage happens because it must store entire version for spatial record even if only aspatial data of spatial record is changed. This paper has proposed the record management techniques to manage separating aspatial data version and spatial data version to decrease waste of storage for record version and improve concurrency among transactions.     

Version based spatial record management techniques for spatial database management system

The search operation of spatial data was a principal operation in existent spatial database management system, but the update operation of spatial data such as tracking are occurring frequently in the spatial database management system recently. So, necessity of concurrency improvement among transactions is increasing. In general database management system, many techniques have been studied to solve concurrency problem of transaction. Among them, multi-version algorithm does to minimize interference among transactions. However, to apply existent multi-version algorithm to improve concurrency of transaction to spatial database management system, the waste of storage happens because it must store entire version for spatial record even if only aspatial data of spatial record is changed. This paper has proposed the record management techniques to manage separating aspatial data version and spatial data version to decrease waste of storage for record version and improve concurrency among transactions.     

Version based spatial record management techniques for spatial database management system

The search operation of spatial data was a principal operation in existent spatial database management system, but the update operation of spatial data such as tracking are occurring frequently in the spatial database management system recently. So, necessity of concurrency improvement among transactions is increasing. In general database management system, many techniques have been studied to solve concurrency problem of transaction. Among them, multi-version algorithm does to minimize interference among transactions. However, to apply existent multi-version algorithm to improve concurrency of transaction to spatial database management system, the waste of storage happens because it must store entire version for spatial record even if only aspatial data of spatial record is changed. This paper has proposed the record management techniques to managese parating aspatial data version and spatial data version to decrease waste of storage for record version and improve concurrency among transactions.     

A shortest path algorithm for moving objects in spatial network databases

One of the most important kinds of queries in Spatial Network Databases （SNDB） to support location-based services （LBS） is the shortest path query. Given an object in a network, e.g. a location of a car on a road network, and a set of objects of interests, e.g. hotels, gas station, and car, the shortest path query returns the shortest path from the query object to interested objects. The studies of shortest path query have two kinds of ways, online processing and preprocessing. The studies of preprocessing suppose that the interest objects are static. This paper proposes a shortest path algorithm with a set of index structures to support the situation of moving objects. This algorithm can transform a dynamic problem to a static problem. In this paper we focus on road networks. However, our algorithms do not use any domain specific information, and therefore can be applied to any network, This algorithm＇s complexity is O（klog2i）, and traditional Diikstra＇s comolexitv is O（（i ＋ k）^2）.     

分布式多空间数据库复杂时态数据提取技术

传统方法实现过程复杂、历史复杂时态数据的片面性,导致其无法全面地描述时态数据;且相似性计算无法准确匹配具有动态性与复杂性的时态数据,造成提取精度低。为此,提出一种新的分布式多空间数据库复杂时态数据提取技术。设计动态RBF神经网络,对分布式多空间数据库中未知动态进行识别和建模;通过建模结果完成对复杂时态数据的描述。依据加权关联规则与时态关联规则对支持度和置信度的定义,获取T-FS-tree加权时态关联规则中支持度和置信度。将复杂时态数据描述序列、最小支持度、最小置信度作为输入,将加权时态关联规则作为输出,建立T-FS-tree加权时态关联规则挖掘算法。按照向量计算获取加权时态频繁1项集以及频繁2项集,依据获取的加权时态频繁项集建立初始频繁项集树;依据初始频繁项集树获取全部时态频繁项集;通过获取的频繁项集产生加权时态关联规则。从所有关联规则中选择优先度高的规则,构建的复杂时态数据提取器,实现复杂时态数据提取。实验结果表明,所提方法复杂性低,提取结果更加全面、可靠,有很高的准确性。     

A solution for concurrency control and long transaction management in SDBMS

The problem of long transactions is a significant problem in spatial database. The checkout mechanism and multi-version mechanism are two kind methods of solving the problem of long transactions. In this paper, we present a Shallow Version Management mechanism to realize multi-version mechanism in spatial database. And we introduced a increment storage and dynamic version views building method to improve efficiency of storing and consulting. We also illuminate how to resolve the problem of long transaction concurrency control in spatial database by using multi-version mechanism. At the end of this paper, we introduce some required means to version management in spatial database, like converge, compress and delete.     

A solution for concurrency control and long transaction management in SDBMS

The problem of long transactions is a significant problem in spatial database. The checkout mechanism and multi-version mechanism are two kind methods of solving the problem of long transactions. In this paper,we present a Shallow Version Management mechanism to realize multi-version mechanism in spatial database. And we introduced a increment storage and dynamic version views building method to improve efficiency of storing and consulting. We also illuminate how to resolve the problem of long transaction concurrency contrrl in spatial database by using multi-version mechanism. At the end of this paper,we introduce some required means like converge,compress and delete.     

组件式GIS开发中的空间数据管理方式探讨

组件式地理信息系统有三种对空间数据的管理和访问方式,取决于GIS系统的规模和应用需求.MapObjects是一个功能强大的地理信息系统组件,它支持多种数据访问方法.在基于该组件的校园地下管线地理信息系统开发中,将图形数据和属性数据在管理方式上进行分割,扩展了组件式GIS的数据库访问机制,对建立灵活的小型地理信息系统具有一定的通用性.     

基于空域正则化的模糊图像复原方法

以解决病态问题的正则化技术为基础,针对模糊图像的复原问题提出了一种新的空间域复原方法。在空间迭代运算中引入自适应的正则化参数,使其自动修正到最优,通过锐化图像进行后续处理,由此增强了原图像中重要的信息及边缘纹理部分。计算机仿真结果表明,与传统的迭代正则化方法相比,该方法的复原图像在改进信噪比数值(ISNR)和主观视觉效果上都有明显提高。     

An Index mechanism for multi-scale view in spatial databases

There are numerous geometric objects stored in the spatial databases. An importance function in a spatial database is that users can browse the geometric objects as a map efficiently. Thus the spatial database should display the geometric objects users concern about swiftly onto the display window. This process includes two operations:retrieve data from database and then draw them onto screen. Accordingly, to improve the efficiency, we should try to reduce time of both retrieving object and displaying them. The former can be achieved with the aid of spatial index such as R-tree, the latter require to simplify the objects. Simplification means that objects are shown with sufficient but not with unnecessary detail which depend on the scale of browse. So the major problem is how to retrieve data at different detail level efficiently. This paper introduces the implementation of a multi-scale index in the spatial database SISP (Spatial Information Shared Platform) which is generalized from R-tree. The difference between the generalization and the R-tree lies on two facets: One is that every node and geometric object in the generalization is assigned with a importance value which denote the importance of them, and every vertex in the objects are assigned with a importance value,too. The importance value can be use to decide which data should be retrieve from disk in a query. The other difference is that geometric objects in the generalization are divided into one or more sub-blocks, and vertexes are total ordered by their importance value. With the help of the generalized R-tree, one can easily retrieve data at different detail levels.Some experiments are performed on real-life data to evaluate the performance of solutions that separately use normal spatial index and multi-scale spatial index. The results show that the solution using multi-scale index in SISP is satisfying.     

基于空间域的车辆运动模糊图像的恢复

从车辆运动模糊图像产生的机理出发,分析了运动模糊图像的退化模型,给出了一种在空间域中车辆运动模糊图像的运动参数估计及恢复算法,该算法不涉及系统的传递函数,而是根据车辆运动模糊的逆过程在空间域内直接进行图像的恢复,其效果受曝光时间内运动距离a的影响较小,可避免频域计算中可能出现的高频振铃现象,实验结果表明,该算法具有较好的恢复效果.     

基于R树的空间连接查询代价分析

在空间数据库中空间连接是最重要的操作之一。本文首先介绍了R树结构，然后在此基础上介绍了基于R树的空间连接查询的代价模型，以达到空间查询优化的目的。     

A Weighted Algorithm for Watermarking Relational Databases

0 Introduction Watermarking relational database become a hotspot in recent years, it aims to protect copyrights by intro- ducing small errors into the original content without af- fecting the usability for intended purpose. Although some pioneer efforts h…     

数字农业空间信息管理平台的设计与实现

根据数字农业空间信息管理平台的建设目标和要求,进行了空间数据库和属性数据库的设计与建设.在此基础上,采用SQL Server2000、ArcSDE、VB6.0和ArcEngine四者结合进行了平台总体架构和功能的设计,并进行了平台的开发,实现了平台与数据管理、地图基本操作、农业信息综合查询、农业空间分析、土地斑块调整、制图与输出系统等功能.