基于关系数据库实现时态数据库

事物随时间变化的特性广泛存在,在其属性的特征值上存在着大量时态数据。然而关系数据库由于关系模型本身限制,基于关系的时态信息处理难以有效表示时态对象复杂的数据结构,不具备直接的时态数据管理能力。以简易的人事信息管理系统为例,对基于关系数据库的时态数据存取进行了探讨。     

时态数据库技术

主要阐述时态数据库在发展过程中，特别是近几年的发展过程中所形成的较一般的，为广大在数据库领域研究的专家、学者所认同的，并在进一步发展的时态数据库模型、技术和遇到的困难等。     

时态数据库技术

主要阐述时态数据库在发展过程中,特别是近几年的发展过程中所形成的较一般的,为广大在数据库领域研究的专家、学者所认同的,并在进一步发展的时态数据库模型、技术和遇到的困难等.     

时态数据库中间件的设计与实现

时态数据库理论研究取得了丰富的成果,但是时态数据库实现技术尚处于发展阶段.在总结前人工作的基础上,讨论了时态数据库中间件平台的实现难点、选择ATSQL2的原因、整体架构、语法和语义处理算法等内容;采用符合当前现实条件的中间件形式,实现了一个基于ATSQL2的时态数据库平台.     

数据库时态处理中间件的设计和实现

根据时态数据库的原理,提出了通过中间件TDBASE和非时态数据库管理系统交互实现时态处理的设计思想,描述了TDBASE所支持的时态语法和TDBASE的实现过程。用户可以通过TDBASE所提供的接口,把具有时态语义的SQL转换成标准的SQL后交由非时态的数据库管理系统运行,从而实现了该数据库管理系统的时态处理功能和其管理下的时态数据库。     

一种健全和有效的双时态索引技术

能为时态数据库设计出一种比现有的时态索引技术更健全且更有效的索引技术是当今时态数据库研究的主要问题,本文结合2R-tree索引、GR-tree索引和G4R-tree索引,提出了一种新的索引技术,称为G2R-tree索引。它能有效地处理所有类型的双时态数据,而且性能与4R-tree索引和GR-tree索引相当。     

基于BCDM的双时态关系代数

双时态概念数据模型BCDM是一种重要的时态数据库模型,基于BCDM模型,建立了一种双时态关系代数．首先,对时态数据库事务时间和有效时间进行规范化的定义,给出BCDM中时间元素的规范化定义和演算描述;而后,定义时态映射,用以描述BCDM中的双时态元组,并形式描述时态映射的演算;最后,用时态映射定义的元组对双时态关系进行定义,并由此给出双时态关系代数运算的形式化描述．     

一个时态关系代数

1.引言随着越来越多的私人和政府部门等需要保存和查看过去的记录(或数据),时态数据库已成为一个活跃的研究领域。据统计,近十多年来,已有400余篇有关时间信息处理的文章发表。这些研究主要集中在:(1) 时态数据模型;(2) 时态询问语言;(3) 存贮结     

若干时态关系数据库实践问题的讨论

本文讨论了若干时态关系数据库实践中最基本的问题,特别是对一些悬而未决的基本问题,阐述了自己的观点,给出了一些方向性的建议,提出了一个时态关系数据库的基本框架。本文将对时态关系数据库的进一步研究提供了一个基点,对时态数据库基本框架的建立具有一定的帮助作用。     

一种基于时态中间件的高效双时态索引模型

当前的时态数据库中间件不支持包含事务时间和有效时间的双时态数据索引,通过使用适当的数据变换和查询变换,可将双时态数据转化为R树可索引的数据.基于4R技术,提出了作为时态中间件TimeDB组件的双时态索引模型B4Rindex.实验证明,利用该模型对双时态数据进行索引是高效的.     

Java 3D实现VRML浏览器新途径

Java是一种网络语言,Java 3D是Java语言在三维图形领域的扩充,它继承了Java许多优良的特性,Java3D能实现VRML绘制的所有三维图形,通过对Java 3D实现编译浏览VRML文件的分析,简要叙述了Java 3D的几何形体绘制、动画、交互技术,介绍了用Java语言编译VRML文件中遇到的一些技术问题。     

A New Approach for Representing and Querying Textual Attributes in Databases

In this paper, a new approach to deal with textual attributes in databases is presented. The basic idea is to give a new representation for these attributes, so that it allows us to treat them together with and in the same way than the other database attributes in querying, data warehousing, data mining processes, etc. Additionally, the transformation process of the textual attribute implies the obtaining of a global representation, which includes a great part of the attribute meaning. Moreover, this representation can be improved by using an ontology during the querying process, which enables the semantic queries. The formal representation model is presented in the paper, as well as the mathematical bases for dealing with it. The whole implementation process is also described by using a medical database to show the experimental results. Finally, a set of semantic query examples are offered to explain the advantages of this new approach.     

A Multistrategy Approach to Relational Knowledge Discovery in Databases

When learning from very large databases, the reduction of complexity is extremely important. Two extremes of making knowledge discovery in databases (KDD) feasible have been put forward. One extreme is to choose a very simple hypothesis language, thereby being capable of very fast learning on real-world databases. The opposite extreme is to select a small data set, thereby being able to learn very expressive (first-order logic) hypotheses. A multistrategy approach allows one to include most of these advantages and exclude most of the disadvantages. Simpler learning algorithms detect hierarchies which are used to structure the hypothesis space for a more complex learning algorithm. The better structured the hypothesis space is, the better learning can prune away uninteresting or losing hypotheses and the faster it becomes.We have combined inductive logic programming (ILP) directly with a relational database management system. The ILP algorithm is controlled in a model-driven way by the user and in a data-driven way by structures that are induced by three simple learning algorithms.     

A Heuristic Approach to Learning Rules from Fuzzy Databases

As an alternative to approaches based on entropy and information gain, we describe a system that uses a measure called the impurity level. The learning algorithm based on this measure, which we call FARNI, first induces fuzzy decision trees by using an impurity-level extension for selecting the best branch. This is similar to the way C4.5 and ARNI induce selections for crisp databases. Once FARNI calculates the fuzzy decision tree, it returns compact fuzzy rule sets that apply a pruning process     

关系数据库中知识发现的一种粒计算方法

提出用粒计算方法从关系数据库或信息系统中挖掘具有不同粒度大小的多维多层次关联规则. 首先, 基于粒计算的划分模型给出了从关系数据库或信息系统中进行知识发现的框架; 其次, 提出频繁k-项目集生成的粒计算方法; 最后, 对所提出的粒计算方法通过实际例子进行说明, 并选择两类不同数据集在给定不同支持度下进行测试, 以及与两种经典方法进行了比较. 测试结果表明所提出的粒计算方法有效. 而且借助粒计算使得关联规则的语义变得更加清晰和易于理解.     

A Logical Approach to Quality of Service Specification in Video Databases

Quality of Service (QoS) is defined as a set of perceivable attributes expressed in a user-friendly language with parameters that may be objective or subjective. Objective parameters are those related to a particular service and are measurable and verifiable. Subjective parameters are those based on the opinions of the end-users. We believe that quality of service should become an integral part of multimedia database systems and users should be able to query by requiring a quality of service from the system. The specification and enforcement of QoS presents an interesting challenge in multimedia systems development. A deal of effort has been done on QoS specification and control at the system and the network levels, but less work has been done at the application/user level. In this paper, we propose a language, in the style of constraint database languages, for formal specification of QoS constraints. The satisfaction by the system of the user quality requirements can be viewed as a constraint satisfaction problem, and the negotiation can be viewed as constraint optimization. We believe this paper represents a first step towards the development of a database framework for quality of service management in video databases. The contribution of this paper lies in providing a logical framework for specifying and enforcing quality of service in video databases. To our knowledge, this work is the first from a database perspective on quality of service management.     

事件驱动算法演示技术的面向方面实现

算法演示系统是利用图形和动画来表现算法的运行过程的系统.一直以来人们采用事件驱动技术进行算法演示系统的开发,但传统的实现方案容易导致代码混乱和分散,以及可重用性和可维护性低等缺点.提出使用面向方面技术开发算法演示系统的方案,与传统实现方案相比,基于面向方面技术的实现方案具有系统模块松散耦合、可重用性高等优点.