Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
1998-12-22
2002-03-26
Lintz, Paul R. (Department: 2171)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C345S215000
Reexamination Certificate
active
06363377
ABSTRACT:
TECHNICAL FIELD
This invention relates generally to the field of search techniques used on information management system or on the global information network (“the World Wide Web”). More specifically, the present invention is a method and system for refining and improving search queries and for organizing the results of a search query by different and overlapping criteria.
BACKGROUND OF THE INVENTION
The blossoming of the World Wide Web in the 1990s has given computer users access to vast quantities of information, an estimated 100-300 million Web pages, many terabytes of data. The user provides the Uniform Resource Locator (“URL”) of a page to the browser, the browser retrieves the page from the Internet and displays it to the user. When the user knows the URL of the page, the procedure is simple. However, to find information on the Web, the user must access a search engine. The user submits a query and the search engine returns a list of URL's of pages that satisfy the query together with a summary of each page. The continuing exponential growth of the Web makes the task of finding the relevant information exceedingly difficult. This effort is further aggravated by the unorganized and extremely dynamic nature of the Web.
There are two paths to searching for information on the Web. One path is consulting a manually compiled Web catalog, such as Yahoo. Any manual catalog of the Web necessarily suffers two drawbacks: the nature of the information on the Web makes any cataloging efforts necessarily limited and incomplete, and the catalog offers no help to a user interested in a subject that happens not to be covered by the catalogers.
The other path to searching for information on the Web is using a Web engine. The major ones as of January 1998 are AltaVista, Excite, HotBot, InfoSeek, Lycos, NorthernLight, and Web Crawler, plus a number of branded versions of these. These engines send out programs called robots, or crawlers, which automatically peruse the Web and gather Web pages they discover. The collected pages are automatically indexed and collected into a data base. In this process, known as indexing, Internet URLs are associated with relevant words from the page they identify. Many search engines store page summaries along with URLs. Page summarization varies from one search engine to another. Some search engines store the first fifty words of a document. Other engines, try to understand the content of the pages. They attempt to define relevant “ideas” based on associations of words within documents and they summarize the Web Pages by storing these “ideas”. The users can query the indices for pages meeting certain criteria. For example, a user can request all the Web pages found by the search engine that have the phrase “cryptography software” somewhere in the text. There are two major problems with using the search engines: 1) incomplete coverage and 2) difficulty of effective use. Not a single engine contains a complete index of the Web; they index anywhere from 2 million pages by WebCrawler to 100 million pages by AltaVista. Given the explosive growth of the Web and the limitation of time and space faced by search engines, it is unlikely that full coverage of the Web is forthcoming.
Most users feel the incompleteness of the indices only indirectly, since they can not miss a web page if they do not know it exists. The more pressing problem is that using the search engines can be a frustrating, time-consuming, and often unsuccessful process for the user. In most search sessions, the user's needs are well enough formulated in her head that only a small number of web pages would exactly meet her need. The problem then, is getting the search engine to understand the user's needs. Unfortunately, the state of the art in human-machine interaction is far from meeting such a goal. Many user queries produce unsatisfactory results, yielding thousands of matching documents. The search engine indices support many basic information retrieval queries, but the users are offered little guidance in determining which keywords and in which combination would yield the desired content. Typically, the user ends up alternating between specifying too few keywords which yield too many matching documents, and supplying too many keywords which yield no matches. Many search engines lack efficiency in eliminating duplicate URLs from their indices. As a consequence, redundant information is sometimes returned to users, and can create a lot of frustration.
While a number of tools have been developed to help the user search more intelligently, by allowing selection of additional search criteria, none of them offers useful analysis of the query results that could give guidance to the user in reformulating a more appropriate query. Some search engines group and display results based on the popularity of the site. While others attempt to do some type of organization. One such search engine, Northern Light, organizes all the query results into at most 10 folders based on subject, type, source and language. While this is a step in the right direction, the user is not given any information on how the categories are derived or on how many results are in each folder.
SUMMARY OF THE INVENTION
The present invention is embodied in a simple and effective method for improving the searching of an information management system using a search engine and for refining and organizing the search results.
The present invention provides for a query tuner, allowing a user to effectively reformulate a query in order to find a reasonable number of matching documents from the search engine by automatically and selectively modifying individual query terms in the user's query to be weaker or stronger.
One aspect of the present invention provides for a dynamic filter, using a dynamic set of record tokens to restrict the results of a search query to include only records which correspond to the record tokens.
Another aspect of the present invention provides for a results organizer, to aid the user in organizing and understanding a large number of matching documents returned in response to a search query by clustering like items returned from the search.
Another aspect of the present invention provides for a search history, to allow the user to save, organize and search the queries and the documents that best satisfy the query.
It is to be understood that both the foregoing general description and the following detailed description are exemplary, but are not restrictive, of the invention.
REFERENCES:
patent: 5175814 (1992-12-01), Anick et al.
patent: 5278980 (1994-01-01), Pedersen et al.
patent: 5471613 (1995-11-01), Banning et al.
patent: 5488725 (1996-01-01), Turtle
patent: 5500920 (1996-03-01), Kupiec
patent: 5608624 (1997-03-01), Luciw
patent: 5625814 (1997-04-01), Luciw
patent: 5781898 (1998-07-01), Fukatsu et al.
patent: 5826260 (1998-10-01), Byrd, Jr. et al.
patent: 5835087 (1998-11-01), Herz et al.
patent: 5842203 (1998-11-01), D'Elena et al.
patent: 5924090 (1999-07-01), Krellenstein
patent: 5987457 (1999-11-01), Ballard
patent: 5999929 (1999-12-01), Goodman
patent: 6029195 (2000-02-01), Herz
patent: 6038574 (2000-03-01), Pitkow et al.
Hanani, Michael Z., An Optimal Evaluation of Boolean Expressions in an online Query System, Communications of the ACM, May 1977, vol. 20, No. 5, pp 344-347.*
Duppel, N. Parrallel SQL on Tandem's NonStop SQL, Compcon Spring '89, Thirty-fourth IEEE Computer International Conference: INtellectual Leverage, Feb. 27-Mar. 3, 1989, pp. 168-173.*
Iwaihara, M. et al., Bottom-Up Evaluation of Logic Programs Using Binary Decision Diagrams, Data Engineering, 1995, Proceedings of the Eleventh International Conference on, Mar. 6-10, 1995, pp. 467-474.*
Antoshenkov, G., Dynamic Optimization of Index Scans restricted by Booleans, Data Engineering, 1996, Proceedings of the Twelveth International Conference on, Feb. 26-Mar. 1, 1996, pp. 430-440.
Chiriac Liviu
Esakov Jeffrey
Kravets Dina
Wan Suz Hsi
Burke William J.
Lintz Paul R.
Sarnoff Corporation
LandOfFree
Search data processor does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Search data processor, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Search data processor will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2873408