Common term optimization

Details Common term optimization Common term optimization

1999-03-31

2002-06-18

Shah, Sanjiv (Department: 2172)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000

Reexamination Certificate

active

06408294

ABSTRACT:

BACKGROUND OF THE INVENTION
1. Field of the Invention
This application relates to the field of telecommunications and more particularly to the field of on-line query tools.
2. Description of Related Art
Search queries using terms that appear with high frequency in retrieved documents and/or in user queries present special problems for information retrieval software. Because information retrieval software typically relies on the use of lists for each search term that include document identification information that corresponds to each document in the searched database that includes the term, frequently used terms may require substantially more processing time than rare terms. The processing load is compounded by the fact that frequently used terms are also the subject of a disproportionate number of user queries. The problem can be especially acute when more than one high frequency term is used in the same query, such as a query for “Boston Restaurants.”
One way to improve information retrieval techniques would be to perform an intersection of sets and perform a ranking of the related categories (e.g., Italian restaurants in Boston, French restaurants in Boston, etc.) or related listings (for specific Boston restaurants). Because the term list
836
for documents containing the term “Boston” (including all businesses in Boston) and the term list
836
for documents containing the term “restaurant” (including all restaurants, nationwide) are both very large, the processing involved in retrieving each list and performing an intersection in order to identify matching categories or documents can be substantial.
Accordingly, a need exists for information retrieval and storage techniques that improve processing in situations where high frequency terms are used. Such techniques are referred to herein as “common term optimization.”
SUMMARY OF THE INVENTION
Provided are methods and systems for providing improved searching in an on-line query tool. The methods and systems provide an interface by which a user may enter a user query having a term. Common terms are identified, and a special result set is pre-classified for such common terms. The result set may be located in a special place in memory. User queries may then be parsed for use of common terms and directed to the special location in memory, thus enhancing the speed of searches that use common terms.
Identification of common terms may include identifying combinations of words wherein at least one of the words in the combination is used frequently in user queries and wherein the words in the combination appear frequently together. Pre-classifying the result set may include establishing a plurality of linked lists of business listings, each linked list corresponding to a common term and including business listings that include the common terms. The business listings or the linked lists may be expanded to include terms that are related to the common terms, such as synonyms.


REFERENCES:
patent: 5619410 (1997-04-01), Emori et al.
patent: 5845278 (1998-12-01), Kirsch et al.
patent: 5943669 (1999-08-01), Numata
patent: 5995979 (1999-11-01), Cochran
patent: 6101515 (2000-08-01), Wical et al.
patent: 6128613 (2000-10-01), Wong et al.
patent: 6212517 (2001-04-01), Sato et al.
patent: 6243723 (2001-06-01), Ikeda et al.

Affiliated with

Also associated with

Rating

Common term optimization does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Common term optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Common term optimization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2950400