Patent US5471613A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5471613A Expired / Lapsed US ⏱️ 0.0 years remaining

Tree structure representation of an SQL clause

Assignee: International Business Machines Corp
•
Filing: 1994-08-11
•
Granted: 1995-11-28
•
Expires: 2014-08-11
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

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.

Inventors

  • 👤 Kenneth R. Banning
  • 👤 Wendy S. James
  • 👤 Shih-Gong Li
  • 👤 Anton Versteeg

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-30 23:49
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/20; G06F16/24; G06F16/242; G06F16/2428; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99933; Y10S707/99934

Claims Analysis

Total Claims: 7
Claim 1
Independent Claim 117 words
A computer system for accessing information in a relational database of a computer, comprising: means for a user of the computer to define predicates of a query to be executed in the computer by direct graphical manipulation of images on a video display of the computer; means for depicting WHERE or HAVING clauses of the query in graphical format on the video display of the computer and in response to user manipulation using a tree structure which links three or more predicates for a logical operator; means for deriving an SQL statement equivalent of the tree structure which links three or more predicates; and means for accessing information from the relational database using the derived SQL statement.
Claim 2
Dependent Claim 117 words
A computer system for accessing information in a relational database of a computer, comprising: means for a user of the computer to define predicates of a query to be executed in the computer by direct graphical manipulation of images on a video display of the computer; means for depicting WHERE or HAVING clauses of the query in graphical format on the video display of the computer and in response to user manipulation using a tree structure which links three or more predicates for a logical operator; means for deriving an SQL statement equivalent of the tree structure which links three or more predicates; and means for accessing information from the relational database using the derived SQL statement.
Claim 3
Dependent Claim 15 words
The system recited in claim 1, wherein the logical operators are AND and OR functions.
Claim 4
Dependent Claim 28 words
The system recited in claim 2, wherein the means for a user to define a query includes both keyed alphanumeric entry and user actuated graphic control device entry.
Claim 5
Dependent Claim 141 words
A computer implemented method for creating a database search in a relational database of a computer, comprising the steps of: graphically defining within the computer one or more logical operators of a query by direct user manipulation of images on a video display of the computer; graphically defining within the computer three or more predicates of the query by direct user manipulation of images on a video display of the computer; defining within the computer a WHERE or HAVING clause for the query through links relating three or more predicates to a common logical operator by direct user manipulation of graphical format images on the video display of the computer; deriving within the computer an SQL statement equivalent of the WHERE or HAVING clauses for the query; and executing a relational database search within the computer using the derived SQL statement.
Claim 6
Dependent Claim 141 words
A computer implemented method for creating a database search in a relational database of a computer, comprising the steps of: graphically defining within the computer one or more logical operators of a query by direct user manipulation of images on a video display of the computer; graphically defining within the computer three or more predicates of the query by direct user manipulation of images on a video display of the computer; defining within the computer a WHERE or HAVING clause for the query through links relating three or more predicates to a common logical operator by direct user manipulation of graphical format images on the video display of the computer; deriving within the computer an SQL statement equivalent of the WHERE or HAVING clauses for the query; and executing a relational database search within the computer using the derived SQL statement.
Claim 7
Dependent Claim 15 words
The method recited in claim 4, wherein the logical operators are AND and OR functions.

References Cited (Backward Citations)

US4451901A Cited
US4688195A Cited
US4506326A Cited
US4829427A Cited
US5091852A Cited
US5175814A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1998-11-27 1999-05-29 1999-11-28 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2002-11-27 2003-05-29 2003-11-28 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2006-11-27 2007-05-29 2007-11-28 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag