An XML-based methodology for parametric temporal database model implementation

Parametric data model is one of dimensional data models. It defines attributes as functions, modeling a real world object into a single tuple in a database. Such one-to-one correspondence between an object in the real world and a tuple provides various advantages in modeling dimensional data, avoiding self-joins which frequently appear in temporal data models which fragment an object into multiple tuples. Despite its modeling advantages, it is impractical to implement the parametric data model on top of conventional database systems because of the data model’s variable attribute sizes. However, such implementation challenge can be resolved by XML because XML is flexible for data boundaries. In this paper, we present an XML-based implementation methodology for the parametric temporal data model. In our implementation, we develop our own XML storage called CanStoreX (Canonical Storage for XML) and build the temporal database system on top of the CanStoreX.     

基于SQL的关联规则挖掘

Data mining is becoming increasingly important since the size of database grows even larger and the need to explore hidden rules from the database becomes widely recognized. Currently database systems are dominated by relational database and the ability to perform data mining using standard SQL queries will definitely ease implementation of data mining. In this paper ,we introduce an association rule mining algorithm based on Apriori and the implementation using SQL. At the end of the paper ,we summarize the paper.     

RDBMS和COM的海量遥感影像数据的管理和Web发布

介绍了基于关系型数据库（RDBMS）和微软组件技术（COM）的Web海量影像数据库（IMIDM）的研究背景、系统组织和实现，具体论述了IMIDB的数据库逻辑设计，包括数据库的选择、遥感数据的组织和存储；在此基础上，论述了存储在数据库中的遥感影像的Web发布体系结构，以及组件对象模型技术在该系统中的运用；最后给出了该系统的测试情况，测试结果表明，系统达到了设计目标。     

基于PHIGS的层次图形数据库系统

程序员级的交互式层次图形系统支持动态的交互和层次结构的组织。实现图形系统的一个重要方面是图形模型的数据结构。本文论述了一个集中式图形数据库的设计与实现，该系统是一个实验性的基于ＰＨＩＧＳ的层次数据库系统。其设计的特点是此数据库可以被若干个应用程序共享。     

基于OGSA—DAI的数据集成模型研究

随着网格技术应用研究的发展，网格计算环境下数据库访问和集成现成为研究热点。以OGSA—DAI和异构数据库集成技术为基础，概述了数据集成的关键技术，提出了基于OGSA—DAI的数据集成模型，重点讨论了模型的体系结构、数据集成的步骤和实现方法，并以开发的基于此模型的虚拟数据库作为应用实例，验证了所提出模型的有效性。     

基于OGSA-DAI的数据集成模型研究

随着网格技术应用研究的发展,网格计算环境下数据库访问和集成现成为研究热点。以OGSA-DAI和异构数据库集成技术为基础,概述了数据集成的关键技术,提出了基于OGSA-DAI的数据集成模型,重点讨论了模型的体系结构、数据集成的步骤和实现方法,并以开发的基于此模型的虚拟数据库作为应用实例,验证了所提出模型的有效性。     

Design and implementation issues in an integrated database management system for engineering design environment

The need for a unified database management system for various engineering applications has long been felt. Due to the conflicting requirements, so far, most of the attempts in this field are at best partially successful. This paper presents broad perspectives of design and implementation issues of an integrated database management system. A unique feature of the system is its ability to define a unifying data model for matrices and relations. The system also provides for a unified language interface for different user groups. System architecture and a few distinguishing features are described. An evaluation of the system is presented.     

基于Vague集的时态数据库

为了更加精确地表示模糊信息,数据库的模糊属性采用Vague集来表示.基于Vague集的数据库模型与现有模糊关系数据模型相比,有更强的模糊表达能力,数据库中的每一数据及元组均可分别从真、假隶属度及未知程度三个侧面予以体现.在Vague数据库模型的基础上进行了扩展,提出了基于Vague集的时态数据库,为进一步研究Vague时态数据库的数据模型、数据理论等相关问题打下了基础.     

基于主动数据库的工作流管理系统

高端工作流管理系统在应用中与数据库的频繁连接和数据交换成为其性能的瓶颈。该文提出一种新的基于主动数据库技术和ECA规则理论实现工作流管理系统的方法,探讨了基于主动数据库实现工作流管理系统的参考模型,与传统工作流参考模型的比较证明了该参考模型的合理性与可行性。     

QuePED: Revisiting queueing networks for the performance evaluation of database designs

Databases form the common component of many software systems. However, performance models specifically targeted at the database design have not been extensively studied. In this paper, we propose QuePED – a queueing network performance evaluation model for database designs. QuePED provides for the performance modelling of database design constructs, including active database rules; thus, deviating from current methods that consider database designs as processing demands on the hardware architecture. We present a formal specification of QuePED and describe its application to database designs. Experimental evaluation has shown the ability of QuePED to capture the steady state performance of an implementation of the TPC-C benchmark.     

Optimizing the execution of multiple data analysis queries on parallel and distributed environments

We investigate techniques for efficiently executing multiquery workloads from data and computation-intensive applications in parallel and/or distributed computing environments. In this context, we describe a database optimization framework that supports data and computation reuse, query scheduling, and active semantic caching to speed up the evaluation of multiquery workloads. Its most striking feature is the ability of optimizing the execution of queries in the presence of application-specific constructs by employing a customizable data and computation reuse model. Furthermore, we discuss how the proposed optimization model is flexible enough to work efficiently irrespective of the parallel/distributed environment underneath. In order to evaluate the proposed optimization techniques, we present experimental evidence using real data analysis applications. For this purpose, a common implementation for the queries under study was provided according to the database optimization framework and deployed on top of three distinct experimental configurations: a shared memory multiprocessor, a cluster of workstations, and a distributed computational Grid-like environment.     

基于SOAP的Web异构数据库操作模型的研究

互联网的发展使得Web数据库成为数据库应用的主流。然而,传统分布式计算模式与数据库在设计结构和操作平台上的差异给Web数据库应用带来了困难。文中采用SOAP协议解决传统分布式计算模式在Web应用上的不足,利用XML技术解决异构数据库数据交换的问题,并在这个基础上提出了基于SOAP协议的Web异构数据库操作模型,完成异构数据库在Web上的数据交换和数据共享的工作流程。     

数据库信息安全网关的设计与实现

数据审计作为信息系统审计的重要组成部分,对信息安全具有十分重要的意义。该文通过比较不同的数据库审计机制,并结合具体应用的需求,设计实现了基于Oracle数据库的信息安全网关,为实现数据库安全的实时监控和事后监察提出了完整的解决方案,以此实施"既信任又验证"的信息化企业安全原则。     

一种XML数据库的数据模型

数据模型是XML数据管理领域研究的核心问题之一.现有的数据模型在表达XML数据库复杂的数据结构和操作方面仍有不足.以映射为基础,提出了一种新的数据模型.该数据模型给出了XML数据库复杂的数据结构和语义的精确定义,并提供了数据结构上操作代数的定义,包括路径表达式操作和数据维护操作.该数据模型已应用于一个基于XML的信息集成系统中.事实表明,它能够有效地支持XML数据管理的应用.     

基于RUP的科技基础数据库系统的设计

针对基于RUP/UML的数据库系统分析方法进行研究:在基于面向对象UML的平台上,以科技基础数据库系统为研究对象,对其用例模型、分析模型、设计模型和实现模型进行了分析设计,并采用UML建模工具Rational ROSE进行进一步的辅助分析与设计,得到了本系统的相关实现模型。文中的研究对数据库系统的分析设计提供了一种实用的技术途径。     

An integrated temporal data model incorporating time series concept

Most temporal data models have concentrated on describing temporal data based on versioning of objects, tuples or attributes. The concept of time series, which is often needed in temporal applications, does not fit well within these models. The goal of this paper is to propose a generalized temporal database model that integrates the modeling of both version-based and time-series based temporal data into a single conceptual framework. The concept of calendar is also integrated into our proposed model. We also discuss how a conceptual Extended-ER design in our model can be mapped to an object-oriented or relational database implementation.     

基于数据仓库技术设计与实现的科技数据管理系统

数据仓库技术的发展为增强科技数据的管理和共享共用能力提供了新思路,该文提出了一个基于数据仓库型中央数据库体系结构的科技数据管理系统方案,并探讨了各模块的实现以及系统的主要功能。     

对抗场景划分识别与多agent群体对抗策略选择研究*

针对多agent群体对抗策略选择问题,建立对抗场景的新型划分识别框架,提出多agent群体指标信息证据合成方法,能在复杂动态的对抗场景中快速生成实时的最佳群体对抗策略,完成群体对抗任务,从而为多agent群体对抗的战术决策提供方法支持.     

Spatial Data Mining: Database Primitives, Algorithms and Efficient DBMS Support

Spatial data mining algorithms heavily depend on the efficient processing of neighborhood relations since the neighbors of many objects have to be investigated in a single run of a typical algorithm. Therefore, providing general concepts for neighborhood relations as well as an efficient implementation of these concepts will allow a tight integration of spatial data mining algorithms with a spatial database management system. This will speed up both, the development and the execution of spatial data mining algorithms. In this paper, we define neighborhood graphs and paths and a small set of database primitives for their manipulation. We show that typical spatial data mining algorithms are well supported by the proposed basic operations. For finding significant spatial patterns, only certain classes of paths “leading away” from a starting object are relevant. We discuss filters allowing only such neighborhood paths which will significantly reduce the search space for spatial data mining algorithms. Furthermore, we introduce neighborhood indices to speed up the processing of our database primitives. We implemented the database primitives on top of a commercial spatial database management system. The effectiveness and efficiency of the proposed approach was evaluated by using an analytical cost model and an extensive experimental study on a geographic database.