一个可视知识查询语言CAOBS／VKQL

介绍的ＣＡＯＢＳ／ＶＫＱＬ是一个可视知识查询语言，它以灵活，直观，方便的图形操纵方式提供给用户访问、查询知识库的强大能力。该语文的查询模型以ＲＩＫＯＭ知识模型为基础，用户通过构造查询图来表达查询要求。     

面向对象知识库系统CAOBS／V1.2的设计与实现

文中介绍了一个面向对象知识库系统ＣＡＯＢＳ／Ｖ１．２。该系统是在一个面向对象数据库管理系统基础上进行开发的。我们重点研究了面向对象的知识表示、可视查询、问题的推理求解与知识的获取机制。在ＣＡＯＢＳ／Ｖ１．２系统中，问题推理求解采用基于事例的推理，辅之以基于规则的推理模式。我们还开发了一种新型的可视知识查询语言－ＶＫＱＬ，其查询的直观性和方便性均要强于传统的文本查询语言。文中论述了ＣＡＯＢＳ／Ｖ１．     

KBASE－P知识库系统的设计与实现

当前的实用知识库系统研究是将知识库查询语言嵌入到一个过程语言中．ＫＢＡＳＥ－Ｐ是一个通用的知识库程序设计语言．ＫＢＡＳＥ－Ｐ以ＫＢＡＳＥ作为查询语言，以ＦＤ－ＰＲＯＬＯＧ（我们开发的一个ＰＲＯＬＯＧ扩充）为过程性的宿主语言执行１／Ｏ和ＤＢ更新操作（用扩充的内部谓词）．由于良好的设计和实现，查询语言与宿主语言之间的阻抗不匹配问题相对较小．因而，ＫＢＡＳＥ－Ｐ是一个比较实用的知识库程序设计语言．ＫＢＡＳＥ－Ｐ系统支持逻辑程序设计语言（ＫＢＡＳＥ－Ｐ语言）的程序开发，提供了文本编辑、文件管理、谓词管理、事实操作、Ｄａｔａｌｏｇ查询、ＳＱＬ查询等功能．本文详细介绍了ＫＢＡＳＥ－Ｐ系统的设计和实现．     

数据库的可视查询语言VQL

本文阐述数据库语言从ＱＢＥ到ＶＱＬ的发展过程，ＶＱＬ能表达ＯＯＤＢ的查询，是一个能表达否定，组合和受限全称量词的可视的数据库查询语言。     

一种可视查询语言OSVQL的设计与实现

该文基于对象结构提出了一种可视查询语言ＯＳＶＱＬ,给出了其若干定义,讨论了ＯＳＶＱＬ的设计思想与实现方法。     

KBASE—P知识库系统的设计与实现

当前的实用知识库系统研究是将知识库查询语言嵌入到一个过程语言中。ＫＢＡＳＥ－Ｐ是一个通用的知识库程序设计语言。ＫＢＡＳＥ－Ｐ以ＫＢＡＳＥ作为查询语言，以ＦＤ－ＰＲＯＬＯＧ（我们开发的一个ＰＲＯＬＯＧ扩充）为过程性的宿主语言执行Ｉ／Ｏ和ＤＢ更新操作（用扩充的内部谓词）。由于良好的设计和实现，查询语言与宿主语言之间的阻抗不匹配问题相对较小。因而，ＫＢＡＳＥ－Ｐ是一个比较实用的知识库程序设计语言。ＫＢＡ     

一个可处理不确定性知识的专家系统开发工具

介绍了用面向对象的可视化语言Ｖｉｓｕａｌ Ｃ＋＋实现的一个可处理不确定性知识的专家系统开发工具ＲＥＳＴＯＯＬ,着重描述了其知识库组织、不精确推理机的实现及推进过程可视化,并给出了一个运行实例。     

一种通用的智能化可视框架

为经推理过程产生的影像提供了一种通用的可视化框架,这一框架与以往采用的方法有很大的区别：可视化系统将从一个基于外部数据源的知识库中取回可视信息,从而能够满足用户的不同可视化需求。这一知识库由用户以逻辑语言编写,主要包括关于可视目标、它们的相互关系以及其几何视觉特征的描述。此外详细介绍了知识的表达方式,同时运用一个简单的实例来对其智能可视化进行说明。     

在SQL查询中使用变量和VB函数的方法

通过一个实例介绍在ＶＢ５．０环境下如何在ＳＱＬ查询中使用变量和ＶｉｓｕａｌＢａｓｉｃ函数的方法。该方法提高了ＳＱＬ语言的灵活性,充分发挥了ＳＱＬ的优越性。     

可视化空间数据库查询语言CQL

本文着重从语法、语义及语用三方面介绍了我们所开发的一个可视化空间数据库查询语言ＣＱＬ。该语言允许用户借助于可视化基本元素－－－卡片进行编程,实现对窨数据库的检索。用户查询语句是这些卡片的空间组合。该语言对查询结果的表示提供了多种形式：图形表示形式、正文表示形式、临时文件或三者的组合形式。     

DVQ: Towards Visual Query Processing of XML Database Systems

XML has been recognized as a promising language for data exchange over the Internet. A number of query languages have been proposed for querying XML data. Most of those languages are path-expression based. One difficulty in forming path-expression based queries is that users have to know the structure of XML data against which the queries were issued. In this paper, we describe a DTD-driven visual query interface for XML database systems. With such an interface, a user can easily form path-expression based queries by clicking elements in the DTD tree displayed on the screen and supplying conditions if necessary. The interface and the query generation process are described in detail.     

Query by diagram: A visual environment for querying databases

In recent years, several attempts have been made to define query languages characterized by both high expressive power and easy query formulation. Several issues concern graphical applications, based on the diagrammatic representation of a semantic model and visual interaction. This paper describes the architecture and the implementation of a graphical query system, based on the diagrammatic representation of entity relationship schemata. The query language underlying the system allows the formulation of recursive queries; moreover, user interaction in both managing diagrams and expressing queries is simplified by the presence of a fully visual environment and a rich set of interaction strategies.     

Producing Interoperable Queries for Relational and Object-Oriented Databases

In this paper, we develop techniques to produce interoperable queries with object and relational databases. A user poses a local query in a local query language, against a local object or relational schema. We transparently produce appropriate queries with respect to a remote target object or relational schema, corresponding to some remote database which contains data relevant to the user's query. Mapping knowledge to resolve representational heterogeneities in local and remote schemas is expressed in a canonical representation, CRmapping, and is independent of the particular data model. A canonical representation CRquery is also used to resolve heterogeneities of query languages. A set of heterogeneous transformation algorithms define the appropriate transformations from the local queries to the remote queries. The use of canonical representations (CR) allows us to represent queries independent of the particular query language, and to resolve representational conflicts in a uniform manner, independent of models and query languages.     

PICASSO: A graphical query language

PICASSO (PICture Aided Sophisticated Sketch Of database queries) is a graphics-based database query language designed for use with a universal relation database system. The primary objective of PICASSO is ease of use. Graphics are used to provide a simple method of expressing queries and to provide visual feedback to the user about the system's interpretation of the query. Inexperienced users can use the graphical feedback to aid them in formulating queries whereas experienced users can ignore the feedback. Inexperienced users can pose queries without knowing the details of underlying database schema and without learning the formal syntax of SQL-like query language. This paper presents the syntax of PICASSO queries and compares PICASSO queries with similar queries in standard relational query languages. Comparisons are also made with System/U, a non-graphical universal relation system on which PICASSO is based. The hypergraph semantics of the universal relation are used as the foundation for PICASSO and their integration with a graphical workstation enhances the usability of database systems.     

利用客户端脚本实现复合查询的新思路

本文主要针对目前网站上常用的查询系统所存在的某些常见问题而提出了一种新的查询设计思路,这种新的设计思路主要是在客户端利用JavaScript脚本语言对用户设置的查询条件进行预处理,让用户设置的条件以两种形式出现在系统中,一种形式方便方便用户阅读和理解,另一种形式用于真正的数据查询;此外,通过脚本语言将用户设置的查询条件保存于页面上列表中,用户可以随意组合现有的条件形成更为复杂的查询条件;同时用户也可以在列表中随意选择某个条件执行数据查询。     

Classifying Ambiguities in a Visual Spatial Language

Geographic information systems (GIS) manage geographical data and present the results visually using maps. Visual languages are well adapted to query such data. We propose to express queries sent to a GIS using symbolic maps with metaphors, i.e., visual representation of the spatial relationships making up the query. Visual languages suffer from the appearance of ambiguity. We distinguish visual ambiguities from selection ambiguities. Visual ambiguities appear when a given visual representation of a query corresponds with several interpretations. In order to define new spatial relationship, the user points out one (or several) metaphor(s) already available in the restitution space. Selection ambiguities appear when a given selection corresponds with several metaphors. We suggest palliating visual and selection ambiguities by associating a placing method with composition automata. The placing method insures to minimize level of ambiguity. We determine levels of ambiguity and user interaction complexity depending on the required expressive power. The higher the desired expressive power is, the higher the level of ambiguity is and thus the more complex the user interaction is. A prototype has been implemented to validate the placing method and the automaton allowing the highest expressive power.