An efficient selectivity estimation method for spatial query optimization with topological relationships

Many commercial database systems maintain histograms to summarize the contents of relations and permit the efficient estimation of query result sizes and the access plan cost. In spatial database systems, most spatial query predicates are consisted of topological relationships between spatial objects, and it is very important to estimate the selectivity of those predicates for spatial query optimizer. In this paper, we propose a selectivity estimation scheme for spatial topological predicates based on the multidimensional histogram and the transformation scheme. Proposed scheme applies twopartition strategy on transformed object space to generate spatial histogram and estimates the selectivity of topological predicates based on the topological characteristics of the transformed space. Proposed scheme provides a way for estimating the selectivity without too much memory space usage and additional I/Os in most spatial query optimizers.     

Parallel recovery method in shared-nothing spatial database cluster system

Shared-nothing spatial database cluster system provides high availability since a replicated node can continue service even if any node in cluster system was crashed.However if the failed node wouldn't be recovered quickly, whole system performance will decrease since the other nodes must process the queries which the failed node may be processed. Therefore the recovery of cluster system is very important to provide the stable service. In most previous proposed techniques, external logs should be recorded in all nodes even if the failed node does not exist. So update transactions are processed slowly.Also recovery time of the failed node increases since a single storage for all database is used to record external logs in each node. Therefore we propose a parallel recovery method for recovering the failed node quickly.     

Indexing large moving objects from past to future with PCFI

In moving object database, the moving objects' current position must be kept in memory, also to the trajectory, in some case, as same as the future. But the current existing indexes such as SEB tree, SETI tree, 2+3R tree, 2 3RT tree and etc. can only provide the capability for past and current query, and the TPR Tree, TPR * Tree and etc. can only provide the capability for current and future query. None of them can provide a strategy for indexing the past, current and also the future information of moving objects. In this paper, we propose the past current future Index (PCFI Index) to index the past, current & future information of the moving objects. It is the combination of SETI tree and TPR * tree, the SETI liking index is used for indexing the historical trajectory segments except the front line structure, and the moving objects' current positions, velocities are indexed via the in memory frontline structure which mainly implemented with TPR * tree. Considering the large update operations on TPR tree of large population, a hash table considering cache sensitivity is also introduced. It works with the frontline part, leading a bottom up update of the tree. The performance analysis proves that the PCFI index can handle most of the query efficiently and provides a uniform solution for the trajectory query, time slice query, internal query and moving query.     

Design and implementation of highway distress and preventive measures decision support system based on WebGIS 

A highway distress and preventive measures decision support system based on WebGIS and J2EE architecture were studied, and the key issues for the system are presented. Such issues as spatial data and attribute data organization, technology of enhancing user experience, database connection pool were investigated. The feasibility of the theories and methods were tested through the system.     

一种新的蜂窝网无线定位位置解算方法

定位算法是无线定位技术研究的核心，其优劣将直接影响整个定位系统的性能。针对蜂窝网无线定位技术的特点，提出了一种基于坐标变换对TOA定位测量数据进行位置解算的方法，该方法通过对测量点的空间坐标变换，避免了位置解算过程中的方程线性化问题，减小了计算复杂度，并能大大提高位置解算的精度。实验结果表明，相对于泰勒级数展开法，有效地提高了系统定位性能。     

Y_(1.95-x)Gd_xSiO_5:Eu_(0.05)的真空紫外光谱

利用高温固相法合成了 Ｙ１．９５－ｘＧｄｘＳｉＯ５：Ｅｕ０．０５（ｘ＝０．６ｍｏｌ％）荧光体。结构测定表明所合成的荧光体为单斜晶系的Ｘ２型Ｙ２ＳｉＯ５相,空间群为Ｂ２／ｂ。真空紫外光谱表明：随着Ｇｄ３＋含量的增加,在１９２ｕｍ附近,出现了Ｇｄ＋的激发峰,且此峰的强度随着Ｇｄ３＋含量的增加而增大;同时位于１５０～１８５ｎｍ之间的基质吸收带的强度也增大;而位于２００～３００ｎｍ之间的Ｅｕ的电行迁移带的强度却随着Ｇｄ３＋含量的增加而降低。     

Services oriented architecture of foundation data platform of digital city

Digital city, a large complex system, is comprised many subsystem of different fields. It involves common field data, flexible field processes, seamless intra-organization and inter-organization collaborations, and increasing connectivity and interoperability between distributed or decentralized systems. All above these are involved Foundation Data of Digital city. To promote the sustainable development of Digital City, this paper investigates to the construction of Foundation Data Platform {FDP） from the view of the architecture. The paper introduces the concep- tions, characteristics and underlying problems of the FDP, and discusses the key issues of the architecture paradigms what FDP might adopted via comparing Object-Oriented Architecture {OOA）, Component-Based Architecture （CBA） , and Service-based Architecture （SBA）. The Process Embedded Service-Oriented Architecture （SOA）, one of the recent SOA Application Architecture is introduced. The results indicate that the Process Embedded SOA could promote the sustainable development of Digital City and accommodate the dynamic development environments of different fields which constantly changes requirements.     

Operator scheduling strategy for LBS based intelligent transportation system

With the development of location technologies, advanced LBSbased ITS increasingly requires the capability of database technologies to manage the continuously arrived vehicles' location, traffic jam and other interrelated information of large amounts of traffic in the following years. And some burst arrival stream data will challenge the realtime performance and the allocation of limited resource. However, choosing a desirable database operator scheduling strategy can significantly improve the performance of the system. The path capability strategy was chosen and improved as ITS' operator scheduling strategy to meet the realtime response and the minimal memory requirement of the system.      

Design and analysis of generic LBS application developing platform

Location based services is promising due to its novel working style and contents.A software platform is proposed to provide application programs of typical location based services and support new applications developing efficiently. The analysis shows that this scheme is easy implemented, low cost and adapt to all kinds of mobile nework system.     

An improved R-tree based on childnode''s probability

R-Tree is a good structure for spatial searching. But in this indexing structure，either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibility that the object appears in different MBR which have the same parents node is different，if we make the subnode who has the most possibility be traveled first，the time cost will be decreased in most of the cases. In some case，the possibility of a point belong to a rectangle will shows direct proportion with the size of the rectangle. But this conclusion is based on an assumption that the objects are symmetrically distributing in the area and this assumption is not always coming into existence. Now we found a more direct parameter to scale the possibility and made a little change on te structure of R-tree，to increase te possibility of founding te satisfying answer in the front sub trees. We names this structure probability based arranged R-tree (PBAR-tree).