Browse Prior Art Database

User-Defined Logical Relationship in Visual Query

IP.com Disclosure Number: IPCOM000102247D
Original Publication Date: 1990-Nov-01
Included in the Prior Art Database: 2005-Mar-17
Document File: 2 page(s) / 63K

Publishing Venue

IBM

Related People

Banning, KR: AUTHOR [+3]

Abstract

Disclosed are 3 ways to define a UDLR (User Defined Logical Relationship). The basic logical operators in Predicate Logics are AND, OR and NOT (negation). In a SQL query statement, the logical relationships between predicates are normally described as logical AND or logical OR. When a certain pattern of logical relationships between a set of predicates occurs, the user has to define the pattern each time. This becomes annoying and is prone to errors when the same pattern is frequently used on different sets of predicates.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 52% of the total text.

User-Defined Logical Relationship in Visual Query

       Disclosed are 3 ways to define a UDLR (User Defined
Logical Relationship).  The basic logical operators in Predicate
Logics are AND, OR and NOT (negation).  In a SQL query statement, the
logical relationships between predicates are normally described as
logical AND or logical OR.  When a certain pattern of logical
relationships between a set of predicates occurs, the user has to
define the pattern each time. This becomes annoying and is prone to
errors when the same pattern is frequently used on different sets of
predicates.

      In a visual query model, the logical relationship of predicates
in the WHERE clause (as well as the HAVING clause) is represented by
a tree structure.  To define a new logical relationship among a set
of predicates, three alternatives are provided.

      These are:
      (1)  A window to allow the user to define the logical
relationship graphically. The user can create variable nodes
representing predicates, then use direct manipulation techniques to
build the tree structure.  A name for this logical relationship is
required.
      (2)  A form-like window to allow the user to specify the truth
table for the logical relationships. The variable names representing
predicates are automatically generated by the system.  The user must
specify the name for this new logical relationship.  The tree
representation of this logical relationship is then automatically
generated.
      (3)  A text window to allow...