XML模式与关系模式间的映射冲突解决方法

为解决基于XML的异构数据库之间的数据交挟问题,分析了XML模式和关系模式间存在的典型冲突,提出了一种基于XML格式的映射规则字典,该字典存储的转换信息可以解决两种模式转换过程中的典型冲突,最后给出了一组构造映射规则字典的算法.实验结果表明,在异构数据交换中引入映射规则字典能够有效降低数据转换时间,并获得较高的性能.     

Framework design of a domain-key schema of a relational database

A new approach to the synthesis of the domain-key normal form (DK/NF) for an arbitrary domain is proposed. The Cartesian dependency, which is a special case of multivalued dependencies, is investigated. A lemma on the non-abnormality of a special relational and a theorem on the non-abnormality of the actual part of a relational framework are proved. A new criterion for determining the belonging of a database schema to DK/NF is given. The proposed approach can be used in designing information warehouse schemas.     

Management of XML documents without schema in relational database systems

Many applications deal with highly flexible XML documents from different sources, which makes it difficult to define their structure by a fixed schema or a DTD. Therefore, it is necessary to explore ways to cope with such XML documents. The paper analyzes different storage and retrieval methods for schemaless XML documents using the capabilities of relational systems. We compare our experiences with the implementation of an XML-to-relational mapping with an LOB implementation in a commercial RDBMS. The paper concludes with a vision of how different storage methods could converge towards a common high-level XML-API for databases.     

一种高效基于模式图的数据库关键字查询方法

针对基于模式图的数据库关键字查询方法中普遍存在的查询效率较低的问题,提出了合并网络查询方法(CCNE)。CCNE中设计了一种合并网络结构,可以有效地避免传统方法中因候选网络之间的重复结构造成的冗余操作。同时,给出一种改进的候选网络生成策略,可以避免产生冗余候选网络并缩小遍历范围,从而提高效率。最后,在合并网络的基础上,设计一种合并网络执行算法,在很大程度上减少了传统方法所需执行的大量复杂数据库查询操作,进一步提高查询效率。多组基于真实数据集的实验结果表明CCNE可以在保证查询结果无缺失的情况下有效提高查询效率。     

Incrementally maintained network→relational database mapping

An incrementally maintained mapping from a network to a relational database is presented. This mapping may be established either to support the efficient retrieval of data from a network database through a relational interface, or as the first step in a gradual conversion of data and applications from a network to a relational database system. After the mapping has been established, the only data mapped from the network to the relational database are the increments resulting from updates on the network database. The mapping is therefore an efficient alternative to mappings that repeatedly map the results of retrievals through the relational interface from the network database to the relational database. This is in particular the case when the two databases reside on different hosts. Applications on the network database may, under certain restrictions, gradually be moved to the relational database, while the mapping incrementally maintains the relational database for the applications that remain on the network database. A detailed, but generic, account of how to build such a mapping from a network to a relational database is given, including all the algorithms needed and examples of their use.     

A user-oriented database system and its mapping to the relational model

An architecture of a database system for non-expert users and capable of supporting manual document structures is described. The development of a user-oriented data model (UODM) with suitable constructs is presented. Various design strategies for generating an appropriate relational schema automatically from the UODM are presented and discussed. Finally it is pointed out that the use of a typifying attribute and a set of mutually exclusive attributes may be of use as a general data analysis tool.     

XML文档到关系数据库映射方法的研究*

针对现有映射方法对XML文档格式要求过严等不足,在模型映射方法基础上提出一种XML文档映射关系数据库的新方法。通过给XML文档树做标志,将映射算法转换后的数据放到两张预先定义结构的表进行存储。给出了逻辑数据模型、详细设计、映射算法和实验。实验结果表明,该方法能有效地保持XML文档的结构,能够对存储的数据进行语义检索,适用于任何树型数据结构。     

包含Dewey码的XML文档映射关系数据库策略

目前的XML文档映射关系数据库方法普遍存在生成的数据表较多、查询效率较低等问题,基于模型映射提出一种包含Dewey编码的XML文档映射关系数据库方法。给出了映射的逻辑结构模型、详细设计方案、映射算法和实验结果。实验结果表明,该方法生成的数据表结构简单,与传统算法相比在文档解析和数据查询方面具有一定的性能优势。     

Development of a deterministic XML schema by resolving structure ambiguity of HL7 messages

Health level 7 (HL7) is a standard for medical information exchange. It defines data transfers for the application systems in the healthcare environment. Alternatively, the extensible markup language (XML) is a standard for data exchange using the Internet. If exchange messages follow the content and the sequence defined by HL7 and are expressed in the XML format, the system may benefit from the advantages of both standards. In creating the XML schema, we found ambiguities in HL7 message structures that cause the XML schema to be non-deterministic. These ambiguous expressions are summarized within 12 structures and can be replaced with equivalent or similar unambiguous structures. The finite state automata are used to verify expression equivalence. Applying this schema, an XML document may eliminate redundant segment group definitions and make the structure simple and easy to reproduce. In this paper, we discuss the methods and our experience in resolving ambiguous problems in HL7 messages to generate a deterministic XML schema.     

From keywords to relational database content: A semantic mapping method

Keyword-based query specification to extract data from structured databases has attracted considerable attention from various researchers, and many interesting proposals may be found in the scientific literature. However, many of these studies focus on finding a set of interconnected tuples containing all or some of the query keywords. The architecture introduced by this paper covers from the selection of databases on the Web to ranked relevant results. The approach also includes important aspects such as the proximity between keywords, query segmentation, and the use of aggregate functions, among others. The empirical evaluation analyzes the relevance of results and proves competitive as regards related studies.     

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.     

Losslessness and semantic correctness of database schema transformation: Another look of schema equivalence

Transformations between two groups of relation schemata play important roles in a database environment. These transformations are used for obtaining normal form relation schemata, generating certain view schemata and deciding appropriate internal schemata. They are also related to the data translation between distinct data models and hence between distinct database management systems. Relations belonging to one group of schemata are usually maintained in computer storage, while those belonging to another group of schemata can be virtual. It is always possible to retrieve data from virtual relations as if they are existing relations. However, if one would like to update virtual relations, the transformation between two groups of schemata must be a bijection. This paper presents four basic schema transformations and rules (constraints) which the two groups of relation schemata should obey for each transformation to be a bijection. Two of them are algebraic transformations and two others are functional transformations. On one group of schemata, some additional rules (constraints) may be imposed, against which database updates must be validated. Only the updates which transform one group of relations consistent with respect to the given rules into another group of relations also consistent with respect to them, are allowed. When the subject group of relation schemata is transformed into another group of relation schemata, these rules should also be transformed into those imposed on the latter group of relation schemata. Rule-transforming procedures associated with the four transformations are also discussed in this paper. The subject issue may provide foundations of normal form theory, view support problems, and physical representation of database relations. Also the rule transformation procedures can be applied to query transformation problems. Several extensions of the issue are also presented.     

Computer aided design of database internal schema

A large number of complexly interrelated parameters are involved at the internal schema level design of database systems. Consequently, a single design model is seen to be infeasible. A package of three aids is proposed to assist a designer in step by step design of internal schema. The three aids pertain to splitting of a relation, merging of relations, and access strategy selection for a relation.     

一种关系模式到OWL DL本体的翻译方法

本体技术是数据可以达到语义层次交换的关键,如何将当前各类数据形成本体知识库表示是一个非常重要的问题。针对这个问题,以一种关系模式到一种语义扩展ER模型的正确性可满足转换算法为基础,提出了一种通过数据库反向工程到OWL DL本体的翻译算法,说明了该算法使得转换是正确性可满足的,并实验实现验证了算法。     

类——关系数据库之间的映射

面向对象的开发方法是目前软件开发的主要方法，它以类作为软件分析，设计和实现的基本单元，而关系数据库则是许多人都青睐的持久信息存储方法，所以类－－关系数据库之间的映射是开发者必须关注的一件大事，文章扼要地介绍了类－－关系数据库之间的映射原则。     

粗糙关系数据库的数学基础

在引入粗糙关系数据库（Rough Relational Database,RRDB）的基本概念基础上,分析得出粗糙关系数据库中使用的几个主要数学理论包括等价关系、分解、位模式、粗糙熵及粗糙集理论,并进一步深入研究了这些理论在RRDB中的相关性质,对它们在粗糙关系数据库中的应用进行了探讨。     

关系数据库性能优化研究

效率是数据库开发中经常遇到的问题，数据库性能的优劣将直接关系到软件的运行效率。为了提高数据库产品的性能，对影响关系数据库性能的一些主要因素进行了阐述。结合实际给出了数据库性能优化的一些建议并用实验数据证明之。分析和比较了不同设计方案可能对数据库性能的影响，提出了目前关于数据库性能优化的问题是没有通用方案的观点。     

Inclusion and equivalence between relational database schemata

Conceptual relations among relational database schemata are investigated.Two different definitions of inclusion and a definition of equivalence between schemata are given.Several examples of practical situations adequately handled by our definitions are shown.Finally, necessary and sufficient conditions for inclusion and equivalence are proved for two classes of schemata, meaningful in the relational theory.     

闪存数据库系统中一种高效的自适应存储模式

使用闪存作为存储介质成为提高数据库系统性能的一条新途径,为了解决闪存数据库系统存储管理技术中基于日志的更新策略存在查询效率低、日志区空间分配不合理、索引更新代价高等问题,提出了基于Bloom Filter的最新版本预测算法,引入记录定位器结构,提出日志概要结构和基于闪存更新查询代价评估模型的自适应机制。实验证明,该方法能够自适应地划分合理的日志区空间,有效提高查询性能,减少各种非聚集索引的更新代价。