A Collaborative Schema Integration System

Conceptual modelling as applied to database development can be described as a two stage process: schema modelling followed by schema integration. Schema modelling is the process of transforming individual user requirements into a conceptual schema: an implementation-independent map of data requirements. Schema integration is the process of combining individual conceptual schemas into a single, unified schema. Single-user tools for schema modelling have enjoyed much success partly because the process of schema modelling has become relatively well formalised. Although a number of formal approaches to conducting schema integration have been proposed, it appears that schema integration tools have not enjoyed the same level of success. This we attribute not so much to the problem of formalisation but to the inherent collaborative nature of schema integration work. This paper first discusses the importance of collaboration to schema integration work. It then describes SISIBIS, a demonstrator system employing the IBIS (Issue Based Information System) scheme to support collaborative database design.     

An Object Algebra Approach to Multidatabase Query Decomposition in Donají

This paper presents an approach to query decomposition in a multidatabase environment. The unique aspect of this approach is that it is based on performing transformations over an object algebra that can be used as the basis for a global query language. In the paper, we first present our multidatabase environment and semantic framework, where a global conceptual schema based on the Object Data Management Group standard encompasses the information from heterogeneous data sources that include relational databases as well as object-oriented databases and flat file sources. The meta-data about the global schema is enhanced with information about virtual classes as well as virtual relationships and inheritance hierarchies that exist between multiple sources. The AQUA object algebra is used as the formal foundation for manipulation of the query expression over the multidatabase. AQUA is enhanced with distribution operators for dealing with data distribution issues. During query decomposition we perform an extensive analysis of traversals for path expressions that involve virtual relationships and hierarchies for access to several heterogeneous sources. The distribution operators defined in algebraic terms enhance the global algebra expression with semantic information about the structure, distribution, and localization of the data sources relevant to the solution of the query. By using an object algebra as the basis for query processing, we are able to define algebraic transformations and exploit rewriting techniques during the decomposition phase. Our use of an object algebra also provides a formal and uniform representation for dealing with an object-oriented approach to multidatabase query processing. As part of our query processing discussion, we include an overview of a global object identification approach for relating semantically equivalent objects from diverse data sources, illustrating how knowledge about global object identity is used in the decomposition and assembly processes.     

From first-order logic to automated word generation for Lyee

A conceptual schema can be viewed as a language to describe the phenomena in a system to be modelled, i.e. a set of derivation rules and integrity constraints as well as a set of event-rules describing the behaviour of an object system. In this paper, we investigate the relationship between the Lyee software requirements concepts with various constructs in conceptual modelling. Within our work we choose the Unified Modelling Language (UML) as a modelling notation for explaining conceptual models. The result obtained models a fully expressive set of UML and First Order Logic constructs mapped into Lyee concepts.     

Utilization of data access and manipulation in conceptual schema definitions

The basic idea of this approach is to use data access and manipulation functions in data definition, such that testing a given individual data object on its conformance to data definition is done by running a (finally boolean) procedure against it. In essence, schema entries (i.e. definitions, declarations, etc.) are viewed as expressions of predicate logic where the individuals are obtained by the execution of data manipulation operations which include a rather general information selection technique or conceptual access method.Selection of information constructs in databases usually adopts a technique closely tailored to the specific “data model”. It is one of the intentions of this paper to demonstrate the common principles behind the variety of selection techniques by a uniform approach which comprises the selection features of most of the database management systems and makes them comparable.At the level of information structure a kind of “geography” is introduced into a database, which allows to distinguish the same information construct (record, file, segment, item, coset, tuple,…) in distinct information contexts or at distinct conceptual locations called “spots”. By definition, every spot (“construct in/with context”) exists only once in a given database. In combination with some basic operators a logical addressing mechanism has been designed, which follows the context of a construct to identify it within this very context. This algorithm turns out to be a general vehicle to locate a construct at a spot, independently of whether the database has a relational, network, hierarchical or any other appearance.The method of context directed addressing along with pertinent operators allows in a very general way—i.e. neither biased nor restricted to a “data model”—to define types of information constructs and of construct transitions as is required in a conceptual community schema. This is demonstrated through examples of schema entries with rather complex cross-consistency conditions and additional transition rules called persistency conditions. The examples also intend to give an idea of the minimum support to be expected from any future conceptual schema language.     

Schema design and mapping strategies for persistent object models

A formal model is presented for a conceptual schema of persistent object models that support a strong notion of object identity. The object constructors in the model are sets, tuples, and disjunct. The databases that correspond to such schemata are graph-structured object spaces. These conceptual object spaces are mapped onto physical object spaces, which are typically forests of trees. The characteristics of the physical schemata are discussed and an algorithm to transform a conceptual schema into a physical schema is given.     

A procedure to define the object type structure of a conceptual schema

The most important phase in the design of an information system is, in our opinion, the phase which we have given the name Information Analysis (I.A.). During I.A. a conceptual schema is designed which accurately reflects the deep semantic structure of the information which will eventually be used in the information system.

This paper describes part of a methodology which systematizes the design of the conceptual schema, forcing the user to resolve ambiguities and documenting his decisions. The algorithms used in this methodology allow for automatic detection of certain semantic inconsistencies, as well as automatic generation of (parts of) the final conceptual schema based on specifications provided by the user.

In this paper, we concentrate on the specification and generation of the object type structure of the conceptual schema.     

On correctness of information models

During the last decade a number of approaches to information modelling, or conceptual modelling, have been presented. In most approaches it is assumed that the correctness of an information model is decided from intuitive considerations, though formal methods may be applied.In this report we discuss three correctness criteria of information models, namely: consistency, satisfiability and completeness. The satisfiability of an information model in a universe of discourse can be formally checked by complementing the information model with a representation of concrete knowledge which is assumed to be complete. A formal basis for such correctness checking is presented. Further, the relationship between an information model and a conceptual schema is discussed, and an observed transformation problem is presented.     

Requirements Engineering-Based Conceptual Modelling

The software production process involves a set of phases where a clear relationship and smooth transitions between them should be introduced. In this paper, a requirements engineering-based conceptual modelling approach is introduced as a way to improve the quality of the software production process. The aim of this approach is to provide a set of techniques and methods to capture software requirements and to provide a way to move from requirements to a conceptual schema in a traceable way. The approach combines a framework for requirements engineering (TRADE) and a graphical object-oriented method for conceptual modelling and code generation (OO-Method). The intended improvement of the software production process is accomplished by providing a precise methodological guidance to go from the user requirements (represented through the use of the appropriate TRADE techniques) to the conceptual schema that properly represents them (according to the conceptual constructs provided by the OO-Method). Additionally, as the OO-Method provides full model-based code generation features, this combination minimises the time dedicated to obtaining the final software product.     

Conceptual design of object-oriented database schemas using the binary-relationship model

We describe an algorithmic method for transforming a binary-relationship (BR) conceptual schema to an object-oriented (OO) database schema. The BR schema is a semantically rich diagram that represents the reality being modeled in terms of objects, relationships and constraints. It is easy to understand and serves as a communication tool between users and designers. Therefore it can be created in the early stages of system development, and later on be transformed into a specific OO database schema. The transformation method employs a multi-stage algorithm, which first identifies the essential objects in the BR schema, together with their relationships and constraints. These are then mapped to object classes, attributes, and constraints, maintaining the semantics and all types of constraints present in the conceptual schema.     

Semantics enactment for interoperability assessment in enterprise information systems

The grown complexity of the modern enterprise poses a series of challenges, among them keeping competitiveness in the fast changing environment in which the enterprise evolves. Addressing enterprise integration is considered as a key to achieve the goal of any enterprise either it is a single or a networked enterprise. Enterprise modelling is a prerequisite to enable the common understanding of the enterprises and its various interactions in order to “provide the right information, at the right time, at the right place”. However, problems often emerge from a lack of understanding of the semantics of the elaborated models resulting from various modelling experience based on different methods and tools. This paper describes the challenges associated to semantics enactment in information systems models. To facilitate this enactment, it proposes an approach based on a fact-oriented modelling perspective. Then, it also provides an algorithm to automatically build semantic aggregates that help in highlighting enterprise models core embedded semantics. A case study on the field of B2M interoperability is performed in order to illustrate the application of the presented approach.     

A case study in mapping conceptual designs to object‐relational schemas

The recent emergence of object‐relational technology into the commercial database market has caused new challenges for the implementation of conceptual database designs. This paper presents our experience with using the Oracle 8 object‐relational data model in the implementation of an engineering application described using the EXPRESS conceptual modeling language. EXPRESS is part of the engineering community's Standard for the Exchange of Product Data and can be characterized as a structurally object‐oriented modeling language, supporting the notion of entities, entity hierarchies, complex constraints on entity hierarchies, relationships and inverse relationships between entities, and user‐defined types. As a result, EXPRESS provides an excellent framework for studying the mapping of conceptual modeling concepts into an object‐relational model. In this paper, we describe the way in which the features of EXPRESS can be mapped into object‐relational features such as object tables, object references, and nested tables. We also describe the manner in which features such as member functions on object types, triggers, and stored procedures can be used to support the implementation of constraints associated with a conceptual schema. Although the mappings presented are specific to EXPRESS and Oracle 8, the mappings are generalizable to conceptual modeling languages and object‐relational models with similar features. Our work defines how traditional mapping concepts must be revised in order to make adequate use of the features now found in object‐relational models. As part of this paper, we also compare our mapping approach using Oracle 8 to mapping issues for the PostgreSQL object‐relational model and the Objectivity/DB object‐oriented data model. Copyright © 2000 John Wiley & Sons, Ltd.     

Rosen's modelling relations via categorical adjunctions

Rosen's modelling relations constitute a conceptual schema for the understanding of the bidirectional process of correspondence between natural systems and formal symbolic systems. The notion of formal systems used in this study refers to information structures constructed as algebraic rings of observable attributes of natural systems, in which the notion of observable signifies a physical attribute that, in principle, can be measured. Due to the fact that modelling relations are bidirectional by construction, they admit a precise categorical formulation in terms of the category-theoretic syntactic language of adjoint functors, representing the inverse processes of information encoding/decoding via adjunctions. As an application, we construct a topological modelling schema of complex systems. The crucial distinguishing requirement between simple and complex systems in this schema is reflected with respect to their rings of observables by the property of global commutativity. The global information structure representing the behaviour of a complex system is modelled functorially in terms of its spectrum functor. An exact modelling relation is obtained by means of a complex encoding/decoding adjunction restricted to an equivalence between the category of complex information structures and the category of sheaves over a base category of partial or local information carriers equipped with an appropriate topology.     

Petri net modelling and design of task oriented messaging system for robot control

Manufacturing Message Specification (MMS) is an international standard for shop floor machine control. It defines a set of conceptual schema and an interactive software object known as Virtual Manufacturing Device (VMD). Many systems have been established using this protocol but very few formal methods have been used to build such systems. This paper addresses the problems of the design and analysis of a network-based task oriented messaging system for flexible robot task control using a Petri net. The information and message transfer processes of the MMS systems were analysed. The modelling methodology allows a top down approach by which the net model is decomposed into fine details with clear identification of components which can be realised directly from the model. This approach is illustrated in this paper by a Windows-based robot control prototype system implemented from the Petri net model. The prototype was built using Object Windows Library and the NetBIOS session layer protocol on a PC network.     

Deriving static and dynamic concepts from software requirements using sophisticated tagging

Natural language requirements specifications form the basis for the subsequent phase of the information system development process, namely the development of conceptual schemata. Both, the textual as well as the conceptual representations are not really appropriate for being thoroughly captured and validated by the ‘requirement holders’, i.e. the end users. Therefore, in our approach the textual specifications are firstly linguistically analyzed and translated into a so-called conceptual predesign schema. That schema is formulated using an interlingua which is based on a lean semantic model, thus allowing users to participate more efficiently in the design and validation process. After validation, the predesign schema is mapped to a conceptual representation (e.g. UML). The sequence of these translation and transformation steps is described by the “NIBA workflow”. This paper focuses on the information supporting a step by step mapping of natural language requirements specifications to a conceptual model, and on how that information is gained. On particular, we present a four-level interpretation of tagging-output.     

Existence dependency: The key to semantic integrity betweenstructural and behavioral aspects of object types

In object-oriented conceptual modeling, the generalization/specialization hierarchy and the whole/part relationship are prevalent classification schemes for object types. This paper presents an object-oriented conceptual model where, in the end, object types are classified according to two relationships only. Existence dependency and generalization/specialization. Existence dependency captures some of the interesting semantics that are usually associated with the concept of aggregation (also called composition or Part Of relation), but in contrast with the latter concept, the semantics of existence dependency are very precise and its use clear cut. The key advantage of classifying object types according to existence dependency are the simplicity of the concept, its absolute unambiguity, and the fact that it enables to check conceptual schemes for semantic integrity and consistency. We will first define the notion of existence dependency and claim that it is always possible to classify objects according to this relationship, thus removing the necessity for the Part Of relation and other kinds of associations between object types. The second claim of this paper is that existence dependency is the key to semantic integrity checking to a level unknown to current object-oriented analysis methods. In other words: Existence dependency allows us to track and solve inconsistencies in an object-oriented conceptual schema     

面向事实的概念建模方法研究综述

领域概念知识建模是构建信息系统分析的关键技术和任务之一,同时也是知识工程的瓶颈问题,其难点在于如何正确完整地捕捉和验证领域专家的知识。ER和UML等有属性特性的建模方法能够很好地描述领域知识,但却难以让领域专家确认知识的正确性和完整性。面向事实的信息建模(FOM)是一种完全面向自然语言交流的领域概念知识建模方法,是一种理想的概念建模和本体工程辅助工具。简要分析了概念建模过程,比较了不同概念建模方法,介绍了FOM的技术演化过程,从业务规则、动态建模、模型抽象机制、模型转换和工程应用等方面评述了FOM的研究现状和待研究问题。     

Database design with user-definable modelling concepts

Modelling is an integral part of engineering processes. Consequently, database design for engineering applications should take into account the modelling concepts used by engineers. On the other hand, these applications exhibit a wide diversity of modelling concepts. Rather than consolidating these into one single semantic data model one should aim for correspondingly specialized semantic models. This paper takes a constructive approach to developing such specialized models by proposing an Extensible Semantic Model (ESM) as the basis for declaring specialized semantic data models. The paper introduces a computerized environment for database design based on an ESM, and discusses the consequences of the ESM for a number of design tools: the need for a formal definition of the notion of modelling concept in order to have reliable and precise foundation for the extensions, declarative techniques for quickly introducing graphical representations for new concepts and for using them during schema design, conceptual-level test data generation for a designer-oriented evaluation of designs, and optimization techniques to control the wide latitude in mapping a conceptual schema to a logical schema. First experiences seem to point to considerable productivity gains during database design.     

A model-driven approach to semi-structured database design

Recently XML has become a standard for data representation and the preferred method of encoding structured data for exchange over the Internet. Moreover it is frequently used as a logical format to store structured and semi-structured data in databases. We propose a model-driven and configurable approach for modeling hierarchical XML data using object role modeling (ORM) as a flat conceptual model. First a non-hierarchical conceptual schema of the problem domain is built using ORM and then different hierarchical views of the conceptual schema or parts of it are specified by the designer using transformation rules. A hierarchical modeling notation called H-ORM is proposed to show these hierarchical views and model more complex semi-structured data constructs and constraints. We also propose an algorithm to map hierarchical H-ORM views to XML schema language.