含有空值关系数据库的查询处理

本文在深刻理解空值语义的基础上，给出一种处理占位型空值的方法，空值环境下关系数据库的查询策略，定义了含三种查询操作的关系代数最小完备集中的关系代数运算，并对查询计算的有效性和完备性进行了分析。     

空值环境下含不确定及可能信息关系数据库的查询

本文以（１）中的扩展关系模型为基础在两种元组极的不完全信息－不确定及可能信息中引入属性级的不完全信息空值，使两种不同性质的不完全信息同时出现在同一关系中，为了能够查询到不同种类及不同确定程度的信息，文中制定了这种扩展关系模型上关系的查询策略，定义了能够体现这种策略的最小关系代数运算。     

关系数据库中基于EPTV的模糊查询

关系数据库中空值存在不同的语义,并且会影响模糊查询结果。针对该问题,提出用标号来区分空值的语义,并且在EPTV逻辑的基础上,对关系运算和一些复杂的嵌套查询进行扩展,给出相关定义和计算方法。通过实例说明,与常规模糊查询相比,该方法能较好地反映空值对模糊查询结果的影响。     

空值环境下含不确定及可能信息关系数据库的更新

本文在［１］扩展关系模型中引入属性级的不完全信息空值。为适应此环境下更新操作的需要，本文对［１］中的扩展关系模型进行了进一步的扩展，并以此模型为基础讨论了空值环境下含不确定及可能信息关系数据库的更新操作的策略，给出了相应的处理算法。     

基于更新操作的含空值关系数据库中多种类信息的查询

基于更新操作的含空值关系数据库中多种类信息的查询马宗民（中国科学院沈阳自动化研究所沈阳１１００１５）ＱＵＥＲＹＩＮＧＩＮＦＯＲＭＡＴＩＯＮＳＯＦＤＩＦＦＥＲＥＮＴＫＩＮＤＳＵＮＤＥＲＵＰＤＡＴＥＯＰＥＲＡＴＩＯＮＳＩＮＲＥＬＡＴＩＯＮＡＬＤＡＴＡＢＡ...     

含空值关系数据库中关系代数的实现

本文从空值的完全语义出发，依据空值环境下信息等价和信息相容的含义，全面定义了空值环境下运算结果完备的关系代数运算，并对空值环境下关系代数运算的有效性和完备性进行了讨论。     

基于空值环境下扩展关系模型的查询处理研究

由于空值的出现，使数据库更新操作更趋势复杂。为适应更新要求，建立了扩展关系模型。本文正是基于这种模型进行对查询处理的讨论，给出了相应的查询策略及实现过程。     

模糊关系数据库查询的探究

模糊关系数据库查询在传统的关系型数据库语言本身在模糊范围内进行精确化查找,其要优于传统的关系数据库查询。本文主要对"模糊基础理论"、"模糊查询实现方法"进行了分析。     

糊糊空值环境下关系数据库的操作及查询处理

本文在经典关系数据库理论基础上引入模糊数学理论的基本思想和方法,对模糊空值环境下关系数据库的几种数学运算和基本关系操作进行了讨论,进而给出了查询处理中选择运算、差运算和连接运算的基本方法.     

基于关系数据库的模糊查询技术

在关系数据库中,SQL只能处理精确查询,而现实中存在许多模糊查询的问题。在模糊逻辑理论的基础上,提出了关系数据库的模糊查询思路,并详细地讨论了在数值和字符属性上的实现方法。实现方法不仅对数据库的查询进行了扩展,而且对实际系统的开发也有一定的借鉴作用。     

Null Inclusion Dependencies in Relational Databases

Functional dependencies (FDs) and inclusion dependencies (INDs) are the most fundamental integrity constraints that arise in practice in relational databases. We introduce null inclusion dependencies (NINDs) to cater for the situation when a database is incomplete and contains null values. We show that the implication problem for NINDs is the same as that for INDs. We then present a sound and complete axiom system for null functional dependencies (NFDs) and NINDs, and prove that the implication problem for NFDs and NINDs is decidable and EXPTIME-complete. By contrast, when no nulls are allowed, this implication problem is undecidable. This undecidability result has motivated several researchers to restrict their attention to FDs and noncircular INDs in which case the implication problem was shown to be EXPTIME- complete. Our results imply that when considering nulls in relational database design we need not assume that NINDs are noncircular.     

VISIONARY: a Viewpoint-based Visual Language for Querying Relational Databases

The adoption of a visual interface can simplify the query formulation process in DBMSs by enabling naive users to interact with a friendly environment. In this work, we propose a visual query language based on a diagrammatic paradigm, used for both data and query representation. The external data model is called vision and is made up of the visual primitives of concept and association. The external query model is based on the definition of a viewpoint, which is a perspective for accessing data defined dynamically by selecting a concept of primary interest. Internally, the data model is relational and the query language is SQL. An intermediate graph-based model ensures consistent mapping between the visual and the relational worlds. Our language has been implemented within a tool which can be mounted on top of any relational DBMS supporting ODBC. The system has been tested with naive users; the results of the experiment are reported and compared with those obtained with other visual languages.     

关系数据库中空值的影响与处理

为了实现不完全信息的处理,以关系数据库中空值的完全语义为基础,阐述空值的存在对数据库操作的影响,并给出几种处理空值的方法.对数据库理论研究人员以及数据库程序开发人员有一定的参考作用.     

基于关系模型的含空值关系数据库的数据更新

本文以空值的完全语义为基础，以空值环境下基于５值（５ＶＬ）的选择运算为工具，深入研究了基于关于模型的含空值关系数据库的数据更新策略和实现算法     

一种有效的估计关系数据库中空值的方法

由于客观世界的复杂性,信息缺失、不确定信息是普遍存在的。数据库作为表达现实世界的一种工具,使用空值来表达信息缺失的问题。针对关系数据库中的空值问题,提出一种基于模糊聚类和线性回归的空值估计方法。该方法首先对数据表中的数据进行挖掘,找出与被估计属性相关联的属性集。该过程仅利用数据本身提供的信息,避免了由专家决定条件属性时由于主观性造成的误差。其次根据所得属性集进行模糊聚类得到对原始数据的一个划分,再基于所得分簇和线性回归给出一个估计关系表中空值的方法。最后利用平均绝对错误率来衡量算法估值的准确率。实验结果表明该方法估值的结果与其他方法相比具有较高的准确率。     

关系数据库数字水印技术

随着知识产权保护和信息安全技术的发展,关系数据库数据存在所有权问题,可以采用数字水印技术对其进行数字所有权管理。该文分析了关系数据库中的数据和图像、声频、视频等多媒体数据的区别及关系数据库水印的特点,探讨了几种关系数据库数字水印技术,还分析了对关系数据库数据水印技术的攻击方式和理想的关系数据库水印技术。水印关系数据库对数据库的安全有着广阔前景和实际应用价值。     

Conceptual Modeling and Querying in Multimedia Databases

In this paper, we discuss some design principles that will aid in the design and querying of multimedia databases. We use an object-relational data model and argue that multimedia objects should normally have a special attribute called core which stores the real object itself in contrast to the abstraction which is reflected in the rest of the attributes. We present an extension to the ER Diagram that takes advantage of the core notion to facilitate design of multimedia databases. We discuss some desirable features in a query language for multimedia databases: simplifications like the use of path expressions and implicit use of functions (methods) as attributes, and explicit specification of the display layout and format either at the data definition level or query specification level. To materialize this last feature, we propose a display specification extension to SQL (SQL+D) that we have implemented.     

Table Oriented Metrics for Relational Databases

Developing and selecting high quality software applications are fundamental. It is important that the software applications can be evaluated for every relevant quality characteristic using validated metrics. Software engineers have been putting forward hundreds of quality metrics for software programs, disregarding databases. However, software data aspects are important because the size of data and their system nature contribute to many aspects of a systems quality. In this paper, we proposed some internal metrics to measure relational databases which influence its complexity. Considering the main characteristics of a relational table, we can propose the number of attributes (NA) of a table, the depth of the referential tree (DRT) of a table, and the referential degree (RD) of a table. These measures are characterized using measurement theory, particularly the formal framework proposed by Zuse. As many important issues faced by the software engineering community can only be addressed by experimentation, an experiment has been carried out in order to validate these metrics.     

Graph Transformation in Relational Databases

We present a novel approach to implement a graph transformation engine based on standard relational database management systems (RDBMSs). The essence of the approach is to create database views for each rules and to handle pattern matching by inner join operations while negative application conditions by left outer join operations. Furthermore, the model manipulation prescribed by the application of a graph transformation rule is also implemented using elementary data manipulation statements (such as insert, delete, update).     

A New Approach for Representing and Querying Textual Attributes in Databases

In this paper, a new approach to deal with textual attributes in databases is presented. The basic idea is to give a new representation for these attributes, so that it allows us to treat them together with and in the same way than the other database attributes in querying, data warehousing, data mining processes, etc. Additionally, the transformation process of the textual attribute implies the obtaining of a global representation, which includes a great part of the attribute meaning. Moreover, this representation can be improved by using an ontology during the querying process, which enables the semantic queries. The formal representation model is presented in the paper, as well as the mathematical bases for dealing with it. The whole implementation process is also described by using a medical database to show the experimental results. Finally, a set of semantic query examples are offered to explain the advantages of this new approach.