System for querying databases automatically

• US 5,671,404 A
• Filed: 03/30/1995
• Issued: 09/23/1997
• Est. Priority Date: 03/31/1994
• Status: Expired due to Fees

• Current Assignee: Martin Lizee, Robert Lizee
• Original Assignee: Martin Lizee, Robert Lizee
• Inventors: Lizee, Robert, Lizee, Martin
• Primary Examiner(s): Black, Thomas G.
• Assistant Examiner(s): MIN, DONALD
• Application Number:
  US08/413,630
• Time in Patent Office: 908 Days
• Field of Search: 395/600, 395/602, 395/603, 395/604, 395/605, 395/606
• US Class Current: 1/1
• CPC Class Codes: G06F 16/2445 Data retrieval commands; View definitions
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99934 Query formulation, input preparation, or translation
• CPC Class Codes: Y10S 707/99935 Query augmenting and refining, e.g. inexact access
• CPC Class Codes: Y10S 707/99936 Pattern matching access

Abstract

A data processing system is disclosed to automatically query databases. The invention provides an Automatically Relaxable Query (ARQ) which includes a list of query conditions ordered in descending degree of importance. First, the database is queried on the first condition of the ARQ; if any object is found, the system labels this first condition. Then, the system proceeds with a query composed of all the conditions labelled previously in conjunction with the next condition of the ARQ; if any object is found then this next condition is labelled. And so on, in order, for all the remaining conditions of the ARQ until a predetermined termination condition is achieved. Finally, the system reports which conditions were labelled, and if the query composed of the labelled conditions matches only few objects of the database, they are automatically retrieved. The automatic querying with an ARQ enables faster searches, minimizes interaction between database and user and permits offline preparation of the search.

Claims

1. A method for automatically retrieving information from a database through a computer in communication with the database, the database having a plurality of retrieval objects, the computer defining a plurality of pre-ordered and distinct query conditions, wherein each query condition is ordered in a query condition list from the most important query condition to the least important query condition and wherein the most important query condition of the query condition list is initially designated as the current query condition, comprising the steps of:

a) testing the current query condition within the database to determine the number of database retrieval objects which satisfy the current query condition;

b) marking said current query condition if at least one database retrieval object satisfies the current query condition and designating the next pre-ordered and distinct query condition in the query condition list as the current query condition;

c) successively repeating steps a) and b) with each pre-ordered and distinct query condition of the query condition list in conjunction with all previously marked query conditions until a predetermined termination condition is satisfied.

2. A method as in claim 1 wherein after said predetermined termination condition is satisfied, step c) further comprises i) reporting the number of database retrieval objects which satisfy the query condition for each query condition;

and, ii) identifying said retrieval objects to the computer.

3. The method as in claim 2 wherein the pre-determined termination condition requires that all query conditions have been the current query condition or that a pre-set minimum number of database retrieval objects which satisfy the query condition is determined.

4. The method as in claim 3 wherein the database system is a relational database system.

5. The method as in claim 4 wherein the query condition is a structured query language (SQL) statement.

6. The method as in claim 3 wherein the database system is a full text database system and the retrieval objects are documents.

7. The method as in claim 6 wherein the query condition is a word or word group and the testing of step a) is satisfied if a database document includes said word or word group.

8. The method as in claim 7 wherein the computer is remote to the database and is connected to the database prior to the initiation of step a) and disconnected from the database after said termination condition is achieved.

9. The method as in claim 1 wherein the pre-determined termination condition requires that all query conditions have been the current query condition.

10. The method as in claim 1 wherein the pre-determined termination condition requires that all query conditions have been the current query condition or a pre-set minimum number of database retrieval objects found in step a) is determined.

11. The method as in claim 1 wherein step c) is continued while a pre-set maximum number is less than the number of database retrieval objects found in step a).

12. The method as in claim 1 wherein the database system is a relational database system.

13. The method as in claim 1 wherein the query condition is structured query language (SQL) statement.

14. The method as in claim 1 wherein the database system is a full text database system and the retrieval objects are documents.

15. The method as in claim 1 wherein the query condition is a word or word group and the testing of step a) is satisfied if a database document includes said word or word group.

16. The method as in claim 1 wherein the computer is remote to the database and is connected to the database prior to the initiation of step a) and disconnected from the database after said termination condition is achieved.

17. A method for retrieving information from a database by an automatically relaxable query through a computer having a link with the database, the database having a plurality of retrieval objects, each retrieval object satisfying one or more query conditions, the automatically relaxable query being defined in the computer as a list of at least two query conditions ordered from the most important query condition to the least important query condition wherein each query condition of the list can be marked and starts as being unmarked and where the first query condition starts as being designated as the current query condition, comprising the steps of:

(a) testing the database for retrieval objects, with a query composed of the conjunction of all marked query conditions and the current query condition if at least one query condition of the list is marked, or with a query composed of the current query condition if there is no query condition marked in the list;

(b) marking the current query condition if retrieval objects are found in step (a);

(c) repeating steps (a) and (b) with the next query condition of the list designated as the current query condition until a predetermined termination condition is satisfied.

18. An automatic information retrieval system for use with a computer having a link to a database system containing a plurality of retrieval objects, each retrieval object satisfying one or more query conditions, a query inputting device for specifying a query expressed as a conjunction of query conditions, the information retrieval system comprising:

(a) means for inputting a list of at least two query conditions ordered from the most important query condition to the least important query condition wherein each query condition of the list can be marked and starts as being unmarked;

(b) means for designating as the current query condition the first query condition of said list of query conditions;

(c) means for querying said database system for retrieval objects, using said query inputting device, with a query composed of said current query condition;

(d) means for marking said current query condition if retrieval objects are found in (c);

(e) means for designating as current query condition the next query condition in said list of query conditions.

(f) means for querying said database system for retrieval objects, using said query inputting device, with a query composed of the conjunction of all previously marked query conditions and said current query condition;

(g) means for marking said current query condition if retrieval objects are found in (f);

(h) means for repeating (e), (f) and (g) until all query conditions of said list have been designated once as current query condition.

19. An automatic information retrieval method for use with a computer having a link to a database system containing a plurality of retrieval objects, each retrieval object satisfying one or more query conditions, a query inputting device for specifying a query expressed as a conjunction of query conditions, the information retrieval method comprising the steps of:

(a) inputting a list of at least two query conditions ordered from the most important query condition to the least important query condition wherein each query condition of the list can be marked and starts as being unmarked;

(b) designating as the current query condition the first query condition of said list of query conditions;

(c) querying said database system for retrieval objects, using said query inputting device, with a query composed of said current query condition;

(d) marking said current query condition if retrieval objects are found in step (c);

(e) designating as current query condition the next query condition in said list of query conditions;

(f) querying said database system for retrieval objects, using said query inputting device, with a query composed of the conjunction of all previously marked query conditions and said current query condition;

(g) marking said current query condition if retrieval objects are found in step (f);

(h) repeating steps (e), (f) and (g) until all query conditions of said list have been designated once as current query condition.