Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
1998-07-15
2002-07-16
Alam, Hosain T. (Department: 2172)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000
Reexamination Certificate
active
06421675
ABSTRACT:
FIELD OF THE INVENTION
The present invention relates to a method and apparatus that allows for enhanced database searching, and more particularly; for use as an internet search engine.
BACKGROUND OF THE RELATED ART
An efficient and practical means of obtaining relevant information and also screening unwanted/uninteresting information has been an ongoing need, especially since the inception of the internet. This need is particularly acute at present due to the exponential growth in the number of world-wide web sites and the sheer volume of information contained therein. In an attempt to index the information available on the internet, a number of software search engines have been created via which a user enters a search command comprised of suitable keywords from a keyboard at his personal computer. The search command is transmitted to a server computer, the has a search engine associated with the server computer. The search engine receives the search command, and then using it scans for these key words through a database of web addresses and the text stored on the web sites. Thereafter, the results of the scan are transmitted from the server computer back to the user's computer and displayed on the screen of the user's computer.
In order for the search engine to be aware of new web sites and to update its records of existing sites, either the proprietors of the web sites notify the search engine themselves or the information may be obtained via a ‘web crawler’ to update the database at the server computer. A web crawler is an automated program which explores and records the contents of a web site and its inks to other sites, thereby spreading between sites in an attempt to index all the current sites.
This database structure and method of searching it poses some significant difficulties The internet growth-rate has resulted in a substantial backlog in the scanning of new sites, notwithstanding the fact that web sites are frequently deleted, re-addressed, updated and so forth thus leaving the search engine with outdated and/or misleading information. Although the web crawlers can be configured to prioritize possible key-words according to their location (title, embedded link, address etc), nevertheless, depending on the type of search engine used, substantial portions of the web site text (often involving the majority or even all of the site text) is still required to be scanned. This results in colossal storage requirements for the search engine. Furthermore, a typical key word search may bring up an excessively large volume of material, the majority of which may be of little interest to the user. The user typically makes a selection from the list based on the brief descriptions of the site and explores the chosen sites until the desired information is located.
These results are in the form of a list, ranked according to criteria specific to the search engine. These criteria may range from the number of occurrences of the key-words anywhere within the searched text, to methods giving a weighting to key-words used in particular positions (as previously mentioned). When multiple key-words have been used, sites are also ranked according to the number of different key-words applicable. A fundamental drawback of all these ranking systems is their objectivity—they are determined according to the programmed criteria of the search engine, and the emphasis placed on particular types of site design, rather than any measure of the actual users' opinions. Indeed this can lead to the absurd situation whereby in an attempt to ensure a favorable rating by the most commonly used search engines, some designers deliberately configure their sites in the light of the previously mentioned criteria, to the detriment of the presentation, readability and content of the site.
SUMMARY OF THE INVENTION
It is an object of the present invention to ameliorate the aforementioned disadvantages of conventional search engines by harnessing the cerebral power of the human operator.
It is a further object of the present invention to provide a novel search engine with enhanced efficiency, usability and effectiveness with a reduced system storage and/or computational requirements in comparison to existing software engines.
It is a further object of the present invention to provide a variety of indications of the popularity of the search data, together with an indication of its date of creation or updating.
In order to obtain the above recited advantages of the present invention, among others, one embodiment of the present invention provides for a method of updating an internet search engine database with the results of a user's selection of specific web page lists from the general web page listing provided to the user as a result of his initial keyword search entry. By updating the database with the selections of many different users, the database can be updated to prioritize those web listings that have been selected the most with respect to a given keyword, and hereby presenting first the most popular web page listings in a subsequent search using the same keyword search entry.
In another embodiment of the present invention, a method of determining content to provide along with listings transmitted from a server computer to user sites is provided. In this embodiment, there is obtained a content listing from each one of a plurality of different developer sites. Each of the content listings includes content, a developer identifier, and a keyword, and a keyword selection factor. Thereafter, there is determined a particular keyword from the obtained keywords that is the same for different content listings. For that particular keyword, the keyword selection factor is used in determining when to transmit different content listings to the user sites.
In still another embodiment, there is provided a method of updating a keyword table with the results of a user's selection of specific keywords which were obtained from a list of related keywords presented to the user. By updating the database with selections of many different users associated with t same keyword, appropriate keywords can be provided and presented first when that same keyword is subsequently entered.
REFERENCES:
patent: 5446891 (1995-08-01), Kaplan et al.
patent: 5530852 (1996-06-01), Meske, Jr. et al.
patent: 5659732 (1997-08-01), Kirsch
patent: 5721897 (1998-02-01), Rubinstein
patent: 5778367 (1998-07-01), Wesinger, Jr. et al.
patent: 5819092 (1998-10-01), Ferguson et al.
patent: 5855020 (1998-12-01), Kirsch
patent: 5996007 (1999-11-01), Klug et al.
patent: 6006218 (1999-12-01), Breese et al.
patent: 6029182 (2000-02-01), Nehab et al.
patent: 6041326 (2000-03-01), Amro et al.
patent: 6078916 (2000-06-01), Culliss
patent: 6094649 (2000-07-01), Bowen et al.
patent: 6115718 (2000-09-01), Huberman et al.
patent: WO 95/29451 (1995-11-01), None
patent: WO 96/23265 (1996-08-01), None
patent: WO 96/29661 (1996-09-01), None
patent: WO 97/22066 (1997-06-01), None
“Go To Sells Positions”, The Search Engine Report, Mar. 3, 1998, URL:http://www.searchenginewatch.com, in its entirety, pp. 1-5.
Kramer et al., “Thesaurus Federations: Loosely Integrated Thesauri for Document Retrieval in Networks Based on Internet Technologies”, Journal of Heterocyclic Chemistry, vol. 1, No. 2, Sep. 1997, pp. 122-131.
“The New Meta Tags are Coming-or are They?” The Search Engine Report, Dec. 4, 1997, URL:http://www.searchengine.com, in its entirety, pp. 1-4.
Munro Wayne Alistar
Robinson Del
Ryan Craig Matthew
Ryan Grant James
Ryan Shaun William
Colbert Ella
S. L. I. Systems, Inc.
LandOfFree
Search engine 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 engine, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Search engine will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2886930