Intelligent discard in information access system

• US 7,127,450 B1
• Filed: 05/02/2000
• Issued: 10/24/2006
• Est. Priority Date: 05/02/2000
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Lau, Raymond, Chang, Jane Wen, McCandless, Michael Kyle
• Primary Examiner(s): Breene, John
• Assistant Examiner(s): LEWIS, CHERYL RENEA
• Application Number:
  US09/562,547
• Time in Patent Office: 2,366 Days
• Field of Search: 707/3, 707/4, 707/5, 707/6, 707/7, 707/2, 707/100, 345/967, 345/968, 345/853, 345/854, 345/855
• US Class Current: 1/1
• CPC Class Codes: G06F 16/2458 Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
• CPC Class Codes: G06F 16/338 Presentation of query results
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99935 Query augmenting and refining, e.g. inexact access

Abstract

A method of discarding results of a search of a collection of data includes parsing a query to produce fragments, searching the collection of data for matches to the fragments, determining a number of matches, placing the matches in a hierarchical tree data structure, determining an amount of space to display the matches, eliminating matches in the hierarchical tree data structure to fit within the amount of space and summarizing the eliminated matches.

Claims

1. A computer-implemented method of discarding results of a search of a collection of data comprising:

parsing a query to produce search fragments;

searching the collection of data for matches to the search fragments;

determining a number of matches;

placing the matches in a hierarchical tree data structure;

determining an amount of space to display the matches;

eliminating matches in the hierarchical tree data structure to fit within the amount of space;

generating a content summary of the eliminated matches; and

displaying the matches in the hierarchical tree data structure and the content summary.

2. The computer-implemented method of claim 1 wherein the collection of data is a relational database.

3. The computer-implemented method of claim 1 wherein the collection of data is an XML database.

4. The computer-implemented method of claim 1 wherein the placing the matches in the hierarchical tree data structure comprises arranging the matches in the hierarchical data structure according to a taxonomy.

5. The computer-implemented method of claim 1 wherein the eliminating matches comprises eliminating matches in a lowest position of the hierarchical tree data structure.

6. The computer-implemented method of claim 1 wherein the summarizing comprises:

organizing the eliminated matches according to taxonomy; and

preserving eliminated matches as members of the taxonomy.

7. A computer program, residing on a computer-readable medium, comprising instructions for causing a computer to:

parse a query to produce search fragments;

search a collection of data for matches to the search fragments;

determine a number of matches;

place the matches in a hierarchical tree data structure;

determine an amount of space to display the matches;

eliminate matches in the hierarchical tree data structure to fit within the amount of space;

generate a content summary the eliminated matches; and

display the matches in the hierarchical tree data structure and the content summary.

8. A computer implemented method of displaying database search results comprising:

searching a database for matches to search fragments parsed from a query;

determining an amount of space to display matches;

placing matches in a hierarchical tree data structure;

discarding matches in the hierarchical tree data structure according to a hierarchical taxonomy if the total number of matches exceeds the amount of space to display the matches; and

displaying non-discarded matches along with a content summary of discarded matches.

9. The method of claim 8 in which the query is text received from a user.

10. The method of claim 8 in which the hierarchical taxonomy comprises:

fields directly related to the fragments; and

fields tangentially related to the fragments.

11. The method of claim 10 in which discarding comprises:

eliminating rows of matches where the eliminated rows have a minimum number of distinct values in the directly related fields; and

summarizing the eliminated rows.

12. The method of claim 11 in which discarding further comprises:

eliminating rows of matches where the eliminated rows have a minimum number of distinct values in the tangentially related fields; and

summarizing the eliminated rows.

13. The method of claim 8 in which the content summary comprises ranges of data for the discarded matches.

14. The method of claim 8 in which the content summary comprises lists of values for the discarded matches.

15. A computer implemented method comprising:

receiving, a query;

matching elements contained in a database to search fragments parsed from the query;

determining an amount of space on an input/output device to display the matched elements;

placing the matched in a hierarchical tree data structure;

collapsing selected matched elements in the hierarchical tree data structure into a content summary if the total number of matched elements exceeds the amount of space to display the matches on the input/output device; and

displaying non-discarded matched elements and the content summary on the input/output device.

16. The method of claim 15 in which collapsing comprises discarding matched elements according to hierarchical taxonomies.

17. The method of claim 16 in which the taxonomies are identified fields in the hierarchical tree data structure.

18. The method of claim 15 in which the summary includes information about discarded rows in the hierarchical tree data structure.

19. An article comprising:

a storage medium having stored thereon instructions that when executed by a machine result in the following;

search a database for matches to search fragments parsed from a query;

determine an amount of space to display matches;

place matches in a hierarchical tree data structure;

discard matches in the hierarchical tree data structure according to a hierarchical taxonomy if the total number of matches exceeds the amount of space to display the matches; and

display non-discarded matches along with a content summary of discarded matches.

20. An article comprising:

a storage medium having stored thereon instructions that when executed by a machine result in the following;

receive a query;

match elements contained in a database to search fragments parsed from the query;

determine an amount of space on an input/output device to display the matched elements;

place the matched in a hierarchical tree data structure;

collapse selected matched elements in the hierarchical tree data structure into a content summary if the total number of matched elements exceeds the amount of space to display the matches on the input/output device; and

display non-discarded matched elements and the content summary on the input/output device.