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

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

关系数据库中分组查询的模糊扩展及去模糊机制

当前关系数据库模糊查询的研究中,涉及到分组查询having子句中的模糊条件或相对语言量词的较少。在模糊理论的基础上对having子句进行了模糊扩展,并利用模糊集合隶属函数的α截集将模糊的having子句转化为标准的SQL语句,因此可以利用RDBMS对记录进行筛选,保证了查询的效率。利用模糊集合基数的非模糊表示法来计算带量词的having语句,计算简单,结果简洁。     

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

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

基于汉语拼音的模糊查询及其在图书馆管理系统中的应用

在图书馆管理系统的查询功能中,模糊查询可以使得整个系统的查询、管理变得更简洁和高效。通过区位码实现汉字拼音模糊查询,主要介绍其基本思想、算法实现示例以及使用的实例,来展示拼音模糊查询的实现方法,解决汉字模糊查询的弊端。     

关系数据库上基于非数值属性关键词的模糊查询

关系数据库上的关键词查找技术使得用户像使用搜索引擎一样获取数据库中的相关数据.然而,这种技术只实现了精确查询,还不能很好地实现模糊查询.本文通过引进分类学习中的Rocchio算法并对其做小部分修改,用于数据库的关键词查询中,结合不同类型对象之间相异度和相关度的量化计算,每次返回的结果集按照相关度降序排列,实现精确到模糊的查询.如果用户不满意初始查询结果集,利用Rocchio算法经过几次交互,便可不断满足需求.对权值优化的Rocchio算法反馈过程进行了实验测试,结果证明是比较令用户满意的,而且返回的结果集中少量的不相关集合可以提高查询的性能.     

基于语言变量的关系数据库模糊查询

在模糊理论的基础上,将权重概念引入关系数据库模糊查询中,以体现用户对查询中各个属性的相对重视程度。记录按匹配度的降序输出,方便用户选择。权重和匹配度都是语言变量,取值为语言值,更加贴近自然。采用模糊集合的alpha截集去模糊的思想,将带语言值权重的模糊查询条件转化为精确的SQL语句,利用RDBMS的机制进行记录的筛选,避免对整个数据库表的扫描,在一定程度上保证查询的效率。     

基于MapX的动态图像绘制的新方法

以模糊数据与ERP的融合应用为背景,探讨了关系数据库上模糊数据库表的设计及相关的数据处理技术。与先前所提出的对预先确定的模糊子集直接“保存提取”的方式不同,通过一个实例——“剩余库存消耗天数预测”展示了一种以灵活的模糊查询为目标,“在查询时构建模糊集”的模糊数据库表设计。在所提出的数据库表中可减少对应于各预设模糊集的冗余记录。结合所提出的数据库表,探讨了模糊数据的归一化、排序、查询等处理方法与技术。     

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

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

模糊信息与ERP融合应用的关键技术

以模糊数据与ERP的融合应用为背景,探讨了关系数据库上模糊数据库表的设计及相关的数据处理技术.与先前所提出的对预先确定的模糊子集直接"保存-提取"的方式不同,通过一个实例--"剩余库存消耗天数预测"展示了一种以灵活的模糊查询为目标,"在查询时构建模糊集"的模糊数据库表设计.在所提出的数据库表中可减少对应于各预设模糊集的冗余记录.结合所提出的数据库表,探讨了模糊数据的归一化、排序、查询等处理方法与技术.     

VFP模糊查询技术的应用

主要讲解在数据库管理系统中实现模糊查询的方法与技巧,提供了能实现真正模糊查询的两个通用函数的源程序,分析了结构化查询语言SQL中的通配符的使用方法。     

Vague数据库Skyline查询技术研究

Skyline查询处理是近年来数据库领域的一个热门研究方向。由于现实世界中普遍存在着大量不精确、不确定的信息,Skyline查询也随之成为模糊数据处理中的一个重要内容。在已有研究的基础上,讨论了基于Vague关系数据模型的Skyline查询,其用于查询给定Vague关系中的任意元组确定不被该关系中的任意其它元组所支配的程度,并给出了相关的计算公式和查询算法,该算法可直接作用于Vague关系数据库,而无需对Vague关系数据库对应的所有可能性状态逐一进行扫描,具有较高的执行效率。在此基础上,还进一步讨论了带有预选择条件的Skyline查询的计算方法。     

Fuzzy query translation for relational database systems

The paper presents a new method for fuzzy query translation based on the alpha-cuts operations of fuzzy numbers. This proposed method allows the retrieval conditions of SQL queries to be described by fuzzy terms represented by fuzzy numbers. It emphasizes friendliness and flexibility for inexperienced users. The authors have implemented a fuzzy query translator to translate user's fuzzy queries into precise queries for relational database systems. Because the proposed method allows the user to construct his fuzzy queries intuitively and to choose different retrieval threshold values for fuzzy query translation, the existing relational database systems will be more friendly and more flexible to the users.     

A NEW METHOD FOR FUZZY QUERY PROCESSING IN RELATIONAL DATABASE SYSTEMS

In this paper, we present a new method for fuzzy query processing in relational database systems based on automatic clustering techniques and weighting concepts. The proposed method allows the query conditions and the weights of query items of users' fuzzy SQL queries to be described by linguistic terms represented by fuzzy numbers. Because the proposed fuzzy query processing method allows the users to construct their fuzzy queries more conveniently, the existing relational database systems will be more intelligent and more flexible to the users.     

Hybrid query execution engine for large attributed graphs

Graphs are widely used for modeling complicated data such as social networks, bibliographical networks and knowledge bases. The growing sizes of graph databases motivate the crucial need for developing powerful and scalable graph-based query engines. We propose a SPARQL-like language, G-SPARQL, for querying attributed graphs. The language enables the expression of different types of graph queries that are of large interest in the databases that are modeled as large graph such as pattern matching, reachability and shortest path queries. Each query can combine both structural predicates and value-based predicates (on the attributes of the graph nodes/edges). We describe an algebraic compilation mechanism for our proposed query language which is extended from the relational algebra and based on the basic construct of building SPARQL queries, the Triple Pattern. We describe an efficient hybrid Memory/Disk representation of large attributed graphs where only the topology of the graph is maintained in memory while the data of the graph are stored in a relational database. The execution engine of our proposed query language splits parts of the query plan to be pushed inside the relational database (using SQL) while the execution of other parts of the query plan is processed using memory-based algorithms, as necessary. Experimental results on real and synthetic datasets demonstrate the efficiency and the scalability of our approach and show that our approach outperforms native graph databases by several factors.     

Database Query Processing Using Finite Cursor Machines

We introduce a new abstract model of database query processing, finite cursor machines, that incorporates certain data streaming aspects. The model describes quite faithfully what happens in so-called “one-pass” and “two-pass query processing”. Technically, the model is described in the framework of abstract state machines. Our main results are upper and lower bounds for processing relational algebra queries in this model, specifically, queries of the semijoin fragment of the relational algebra.     

Query processing over object views of relational data

This paper presents an approach to object view management for relational databases. Such a view mechanism makes it possible for users to transparently work with data in a relational database as if it was stored in an object-oriented (OO) database. A query against the object view is translated to one or several queries against the relational database. The results of these queries are then processed to form an answer to the initial query. The approach is not restricted to a ‘pure’ object view mechanism for the relational data, since the object view can also store its own data and methods. Therefore it must be possible to process queries that combine local data residing in the object view with data retrieved from the relational database. We discuss the key issues when object views of relational databases are developed, namely: how to map relational structures to sub-type/supertype hierarchies in the view, how to represent relational database access in OO query plans, how to provide the concept of object identity in the view, how to handle the fact that the extension of types in the view depends on the state of the relational database, and how to process and optimize queries against the object view. The results are based on experiences from a running prototype implementation. Edited by: M.T. ?zsu. Received April 12, 1995 / Accepted April 22, 1996     

Rewriting rules to permeate complex similarity and fuzzy queries within a relational database system

In recent years, the availability of complex data repositories (e.g., multimedia, genomic, semistructured databases) has paved the way to new potentials as to data querying. In this scenario, similarity and fuzzy techniques have proven to be successful principles for effective data retrieval. However, most proposals are domain specific and lack of a general and integrated approach to deal with generalized complex queries, i.e., queries where multiple conditions are expressed, possibly on complex as well as on traditional data. To overcome such limitations, much work has been devoted to the development of middleware systems to support query processing on multiple repositories. On a similar line, We present a formal framework to permeate complex similarity and fuzzy queries within a relational database system. As an example, we focus on multimedia data, which is represented in an integrated view with common database data. We have designed an application layer that relies on an algebraic query language, extended with MM-tailored operators, and that maps complex similarity and fuzzy queries to standard SQL statements that can be processed by a relational database system, exploiting standard facilities of modern extensible RDBMS. To show the applicability of our proposal, we implemented a prototype that provides the user with rich query capabilities, ranging from traditional database queries to complex queries gathering a mixture of Boolean, similarity, and fuzzy predicates on the data.     

Précis: from unstructured keywords as queries to structured databases as answers

Précis queries represent a novel way of accessing data, which combines ideas and techniques from the fields of databases and information retrieval. They are free-form, keyword-based, queries on top of relational databases that generate entire multi-relation databases, which are logical subsets of the original ones. A logical subset contains not only items directly related to the given query keywords but also items implicitly related to them in various ways, with the purpose of providing to the user much greater insight into the original data. In this paper, we lay the foundations for the concept of logical database subsets that are generated from précis queries under a generalized perspective that removes several restrictions of previous work. In particular, we extend the semantics of précis queries considering that they may contain multiple terms combined through the AND, OR, and NOT operators. On the basis of these extended semantics, we define the concept of a logical database subset, we identify the one that is most relevant to a given query, and we provide algorithms for its generation. Finally, we present an extensive set of experimental results that demonstrate the efficiency and benefits of our approach.     

Efficient processing of nested Fuzzy SQL queries in a fuzzydatabase

In a fuzzy relational database where a relation is a fuzzy set of tuples and ill-known data are represented by possibility distributions, nested fuzzy queries can be expressed in the Fuzzy SQL language. Although it provides a very convenient way for users to express complex queries, a nested fuzzy query may be very inefficient to process with the naive evaluation method based on its semantics. In conventional databases, nested queries are unnested to improve the efficiency of their evaluation. In this paper, we extend the unnesting techniques to process several types of nested fuzzy queries. An extended merge-join is used to evaluate the unnested fuzzy queries. As shown by both theoretical analysis and experimental results, the unnesting techniques with the extended merge-join significantly improve the performance of evaluating nested fuzzy queries     

PAR平台数据库查询优化方案

数据库系统的查询优化技术是提高数据库系统效率的重要技术。当今Java和C＋＋等主流程序设计语言依靠SQL语句,造成数据库系统中查询复杂、繁琐、效率低下、可靠性得不到保证等。针对上述问题,在PAR（Partition And Recur）平台数据库关系代数实现机制基础上,提出和实现基于关系代数的查询优化规则设计方法。这种设计不仅提高了数据库查询效率,也为高可靠数据库的形式化开发提供了依据。