Browse Prior Art Database

Visual Interface Using "Join" Information on Relational Database

IP.com Disclosure Number: IPCOM000036789D
Original Publication Date: 1989-Oct-01
Included in the Prior Art Database: 2005-Jan-29
Document File: 3 page(s) / 40K

Publishing Venue

IBM

Related People

Kajitani, K: AUTHOR [+2]

Abstract

Disclosed is a method for making conditional queries with a card-type user interface on a relational database system. The method provides conventional relational operations (Union, Intersection, Set difference, Cartesian product, Projection, Selection, Join) and a new operation "Navigation" that is a kind of Selection. The user can do these operations by an easy, direct manipulation on the screen, not by inputting command language. Card deck

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 54% of the total text.

Page 1 of 3

Visual Interface Using "Join" Information on Relational Database

Disclosed is a method for making conditional queries with a card-type user interface on a relational database system. The method provides conventional relational operations (Union, Intersection, Set difference, Cartesian product, Projection, Selection, Join) and a new operation "Navigation" that is a kind of Selection. The user can do these operations by an easy, direct manipulation on the screen, not by inputting command language. Card deck

The card-type interface described in this article represents a relation as a set of cards (called "card deck"). Each card is a representation of a tuple in the relation. See Fig. 1. A card deck consists of 3 parts: "title area", "menu area" and "card area". The title area includes the name of the relation represented by the deck. The menu area includes menu items. The card area includes the content of a

(Image Omitted)

card. In Fig. 1, there are n fields. A field consists of a field name (e.g., "F1") and a field value (e.g., "value1"). Let D1 and D2 be "card decks". If both have n fields and the i-th field on each card deck has the same data type for all i (=1,2,...,n), these card decks have the same "card format". Navigation

The user can define the special information for join operation on the schema of the database. For example, Fx = Fy, where Fx is a field in a relation R1 and Fy is a field in a relation R2. Note that the user does not have to define this information at each instance (tupple). The operation "Navigation" uses this information. Let R1 and R2 be represented by card decks D1 and D2, respectively, and let it be that Fx (in R1) = Fy (in R2). When the user double clicks by mouse on the field Fx, the cards in D2, whose value of Fy is same as the value of Fx on D1, appear on the screen. It is "Navigation". Union, Intersection and Difference

The user can perform set operations ("Union", "Intersection" and "Set differe...