Semi-boolean arrangement, method, and system for specifying and selecting data objects to be retrieved from a collection

• US 20040215612A1
• Filed: 04/21/2004
• Published: 10/28/2004
• Est. Priority Date: 04/28/2003
• Status: Abandoned Application

• Current Assignee: Moshe Brody
• Original Assignee: Moshe Brody
• Inventors: Brody, Moshe
• Application Number:
  US10/830,565
• Publication Number:
  US 20040215612A1
• Time in Patent Office: Days
• US Class Current: 707/3
• CPC Class Codes: G06F 16/332 Query formulation
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques
• CPC Class Codes: G06F 16/9532 Query formulation
• CPC Class Codes: G06F 16/9538 Presentation of query results

Abstract

A semi-Boolean arrangement for specifying data objects to be retrieved from a collection, and a method and system for selecting the data objects, which combine text searching and set operations on existing subsets of data objects from the collection. This optimized relaxation of a full Boolean search complies with natural human language patterns to greatly simplify query structure, formulation, and interpretation without loss of generality. The use of subsets, including arbitrary subsets compiled by the user or a proxy, enables the user to control the level of vagueness and ambiguity inherent in text searching to reduce under-inclusion without relying on evidence sets or meta-data such as keywords, as well as to reduce over-inclusion, for which there is currently no satisfactory means of control. The use of arbitrary subsets instead of keywords also offers advantages by not requiring modifications to the data objects in order to categorize the data objects by ideas or concepts contained therein. A formal query structure is provided, which conforms to natural human language and conceptualization patterns allowing simple and intuitive formulation of an important class of Boolean queries without parentheses for grouping expressions, and in a manner which facilitates automatic parsing and query construction. Also, a general format for a graphical user interface is presented, which works with the user to formulate queries and guarantees that all queries will be a priori syntactically-correct, thereby completely eliminating the possibility of user syntax errors and the need for notifying users thereof.

Claims

1. A query data structure in machine-accessible data storage for specifying machine-readable data objects to be retrieved from a data object collection, the query comprising a non-empty set of machine-readable selection rules, at least one of which contains a non-empty set of machine-readable selection terms, wherein:

(a) each of said selection terms specifies a corresponding selection term subset of the data object collection;

(b) each of said selection rules is of a type selected from the group consisting of;

i) inclusion selection rule type; and

ii) exclusion selection rule type;

(c) each of said selection rules specifies a corresponding selection rule subset of the data object collection, wherein;

i) for a selection rule of said inclusion selection rule type, said selection rule subset is the union of said selection term subsets corresponding to said selection terms contained in said selection rule; and

ii) for a selection rule of said exclusion selection rule type, said selection rule subset is the complement of the union of said selection term subsets corresponding to said selection terms contained in said selection rule; and

(d) the query data structure specifies a query result subset of the data object collection, wherein said query result subset is the intersection of said selection rule subsets corresponding to said selection rules of the query.

2. The query data structure of claim 1, wherein each of said selection terms is of a type selected from the group consisting of:

i) pre-existing arbitrary subset type; and

ii) pre-existing query type.

3. The query data structure of claim 1, wherein the data object collection has at least one data object containing a formal data attribute, and wherein each of said selection terms is of a type selected from the group consisting of:

i) pre-existing arbitrary subset type;

ii) pre-existing query type; and

iii) mathematical expression on the formal data attribute.

4. The query data structure of claim 1, said non-empty set of machine-readable selection rules containing a plurality of selection rules at least one of which contains a non-empty set of machine-readable selection terms containing a plurality of selection terms, and wherein each of said selection terms is of a type selected from a group consisting of:

i) pre-existing arbitrary subset type;

ii) pre-existing query type; and

iii) text search.

5. A method for automatically evaluating a query by a data processing device and retrieving machine-readable data objects specified by the query from a data object collection, the query containing a non-empty set of machine-readable selection rules, at least one of which contains a non-empty set of machine-readable selection terms, wherein each selection rule is of a type selected from the group consisting of inclusion selection rule type and exclusion selection rule type, the method comprising:

(a) providing storage for a query result subset;

(b) providing storage for a selection rule result subset;

(c) for each selection rule;

i) determining the selection terms;

ii) for each selection term;

determining a selection term result subset;

replacing said selection rule result subset with the set union of said selection rule result subset and said selection term result subset;

iii) if the selection rule is of exclusion selection rule type, replacing said selection rule result subset with the complement of said selection rule subset; and

(d) replacing said query result subset with the set intersection of said query result subset and said selection rule subset.

6. A computer program product comprising machine-accessible data storage containing a computer program operative to execute the method of claim 5.

7. A system for automatically evaluating a query and retrieving machine-readable data objects specified by the query from a data object collection, the query including a set of selection rules, each including a set of selection terms, the system comprising:

(a) a selection rule extractor, for obtaining the selection rules of the query;

(b) a selection rule evaluator, for obtaining a selection rule result subset of the data object collection;

(c) a selection term extractor, for obtaining the selection terms of a selection rule;

(d) a selection term evaluator, for obtaining a selection term result subset of the data object collection;

(e) a union calculator, for producing said selection rule result subset in conjunction with said selection term extractor and said selection term evaluator, by calculating the set union of the selection term result subsets corresponding to the selection terms of a selection rule; and

(f) an intersection calculator, for producing a query result subset of the data object collection in conjunction with said selection rule extractor and said selection rule evaluator, by calculating the set intersection of the selection rule result subsets corresponding to the selection rules of the query;

wherein said query result subset contains the machine-readable data objects specified by the query.

8. The system of claim 7, wherein each selection rule is of a type selected from the group consisting of inclusion selection rule type and exclusion selection rule type, the system further comprising:

(g) an inclusion/exclusion discriminator for determining the type of each selection rule in the query; and

(h) a complement calculator, for calculating the set complement, in the data object collection, of a selection rule result subset corresponding to a selection rule of exclusion selection rule type.

9. The system of claim 7, wherein each selection term is of a type selected from the group consisting of:

i) pre-existing arbitrary subset type;

ii) pre-existing query type;

iii) mathematical expression on a formal data attribute; and

iv) text search.

10. A data terminal user interface for enabling a user to construct a machine-readable query data structure for specifying data objects to be retrieved from a data object collection, the query data structure containing a set of machine-readable selection rules, each containing a set of machine-readable selection terms, the user interface comprising:

(a) a presentation of selection rules, wherein the user can choose a selection rule therefrom;

(b) a presentation of selection terms, wherein the user can choose a selection term therefrom,

(c) a presentation of pre-existing subsets of the data object collection; and

(d) a cursor;

wherein the user can choose a pre-existing subset for constructing a selection term and a selection term for constructing a selection rule of the query data structure under construction.

11. The user interface of claim 10, further comprising:

(e) a presentation of pre-existing queries.

12. The user interface of claim 10, wherein a selection rule is of a type selected from the group consisting of inclusion selection rule type and exclusion selection rule type, the user interface further comprising:

(e) a presentation of the type of selection rule.

13. The user interface of claim 10, wherein a selection term is operative to text searching, the user interface further comprising:

(e) a presentation of text; and

(f) an input device for text typing.

14. The user interface of claim 10, furthermore operative to enable a user to modify an existing query data structure.