Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2000-12-26
2003-03-04
Coby, Frantz (Department: 2171)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000
Reexamination Certificate
active
06529903
ABSTRACT:
BACKGROUND OF THE INVENTION
A. Field of the Invention
This invention relates generally to methods and apparatus for providing search results in response to an ambiguous search query provided by a user.
B. Description of the Related Art
Most search engines operate under the assumption that the end user is entering search queries using something like a conventional keyboard, where the input of alphanumeric strings is not difficult. As small devices become more common, however, this assumption is not always valid. For example, users may query search engines using a wireless telephone that supports the WAP (Wireless Application Protocol) standard. Devices such as wireless telephones typically have a data input interface wherein a particular action by the user (e.g., pressing a key) may correspond to more than one alphanumeric character. A detailed description of WAP architecture is available at http://www1.wapforum.org/tech/documents/SPEC-WAPArch-19980439.pdf (“WAP 100 Wireless Application Protocol Architecture Specification”).
In the usual case, the WAP user navigates to the search query page, and is presented with a form into which they input their search query. With conventional methods, the user may be required to press multiple keys to select a particular letter. On a standard telephone keypad, for example, the user would select the letter “b” by pressing the “2” key twice, or would select the letter “s” by pressing the “7” key four time. Accordingly, to enter a query for “ben smith”, the user would ordinarily need to enter the following string of keypresses: 223366077776444844, which map to letters as follows:
22-→b
33-→e
66-→n
0-→space
7777-→s
6-→m
444-→i
8-→t
44-→h
After the user has entered their search request, the search engine receives the word or words from the user, and proceeds in much the same manner as if it had received the request from a desktop browser wherein the user employed a conventional keyboard.
As can be seen from the foregoing example, this form of data entry is inefficient in that it requires eighteen keystrokes to enter the nine alphanumeric characters (including the space) corresponding to “ben smith”. Others have attempted to overcome the limitations imposed by reduced data entry devices, but each of the existing approaches has shortcomings. There remains, therefore, a need for methods and apparatus for providing relevant search results in response to an ambiguous search query.
SUMMARY OF THE INVENTION
Methods and apparatus consistent with the present invention, as embodied and broadly described herein, provide relevant search results in response to an ambiguous search query. Consistent with the invention, a method of providing search results to a user in response to an ambiguous search query includes generating a first index that associates (1) a first set of information of a first type with (2) documents that correspond to the first set of information. The first set of information is translated into a second set of information of a second type, based on mapping information. A second index is generated that associates, based on the mapping information, (1) the second set of information with (2) the documents. A search query of the second type is received, and search results are generated by comparing the search query to the second index. The user is then presented with these search results.
REFERENCES:
patent: 5495608 (1996-02-01), Antoshenkov
patent: 5701469 (1997-12-01), Brandli et al.
patent: 5745894 (1998-04-01), Burrows et al.
patent: 5758145 (1998-05-01), Bhargava et al.
patent: 5845273 (1998-12-01), Jindal
patent: 5915251 (1999-06-01), Burrows et al.
patent: 5953073 (1999-09-01), Kozina et al.
patent: 5978792 (1999-11-01), Bhargava et al.
patent: 6026411 (2000-02-01), Delp
patent: 6038365 (2000-03-01), Yamagami
patent: 6169999 (2001-01-01), Kanno
patent: 6353820 (2002-04-01), Edwards
patent: 6377961 (2002-04-01), Ryu
patent: 6421662 (2002-07-01), Karten
Santuci et al., A Hypertabular Visualizer of Query Results, 1977, IEEE, pp. 189-196.*
Graefe et al., The Microsoft Relational Engine, 1996, IEEE, Pates 160-161.
Brin Sergey
Ghemawat Sanjay
Manning Christopher D.
Smith Benjamin Thomas
Coby Frantz
Google Inc.
Pokotylo John C.
Straub & Pokotylo
LandOfFree
Methods and apparatus for using a modified index to provide... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Methods and apparatus for using a modified index to provide..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Methods and apparatus for using a modified index to provide... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3085034