集成化CASE

近几年来,随着计算机辅助软件工程(CASE)工具的发展,CASE 的研究和开发重点已从确保各 CASE 工具的正常工作转移到了确保各个不同厂家的 CASE 工具的协同工作,因而集成成为开发和维护 CASE 工具的关键技术。目前,国外许多著名的软、硬件公司都纷纷投资于集成 CASE 的研究,并提出了各种各样的CASE 策略和框架,随之也应运而生了一些国内外的 CASE 标准。本文根据 Ronald J.Jorman 和Minder Chon 发表在 IEEE Software 1992.3上的两篇文章编写而成,以有助于国内集成化 CA-SE。     

增强CASE环境的表达方法

一、CASE 的概念与研究领域计算机辅助软件工程是当前信息系统开发实践中广泛的软件工程技术。作为软件工程开发的系统化、工程化与集成化的开端,对整个生命周期的开发工作给以支持,提供各类分析工具     

对象数据交换和对象模型标准化问题

目前，多种对象模型并存危害了面向对象在重用，互操作性等方面的优越性，并为不同系统间数据的交换带来了困难，对象模型的统一和集成变得必要，本文讨论了对象不统一的原因。并以ＳＴＥＰ和ＯＭＧ为例，介绍国际标准化组织在数据交换和对象模型标准化上所作工作１。     

计算机辅助软件工程CASE

当今,国内计算机技术在国民经济的各个部门得到了广泛的应用,并已进入家庭.但是对于各行各业中从事软件开发的人来说,至今仍被一个严酷的事实所困扰着,那就是在计算机给各行各业带来自动化和高效率的同时,软件开发自身却远没有实现自动化.在国内,一般而言,软件的开发工作是从系统的计划、立顶、基本设计、详细设计然后是实际的程序制作、调试,最后到应用、维护等一连串的过程.传统的软件开发基本上是以代码     

CASE的数据库需求

1引言 cAsE(计算机辅助软件工程)环境会产生大量异质数据,包括手册、程序源代码、测试结果,以及功能说明.为了有效地管理这些数据,CASE数据仓库必须满足几个数据管理的需求,包括大的存贮容量、永久性、共享、以及完整性。     

CASE环境的系统体系结构

本文主要讨论了过去和目前的各种ＣＡＳＥ环境的体系结构，包括物理和逻辑体系结构以及计算范例。在此基础上提出了一个新的体系结构，并增加了新的特征以满足ＣＡＳＥ环境的需求。     

PC／CASE：支持软件开发过程的CASE工具

一、引言随着计算机产业的迅速发展,诞生了一门新的方法学—“计算机辅助软件工程气CASE)。CASE主要解决以下问题: ·降低软件开发复杂度:工作台面向图形,形象直观;各种软件资源易被重用,简化软件的管理。     

CSCW环境下的CASE工具

本文基于CSCW的特性与方法,分析了软件设计过程中的群体参与特性,提出一个在协同工作环境下的CASE工具系统的设计方案。     

九十年代初CASE的研究现状

1990年12月,在美国加州 Irvine 召开了第四届 CASE 国际专题讨论会。会上交流总结了当前计算机辅助软件工程(ComputerAided Software Engineering,CASE)的研究现状。由 Norman 等人成文,并在1991年5月美国德州 Austin 召开的第十三届 ICSE上,向大会汇报了 CASE 状况的450个论点。本文即据此视国内情况编译而成。下届 CA-SE 国际专题讨论会将于1992年7月在加拿大魁北克省 Montreal 召开。一、现有系统1.1 维护与管理正在进行的:下列的成熟工具:更改控制、动态分析、测试、静态分析、设计恢复、公文包分析/系统清单、配置管理、构造工具(代码重构)、过程管理、数据有理化、错误跟踪、自动建档;弄清工具后面的方法,工具实现拖后;上述下划线工具未达到期望的所有目的。     

Complete rules for n-ary relationship cardinality constraints

An extended approach is presented for modeling data relationships that involve multiple entities. This approach unifies the relationship cardinality constraints defined by a variety of existing approaches into a common framework and extends the types of constraints captured. A concise tabular notation for specifying such constraints is introduced. The result is a modeling technique that captures more completely the nature of data relationships. Rules are defined for identifying inconsistencies among cardinality constraints specified for a given data relationship. Specific subsets of these rules are shown to be complete for four of the most commonly used variations of cardinality constraints. These rules extend work done in axiomatization of functional and numerical dependencies for relational databases into the area of conceptual data models.     

信息系统开发中数据定义构件的分析与描述

在基于构件的ＣＡＳＥ环境中,数据定义构件是很重要的一类构件,本文从构件软件的思想入手,提出数据类构件的概念,并重点阐述了数据定义的概念,作为本文的重点,用简化了的ＣＯＲＢＡ ＩＤＬ详细分析和描述了数据定义构件的接口,为下一步开发数据定义构件的接口,为下一步开发数据定义构件将起到积极作用。     

基于LINQ to Entity数据访问技术的应用研究

在应用系统编写的过程中．提高编写数据访问代码的效率及代码的健壮性是程序员追求的重要目标。在VisualStudio2008中提供的LINQ技术可以帮助程序员实现这两个目标。LINQ的语法类似于SQL,同时可以使用同样的语法结构对数据集对象、关系数据库、XML数据及EntityFramework数据进行操作。     

基于LINQ to Entity数据访问技术的应用研究

在应用系统编写的过程中,提高编写数据访问代码的效率及代码的健壮性是程序员追求的重要目标。在Visual Studio 2008中提供的LINQ技术可以帮助程序员实现这两个目标。LINQ的语法类似于SQL,同时可以使用同样的语法结构对数据集对象、关系数据库、XML数据及Entity Framework数据进行操作。     

Hierarchical entity-relationship diagrams: the model,method of creation and experimental evaluation

A bottom-up method for creating a hierarchy of entity-relationship diagrams (HERD) from a given, flat ER diagram (ERD) is proposed. The hierarchy consists of simple and interrelated diagrams—ER structures—with external relationships to other structures. The HERD-tree diagram, which provides the most general view of the conceptual schema, is located at the top of the hierarchy. The method is based on packaging operations, which group entities and relationships according to certain criteria. These operations are applied in several steps on a given (presumably large-scale) ERD. We describe the new constructs, which are added to the ER model to enable the creation of HERD, and a bottom-up method for creating HERD. We also evaluate HERD from the point of view of user comprehension and preference, based on an experimental comparison to flat ERDs.

Query by diagram: A visual environment for querying databases

In recent years, several attempts have been made to define query languages characterized by both high expressive power and easy query formulation. Several issues concern graphical applications, based on the diagrammatic representation of a semantic model and visual interaction. This paper describes the architecture and the implementation of a graphical query system, based on the diagrammatic representation of entity relationship schemata. The query language underlying the system allows the formulation of recursive queries; moreover, user interaction in both managing diagrams and expressing queries is simplified by the presence of a fully visual environment and a rich set of interaction strategies.     

基于ebXML的零售业ECR系统的数据交换技术研究

ECR是目前零售行业正在大力推广的管理策略,但与其相关的信息技术方面的基础还相对比较薄弱.从实际应用出发,以现有的EDI商务流程为基础,使用ebXML基础架构,建立了ebXML商务流程模型,实现了ebXML消息服务,并解决了消息在Internet上的传输和安全问题,构建满足ECR系统要求的ebXML数据交换系统,实现精确的信息流和高效的实物流在整个供应链内及时有序的流动.     

基于本体的战场环境仿真概念模型

为了能够更加全面而明确地表示战场环境仿真概念模型,考虑到本体可以明确地表示概念和关系的特点,提出了使用本体来表示战场环境仿真的概念模型。在战场环境仿真概念模型研究的基础上,给出了战场环境仿真的主要实体和交互关系,提出使用OWL(Web Ontology Language)语言实现战场环境仿真概念模型的本体表示,并针对现有本体建模元语的不足,提出了使用8种本体建模元语建立战场环境仿真概念模型的本体。     

A grain preservation translation algorithm: From ER diagram to multidimensional model

Many IT practitioners and researchers advocate that data models of data warehouses should incorporate the sources of their data in order to achieve maximum efficiency. As the source data are probably derived from system designed with ER diagrams, a great deal of research has been devoted to the design of methodologies for building multidimensional models based on source ER diagrams. However, to the best of our knowledge, no algorithm has been proposed that can systematically translate an entire ER diagram into a multidimensional model with hierarchical snowflake structures. In this paper, we propose an algorithm that achieves the above goal because it incorporates two features, namely, grain preservation and the minimal distance from each dimension table to the fact table. The grain preservation feature guarantees that the translated multidimensional model will maintain cohesive granularity among the entities. Meanwhile, the minimal distance feature guarantees that if an entity can be connected to the fact table in the multidimensional model by more than one path, the path with the smallest number of hops will always be chosen. The first feature is derived by translating ambiguous relationships between entities into weighting factors stored in bridge tables and enhancing fact tables with unique primary keys. The second feature results from including a revised shortest path algorithm in the translating algorithm, with the distance being calculated as the number of relationships required between entities. A prototype system based on the methodology is also developed, and snapshots of the screens used for the system’s execution are presented.