QBD STAR - A GRAPHICAL QUERY LANGUAGE WITH RECURSION

被引:65
作者
ANGELACCIO, M [1 ]
CATARCI, T [1 ]
SANTUCCI, G [1 ]
机构
[1] UNIV ROME,DIPARTMENTO INFORMAT & SISTEMIST,I-00185 ROME,ITALY
关键词
Database; expressive power; query language; query language completeness; visual language;
D O I
10.1109/32.60295
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
One of the main problems in the database area is to define query languages characterized by both high expressive power and ease of use. In this paper, we propose a system to query databases, using diagrams as a standard user interface. The system, called Query by Diagram* (QBD*), makes use of a conceptual data model, a query language on this model, and a graphical user interface. The conceptual model is the Entity-Relationship Model; the query language, whose expressive power allows recursive queries, supports visual interaction. The main characteristics of the interface are ease of use and the availability of a rich set of primitives for schema selection and query formulation. Furthermore, we compare the expressive power of QBD* and G+, which are the only languages allowing recursive queries to be expressed graphically. © 1990 IEEE
引用
收藏
页码:1150 / 1163
页数:14
相关论文
共 38 条
[1]  
Aho Alfred V., 1979, 6TH P ACM S PRINC PR, P110
[2]  
ANGELACCIO M, 1990, J VISUAL LANGUAGES C, V1
[3]  
ANGELACCIO M, 1989, OCT P WORKSH VIS LAN
[4]  
BATINI C, 1988, INFORM SYST, V13
[5]  
CATARCI T, 1988, 7TH P ENT REL C ROM
[6]   COMPUTABLE QUERIES FOR RELATIONAL DATA-BASES [J].
CHANDRA, AK ;
HAREL, D .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1980, 21 (02) :156-178
[7]  
CHEN P, 1976, ACM T DATA BASE SYST
[8]  
CODD EF, 1972, DATA BASE SYSTEMS, P65
[9]  
CRUZ IF, 1987, P ACM SIGMOD C MANAG
[10]  
CRUZ IF, 1988, 2ND P INT C EXP DAT, P355