MEER—An EER model enhanced with structure methods

Entity relationship (ER) schemas include cardinality constraints, that restrict the dependencies among entities within a relationship type. The cardinality constraints have direct impact on the application maintenance, since insertions or deletions of entities or relationships might affect related entities. Indeed, maintenance of a system or of a database can be strengthened to enforce consistency with respect to the cardinality constraints in a schema. Yet, once an ER schema is translated into a logical database schema, or translated within a system, the direct correlation between the cardinality constraints and maintenance transactions is lost, since the components of the ER schema might be decomposed among those of the logical database schema or the target system.In this paper, a full solution to the enforcement of cardinality constraints in EER schemas is given. We extend the enhanced ER (EER) data model with structure-based update methods that are fully defined by the cardinality constraints. The structure methods are provably terminating and cardinality faithful, i.e., they do not insert new inconsistencies and can only decrease existing ones. A refined approach towards measuring the cardinality consistency of a database is introduced. The contribution of this paper is in the automatic creation of update methods, and in building the formal basis for proving their correctness.     

Conceptual modeling of cardinality constraints in social publishing

Recent years have witnessed a rise of social publishing, which is a new type of social networking service. Social publishing has certain new features that call for a new way of managing and providing a large volume of documents. A fine data model is expected to evolve dynamically with the up‐to‐date knowledge, especially the associations that emerge in the context of social publishing. This paper first presents a conceptual schema of social publishing, which evolves to combine the association knowledge that reflects hidden associations in the data. A major constraint of concern is cardinality constraint. During the process of enriching a schema, the constraints to be specified should conform to the existing ones. A set of inference rules is presented for modeling with cardinality constraints. The rules are proven to be sound and complete, which helps to derive cardinality constraints from existing ones. The derived cardinality constraints are also proven to be consistent. © 2012 Wiley Periodicals, Inc.     

Schema evolution of an object-oriented real-time database systemfor manufacturing automation

Database schemata often experience considerable changes during the development and initial use phases of database systems for advanced applications such as manufacturing automation and computer-aided design. An automated schema evolution system can significantly reduce the amount of effort and potential errors related to schema changes. Although schema evolution for nonreal-time databases was the subject of previous research, its impact on real-time database systems remains unexplored. These advanced applications typically utilize object-oriented data models to handle complex data types. However, there exists no agreed-upon real-time object-oriented data model that can be used as a foundation to define a schema-evolution framework. Therefore, the authors first design a conceptual real-time object-oriented data model, called Real-time Object Model with Performance Polymorphism (ROMPP). It captures the key characteristics of real-time applications-namely, timing constraints and performance polymorphism-by utilizing specialization-dimension and letter-class hierarchy constructs, respectively. They then re-evaluate previous (nonreal-time) schema evolution support in the context of real-time databases. This results in modifications to the semantics of schema changes and to the needs of schema change resolution rules and schema invariants. Furthermore, they expand the schema change framework with new constructs-including new schema change operators, new resolution rules, and new invariants-necessary for handling the real-time characteristics of ROMPP     

Translating relational schema into XML schema definition with data semantic preservation and XSD graph

Many legacy systems have been created by using relational database operating not for the Internet expression. Since the relational database is not an efficient way for data explosion, electronic transfer of data, and electronic business on the Web, we introduce a methodology in which a relational schema will be translated to an Extensible Markup Language (XML) schema definition for creating an XML database that is a simple and efficient format on the Web. We apply the Indirect Schema Translation Method that is a semantic-based methodology in this project. The mechanism is that the Relational Schema will be translated into the conceptual model, an Extended Entity Relationship (EER) Model using Reverse Engineering. Afterward, the EER model will be mapped to an XML Schema Definition Language (XSD) Graph as an XML conceptual schema using Semantic Transformation. Finally, the XSD Graph will be mapped into the XSD as an XML logical schema in the process of Forward Engineering, and the data semantics of participation, cardinality, generalization, aggregation, categorization, N-ary and U-ary relationship are preserved in the translated XML schema definition.     

专家领域本体建模及语义信息服务研究

目前各省市各部门分别拥有各自专用的专家信息系统,分别管理所在地区和所属领域的专家信息,其形式各异且专家信息分布异构.针对实际应用中共享专家信息困难,基于关键字查询信息效率不高等问题,提出基于语义的专家信息系统解决方案.采用5W1H分析法归纳领域本体中概念和关系,建立基于5W1H的专家本体概念模型并生成专家领域本体,实现了专家语义信息统一建模.构建系统的四层体系结构,研究语义推理规则的定义方法,设计了基于语义的规则推理算法和基于SPAR-QL的语义信息查询算法,实现了系统基于语义的信息查询和推理等功能.实验表明,基于语义的专家信息查询在查全率、查准率优于基于关键字的查询.     

对象类型的等价代换与规范化

本文讨论了面向对象数据库模式中对象类型的规范化，基于对象集合的等价提出了类型的一种范式、给出了将类型转换为范式的规则、并且证明了范式的唯一性及转换规则的完备性，本文工作在面向对象数据库设计标准化方面迈出了一步。     

A form-based natural language front-end to a CIM database

The paper presents a methodology for developing a user interface that combines fourth generation interface tools (SQL forms) with a natural language processor for a database management system. The natural language processor consists of an index, a lexicon and a parser. The index is used to uniquely identify each form in the system through a conceptual representation of its purpose. The form fields specify database or nondatabase fields whose values are either entered by the user (user-defined) or are derived by the form (system-defined) in response to user input. A set of grammar rules are associated with each form. The lexicon consists of all words recognized by the system, their grammatical categories, roots, their associations (if any) with database objects and forms. The parser scans, a natural language query to identify a form in a bottom-up fashion. The information requested in the user query is determined in a top-down manner by parsing, through the grammar rules associated with the identified form. Extragrammatical inputs with limited deviations from the grammar rules are supported. Combining a natural language processor with SQL forms allows processing data modification tasks without violating any database integrity constraint, having duplicate records, or entering invalid data. A prototype natural language interface is described as a front-end to an ORACLE database for a computer integrated manufacturing system     

Towards Restructuring and Normalization of Types in Databases

The equivalence-preserving transformation and normalization of types in object-oriented databases are discussed.Specifically,A normal form of types based on set-theoretic equivalence is proposed,rewrite rules which transform types into normal forms are presented,and the uniqueness of normal form and the completeness of rewrite rules are proved.The emphasis of this work is on normal forms and corresponding rewrite rules.It provides a new formal approach for the study of restructuring of database schema and other manipulations in object-oriented databases.     

A conceptual schema-based temporal meta database schemas generation technique for 3D objects

In this paper, a temporal meta database for three-dimensional (3D) objects whose properties and relationships are supported by valid time is introduced. Based on our proposed temporal object-oriented conceptual schema model, a conceptual schema of the temporal meta database can be generated from a 3D graphical data source and other particular application requirements. Based on our proposed temporal object relational data model with attribute timestamping, logical schemas of the temporal meta database can be systematically and automatically generated from the conceptual schema. From the temporal meta database, non-temporal/temporal metadata about temporal 3D objects are available for temporal information system users. Convenient access using database languages such as SQL can be performed. Queries over 3D objects using a temporal object relational SQL are demonstrated.     

基于深度学习的调度自动化报文合规性研究与实现

本文基于大数据及机器学习,通过分析调度自动化系统特定规约的下行控制报文,找出自动控制及人工控制的报文合规性,形成合规专家库;对海量的典型调度自动化系统主站和厂站间的交互控制报文进行关联性识别,基于大数据及深度机器学习,分析101、104等调度自动化系统规约报文在时间、控制频率、电网状态关联性、控制范围等方面的规律,形成调度自动化系统控制功能的报文合规专家库,并通过模拟试验并且同时对CIM模型、操作票进行解释,对异常报文进行告警。     

A generalized expert system for database design

Generalized Expert System for Database Design (GESDD) is a compound expert system made up of two parts: (1) an expert system for generating methodologies for database design, called ESGM; and (2) an expert system for database design, called ESDD. ESGM provides a tool for the database design expert to specify different design methodologies or to modify existing ones. The database designer uses ESDD in conjunction with one of these methodologies to design a database starting from the requirement specification phase and producing a logical schema in one of the well-known data models, namely, the hierarchical data model, the network data model, or the relational data model. The system is evolutive in the sense that an existing methodology can be modified or a novel methodology can be added to the existing ones. GESDD is a menu-driven system and it is coded in Prolog     

Database reverse engineering: From the relational to the binary relationship model

This paper describes an algorithmic method for transforming a relational database schema to a binary-relationship one. The source schema may consist of relations that are at any level of normalization, and the designer may add semantic information on the source schema, such as the definition of candidate keys, foreign keys, functional dependencies of various types, multi-valued dependencies, many-to-many constraints, inclusion dependencies, and others. Based on this information, the multi-stage transformation algorithm applies mapping rules to generate object-types, binary-relationships and constraints in the target conceptual schema. The method is implemented as a PC-based tool, utilizing Ingres, SQL and C, and is part of a comprehensive database design tool for both forward and reverse engineering.     

Using empirical analysis to refine expert system knowledge bases

seek is a system which gives interactive advice about rule refinement during the design of an expert system. The advice takes the form of suggestions for possible experiments in generalizing or specializing rules in a model of reasoning rules cited by the expert. Case experience, in the form of stored cases with known conclusions, is used to interactively guide the expert in refining the rules of a model. This approach is most effective when the model of the expert's knowledge is relatively accurate and small changes in the model may improve performance. The system is interactive; we rely on the expert to focus the system on those experiments that appear to be most consistent with his domain knowledge. The design framework of seek consists of a tabular format for expressing expert-modeled rules and a general consultation system for applying a model to specific cases. Examples are given from an expert consultation system being developed for diagnosing rheumatic diseases.     

Multiple views and abstractions with an extended-entity-relationship model

The features of the Entity-Relationship model are examined, as a means for representing both the conceptual schema and the external schema in a database system. In order to serve in this dual capacity, its modelling features are extended to support multiple user views. We show how to represent a model and present a suitable diagrammatic technique. To represent these concepts at the user level we propose a data definition language with a concise and simple structure. Furthermore, guidelines are given for interfacing the E-E-R schema with existing DBTG-like systems.     

Foundations of entity-relationship modeling

Database design methodologies should facilitate database modeling, effectively support database processing, and transform a conceptual schema of the database to a high-performance database schema in the model of the corresponding DBMS. The Entity-Relationship Model is extended to theHigher-orderEntity-RelationshipModel (HERM) which can be used as a high-level, simple and comprehensive database design model for the complete database information on the structure, operations, static and dynamic semantics. The model has the expressive power of semantic models and possesses the simplicity of the entity-relationship model. The paper shows that the model has a well-founded semantics. Several semantical constraints are considered for this model.     

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.     

恶意代码检测中的PrefixSpan*算法应用

结合数据挖掘和专家系统技术解决主机恶意代码检测问题,提出一个基于行为的恶意代码检测系统。数据挖掘算法采用改进的序列模式挖据算法——PrefixSpan*,该算法用简约投影数据库代替原PrefixSpan算法的投影数据库。PrefixSpan*从恶意代码行为序列库中挖掘关联规则,专家系统将获取的主机行为与规则匹配,从而达到检测恶意行为的目的。实验结果证明了该算法的正确性和有效性。