Tree structure representation of an SQL clause

Details Tree structure representation of an SQL clause Tree structure representation of an SQL clause

1994-08-11

1995-11-28

Black, Thomas G.

Boots, shoes, and leggings

3649741, 3649746, 364963, 364DIG2, G06F 1730

Patent

active

054716136

ABSTRACT:
A system, program and method for graphically representing a WHERE or HAVING clause of an SQL query directed to a relational database. Logical operators are defined and linked to predicates using a tree structure format. The tree is not binary in character and consequently exhibits a 1:1 relation between the predicates and tree leaves. The tree structure representation provides intuitive feedback to the user defining the query. Preferably the SQL format and tree structure graphic format queries appear simultaneously on the video display of the computer system used to define the query.

REFERENCES:
patent: 4451901 (1984-05-01), Wolfe et al.
patent: 4506326 (1985-03-01), Shaw et al.
patent: 4688195 (1987-08-01), Thompson et al.
patent: 4829427 (1989-05-01), Green
patent: 5091852 (1992-02-01), Tsuchida et al.
patent: 5175814 (1992-12-01), Anick et al.
"Method of Detecting Atomic Boolean Factors" IBM Technical Disclosure Bulletin v. 32 n. 5B pp. 368-375 (1989).
Neill "Introduction to Computer Science" West Publishing pp. 305-336 (1979).
Anick et al "A Direct Manipulation Interface for Boolean Information Retrieval via Natural Language Query" ACM Proc. Int'l SIGIR '90, pp. 135-150, 1990.

Affiliated with

Also associated with

Rating

Tree structure representation of an SQL clause does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Tree structure representation of an SQL clause, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tree structure representation of an SQL clause will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2020694