XML模式中隐式冗余不存在的充要条件

XML数据库模式规范化设计是产生一组相关联的、能表示数据间依赖关系、而且消除了冗余的XML模式或DTD,以更好地进行信息检索.XML数据库模式中某些数据依赖的存在是冗余存在的原因,因此在XML数据库模式中数据依赖与冗余的关联是其规范化设计研究的关键问题,但对这一问题目前还没有专门的研究.XML数据库模式的数据依赖包括属性间数据依赖和元素间的数据依赖,给出综合了属性间和元素间数据依赖的XML数据库模式数据依赖的定义,分析与之关联的隐式冗余,并论证XML模式中隐式冗余不存在当且仅当该XML模式是规范的,为XML数据库模式规范化设计更深一层的研究奠定理论基础.     

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.     

面向数据库模式变更的代码演化推荐方法

许多软件依赖数据库来存储信息。数据库模式的变更可能导致程序代码中与数据库相关的SQL语句代码不能正常执行,因而找出一种能够直接定位到需要修改的SQL语句代码并推荐出这些代码可能的修改方案的方法是十分必要的。提出的面向数据库模式变更的代码演化推荐方法首先自动检测出软件系统数据库模式发生的变更,随后采用程序切片技术得出与数据库操作相关的程序切片;确定受到数据库模式变更影响的程序切片后,利用源程序转换流程图算法将程序切片转化为程序流程图;根据程序流程图的分支条件得出SQL语句所有可能的特定执行路径;最后采用图映射的方法对每条路径的SQL语句进行变更语句推荐,推荐出新数据库模式下可执行的SQL语句。为了验证该方法的可行性,实现了一个用于自动检测数据库模式变更并能推荐出SQL语句演化后代码的插件工具。     

候选关键字的判定理论

在关系数据库理论中,确定关系模式的候选关键字是一个NP完全问题,至今尚无有效的理论.本文提出关系模式唯一候选关键字存在性的充要条件和开发了具有单属性函数依赖候选关键字的求解规则.     

基于规则的关系数据库到本体的转换方法*

提出了一种新的全自动的关系数据库到本体的转换方法,通过分析关系模式的主键、属性、引用关系、完整性约束和部分数据来创建本体,尽量保持了关系数据库的信息,并在构建的过程中对信息进行初步的集成和分类.系统实践证明,该方法可自动进行关系模式和数据到本体的等价转换,而且完成了对关系数据库中部分语义信息的辅助挖掘.     

从DTD映射到关系模式:一种保持数据依赖的映射方法

XML正迅速成为互联网上数据表示和交换的标准．用关系数据库存储XML数据是XML存储策略之一．为了将XML数据存储到关系数据库中，人们研究了从DTD到关系模式的映射方法．提出了一种保持数据依赖的映射方法PDD．与已有的Shared—Inlining方法相比，PDD方法充分考虑了DTD蕴涵的数据依赖关系，保证了XML文档的完整性．通过对泛关系进行模式分解，得到的关系模式保持函数依赖，并且满足2NF．可以证明，这种方法是有效的．     

基于规范化关系模式生成XML的键

现实应用需要从关系数据库中提取数据并以XML的形式进行发布，需要利用定义在XML文档上的键检测发布后的XML文档是否满足原先关系数据库的语义及完整性约束。文章提出了生成XML键的方法，该方法由关系数据库中的键、外键约束构造规范化关系模式的约束概念层次图，并保持语义映射为有效的、完全的XML键约束。     

Constraint Preserving Transformation from Relational Schema to XML Schema

XML has become the standard for publishing and exchanging data on the Web. However, most business data is managed and will remain to be managed by relational database management systems. As such, there is an increasing need to efficiently and accurately publish relational data as XML documents for Internet-based applications. One way to publish relational data is to provide virtual XML documents for relational data via an XML schema which is transformed from the underlying relational database schema such that users can access the relational database through the XML schema. In this paper, we discuss issues in transforming a relational database schema into the corresponding XML schema. We aim to preserve all integrity constraints defined in a relational database schema, to achieve high level of nesting and to avoid introducing data redundancy in the transformed XML schema. In the paper, we first propose a basic transformation algorithm which introduces no data redundancy, then we improve the algorithm by exploring further nesting of the transformed XML schema.     

消除结构冗余的XML数据库模式规范化设计

XML数据库模式规范化设计是给出一个能很好地表示数据间依赖关系并消除了冗余的XML模式或DTD的集合．目前这一领域的研究并没有对XML数据库模式中的数据依赖和冗余进行专门的分析．引人标识符分别表示XML模式中的元素和属性，分析XML数据库模式的结构冗余：局部冗余、传递冗余和不规则；并在此基础上，定义XML数据库模式第3范式(3NF)，给出并验证其规范化设计算法．     

An approach to developing complex database schemas using form types

In this paper we consider an approach to developing complex database schemas. Apart from the theoretical model of the approach, we also developed a CASE tool named Integrated Information Systems*Case, R.6.2 (IIS*Case) that supports the practical application of the approach. In this paper the basis of our approach to the design and integration of database schemas and ways of using IIS*Case is outlined. The main features of a new version of IIS*Case, developed in Java, are described. IIS*Case is based on the concept of ‘form type’ and supports the conceptual modelling of a database schema, generating subschemas and integrating them into a relational database schema in 3NF. IIS*Case provides an intelligent support for complex and highly formalized design and programming tasks. Having an advanced knowledge of information systems and database design is not a compulsory prerequisite for using IIS*Case. IIS*Case is based on a methodology of gradual integration of independently designed subschemas into a database schema. The process of independent subschema design may lead to collisions in expressing real‐world constraints. IIS*Case uses specialized algorithms for checking the consistency of constraints embedded in a database schema and its subschemas. This paper briefly outlines the application of the process of detecting collisions, and actions the designer may take to resolve them. Copyright © 2007 John Wiley & Sons, Ltd.     

关系数据库模式中候选码的求解算法

在设计和应用关系数据库时,都需要使用候选码。本文介绍了求解一个关系模式的候选码的两种算法。算法一可计算出一个候选码,算法二可计算出全部候选码。     

Extracting local schema from semistructured data based on graph-oriented semantic model

Many modern applications(e-commerce,digital library,etc.)require integrated access to various information sources(from tr5aditional RDBMS to semistructured Web repositories).Extracting schema from semistructured data is a prereuisite to integrated heterogeneous information sources.The traditional method that extracts global schema may require time (and space)to increase exponentially with the number of objects and edges in the source.A new method is presented in this paper.which is about extracting local schema,In this method,the algorithm controls the scale of extracting schema within the “schema diameter“ by examining the semantic distance of the target set and using the Hash class and its path distance operation.This method is very efficient for restraining schema from expanding.The prototype validates the new approach.     

Extracting Schema from an OEM Database

While the schema-less feature of the OEM(Object Exchange Modl)gives flexibility in representing semi-structured data,it brings difficulty in formulating database queries. Extracting schema from an OEM database then becomes an important research topic.This paper presents a new approach to this topic with th following reatures.(1)In addition to representing th nested label structure of an OEM database,the proposed OEM schema keeps up-tp-date information about instance objects of the database,The object-level information is useful in speeding up query evaluation.(2)The OEM schema is explicitly represented as a label-set,which is easy to construct and update.(3)The OEM schema of a database is statically built and dynamically updated.The time complexity of building the OEM schems is linear in the size of the OEM database.(4)The approach is applicable to a wide range of areas where the underlying schema is much smaller than the database itself(e.g.data warehouses that are made from a set of heterogeneous databases).     

Exploring into programs for the recovery of data dependenciesdesigned

Data dependencies play an important role in the design of a database. Many legacy database applications have been developed on old generation database management systems and conventional file systems. As a result, most of the data dependencies in legacy databases are not enforced in the database management systems. As such, they are not explicitly defined in database schema and are enforced in the transactions, which update the databases. It is very difficult and time consuming to find out the designed data dependencies manually during the maintenance and reengineering of database applications. In software engineering, program analysis has long been developed and proven as a useful aid in many areas. With the use of program analysis, this paper proposes a novel approach for the recovery of common data dependencies, i.e., functional dependencies, key constraints, inclusion dependencies, referential constraints, and sum dependencies, designed in a database from the behavior of transactions, which update the database. The approach is based on detecting program path patterns for implementing most commonly used methods to enforce these data dependencies     

Integrity constraints in the information source tracking method

We study the issue of integrity constraints in the Information Source Tracking (IST) method. The IST method is an approach to the management of uncertain data in database systems. The main idea behind IST is that database information is supplied, or confirmed, by information sources. The accuracy of data is modeled by the reliability of the contributing information sources. In practice, information sources that are generally quite reliable may supply conflicting data at times. A database system based on IST must accept such data, and be capable of functioning correctly despite the inconsistency. We concentrate on cases where conflicting data is in violation of “key constraints”, a special form of functional dependencies resulting from the imposition of a key for each relation in the database. We present an approach, based on the adjustment of conflicting information source reliabilities, to handle data in violation of key constraints     

基于混合跳链条件随机场的异构Web记录集成方法

提出了一种混合跳链条件随机场序列统计学习模型,以实现异构Web记录与关系数据库的模式匹配.该模型可以在由手工标注样本和关系数据库记录组成的联合样本集上进行训练,减少了对繁琐手工标注样本的依赖.此外,通过在线性链条件随机场模型上增加对跳边的支持,使得该模型能够有效地处理状态变量间的长距离依赖.在多个领域的真实数据集上的实验结果表明,所提出的方法能够显著提高异构Web记录语义模式匹配的性能.     

基于代价的XML Schema到关系模式的映射策略研究

XML作为一种数据交换的国际标准,已经广泛应用于各个领域,如何准确地实现XML与关系数据库的转换已经成为一个重要的研究课题。本文主要研究XML Schema到关系模式的映射方法,通过对XML Schema的结构和语法进行分析,提取元素的语义信息,找到真正的复杂类型的元素,将XML Schema转换为E_Schema,E_Schema表达方式简单且信息完整,结合基于查询代价的思想对E_Schema进行处理,得到最优模式,再将其转换成关系模式,而且能保持原有的层次关系,从而实现了一个更为简单、完善的映射方案。     

Reasoning about ER models in a deductive environment

In this paper we present an approach to represent schema information, application data and integrity constraints as a logic program in form of Datalog. The schema information is supplied as an enhanced entity relationship (EER) model which is transformed by a one-to-one mapping into a set of ground facts. The application data corresponding to the schema is also represented by ground facts in a single table. In order to check whether the application data conforms to the given schema, generic functional and inclusion dependencies are introduced, which can be mapped into concrete dependencies using the schema information. The concrete dependencies are used for checking the consistency between application data and the schema. The formulation of the constraints based on functional and inclusion dependencies led to a small extension of the EER model by allowing identifying attributes in relationship types. This extension leads to both simpler constraints and simpler EER application models.Furthermore, we provide a meta EER model which can be used to check whether the application EER model is a structural valid EER model. Any application EER diagram is an instance of the meta EER diagram which can be specified using the proposed application data representation. The same integrity rules can be used to check the conformance between the application data and the application EER diagram, the meta EER diagram and the application EER diagram, and finally it can be used to check the meta EER model itself.