移动数据库中一种缓存策略

基于失效报告的广播技术在支持长时间断接操作中比较有效,但是对于两个失效报告间隔中提出的查询请求,需要等到下一失效报告广播后才能对其进行回复,造成查询的长时间延迟和不必要的带宽浪费.为解决这个问题,对经典的缓存算法进行改进,提出一种改进算法——低查询延迟缓存失效报告算法,并进行模拟试验,证明其在增加缓存命中率、减小查询延迟和增大系统吞吐量等方面的优越性.     

ISS： Efficient Search Scheme Based on Immune Method in Modern Unstructured Peer-to-Peer Networks

Flooding is the most famous technique for locating contents in unstructured P2P networks. Recently traditional flooding has been replaced by more efficient dynamic query （DQ） and different variants of such algorithms. Dynamic query is a new flooding technique which could estimate a proper time-to-live （TTL） value for a query flooding by estimating the popularity of the searched files, and retrieve sufficient results under controlled flooding range for reducing network traffic. However, all DQ-like search algorithms are ＂blind＂ so that a large amount of redundant messages are caused. In this paper, we proposed a new search scheme, called Immune Search Scheme （ISS）, to cope with this problem. In ISS, an immune systems inspired concept of similarity-governed clone proliferation and mutation for query message movement is applied. Some assistant strategies, that is, shortcuts creation and peer traveling are incorporated into ISS to develop ＂immune memory＂ for improving search performance, which can make ISS not be blind but heuristic.     

一类通用综合查询模式的设计与实现

针对数据库应用系统查询模式开发过程中的现存问题，提出了一种综合查询模式的设计方法，并结合科研管理系统开发实例，阐述了运用Delphi实现相关技术的途径。     

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.     

并行空间连接查询处理

基于顺序空间连接查询的效率不能令人满意，利用并行控制提高空间连接查询效率。空间连接查询的并行处理方法最重要的特征是任务分配根据多路平面扫描顺序，避免了连接处理过程中处理器之间的通信花费，提出基于空间连接花费模型的任务分配方法和基于花费估计的动态任务分配策略，并给出了花费模型。该模型经实际应用效果明显。     

研究生入学考试查询系统的开发策略

在程序设计上采用了模块化、人性化思想 ,在程序结构上降低了数据逻辑关系之间的复杂度 ,使得该系统具有简化复杂关系的能力 ,具有高度的可扩充性和实用性 ,并提供了大量实用的范例 ,能具体解决查询设计中遇到的问题 ,对于查询设计有较高的借鉴价值 .     

数据集成系统中数据源描述的框架方法

查询重组是数据集成系统中必不可少的模块之一 ,关于数据源的内容以及它们之间联系的描述 ,是其首要任务 .在基于IA(InformationAgent)的数据集成系统中 ,可以利用多Agent系统中的匹配 (Matchmaking)机制来实现查询重组 ,本文首先给出在这种环境下查询重组模块的工作流程 ,然后提出一种知识表示中的框架来描述数据源和用户查询 ,以便系统高效地进行框架匹配和查询改写     

Oracle8数据库系统的查询优化

查询优化是数据库系统中必不可少而又极其重要的环节．优化方式的选择将影响到查询效率的高低，只有根据具体的查询要求，选择合适的优化方式，才能真正提高查询效率。     

分布式查询优化算法与应用实践

依据笔者开发大型分布数据库的应用实践，首先介绍半连接、选择因子、收益分析等基础概念，其次介绍分布式查询处理过程，主要阐述以半连接为核心的SDD-1查询优化算法，最后以实例说明该算法的实现并比较实际收益情况．     

应用聚簇索引的多连接查询优化方法

多连接查询优化是提高数据库性能的关键问题之一.查询优化主要针对连接等一些具有较高执行代价的操作进行研究.在分布式查询优化中,应同时考虑本地处理代价和传输代价.提出了一种应用聚簇索引来优化多连接查询的方法,旨在减小查询的代价.分析对比证明该方法具有较好的效果.