WO2001027805A2

WO2001027805A2 - Index cards on network hosts for searching, rating, and ranking

Info

Publication number: WO2001027805A2
Application number: PCT/US2000/028653
Authority: WO
Inventors: Gary W. Tripp; Michael D. Meadway; Claude E. Duguay
Original assignee: 360 Powered Corporation
Priority date: 1999-10-14
Filing date: 2000-10-13
Publication date: 2001-04-19
Also published as: WO2001027805A3

Abstract

Instead of using a central site including spidering software to recursively search all linked web pages and generate a search index of the Internet, index cards files are created and stored on each web site to provide meta data in the form of conceptual or non-keyword information about the site, such as demographics and categorization information. The meta data is periodically collected and aggregated on a central server. A central catalog of object references is compiled on the central site from the meta data reported from each web site. The information from the index cards is utilized in constructing the central catalog so that more accurate search results may be generated for search queries applied to the catalog, so that the search results may be ranked in meaningful ways, and so that web sites may be more accurately rated.

Description

INDEX CARDS ON NETWORK HOSTS FOR SEARCHING, RATING, AND RANKING

TECHNICAL FIELD

The present invention relates to computer network search engines and more particularly to a method and system for allowing the managers of host computers and of web sites on those hosts to enter data into a data structure which can be used by a central search engine for searching, ranking search results, and rating web sites.

BACKGROUND OF THE INVENTION

In the last several years, the Internet has experienced exponential growth in the number of web sites and corresponding web pages contained on the Internet. Countless individuals and corporations have established web sites to market products, promote their firms, provide information on a specific topic, or merely provide access to the family's latest photographs for friends and relatives. As a result of the rapid growth in web sites on the Internet, it has become increasingly difficult to locate pertinent information.

Search engines, such as Inktomi, Excite, Lycos, Infoseek, or FAST, are typically utilized to locate information on the Internet. Upon inquiry from a user, the search engine software searches the millions of records contained in a central index. The search engine software finds matches to the search query and may rank them in terms of relevance according to predefined ranking algorithms. While most search engines accept submissions of sites for indexing, even upon such a submission, the site may not be indexed in a timely manner, if at all.

An inherent shortcoming of the method of indexing utilized in the conventional search engine is that only documents stored with a mark-up language such as SGML, HTML or XML is utilized in generating the central index. Due to the format of a mark-up language web page, certain types of information may not be placed in the mark-up language tags. For example, conceptual information such as the intended audience's demographics and geographic information may not be placed in an assigned tag in the document. Such information would be extremely helpful in generating a more useful index. For example, a person might want to search in a specific geographical area, or within a certain industry. Assume a person is searching for a red barn manufacturer in a specific geographic area. Because mark-up language pages have no standard tags for identifying industry type or geographical area, the spider on the server in the conventional search engine does not have such information to utilize in generating the central index. As a result, the conventional search engine would typically list not only manufacturers but would also list the location of picturesque red barns in New England that are of no interest to the searcher. Some Internet search engines, such as Infoseek, have proposed a distributed search engine approach to assist their spidering programs in finding and indexing new web pages. Infoseek has proposed that each web site on the Internet create a local file named "robotsl.txt" containing a list of all files on the web site that have been modified within the last twenty-four hours. Files that have not been modified will not be indexed, saving bandwidth on the Internet otherwise consumed by the spidering program and thus increasing the efficiency of the spidering program.

There is a need for a method and system of indexing or cataloging remotely stored data that allows conceptual information and other human generated information about web sites to be utilized in generating the index to allow sites to be found in a search, to make search results more meaningful, and to allow sites to be more accurately rated.

Full-text search and indexing systems such as web search engines typically have two distinct means of organizing the presentation of documents. The first means is usually a categorization system (hierarchical or otherwise) which presents the documents in groups or "clusters" related by topic, content or origin. The second is dynamically generated as a result of a search process of some sort such as a matching keyword search. Normally, this second means is presented as a linear list in which matching documents are sorted either by alphabetical title, date of change or a ranking value based on a calculation whose input may come in part from the document content. For example, in searching for the work "car" in a set of documents, the resulting list of matching documents might be sorted by the number of times the word occurred in each document.

SUMMARY OF THE INVENTION

According to one aspect of the present invention, one or more brochure files or "index cards" are created and stored within each web site on a network to provide conceptual or non-keyword data about the site, such as demographics and categorization information, related to one or more parts of the web site. This conceptual information is then utilized in constructing the central catalog so that more accurate search results may be generated in response to search queries applied to the catalog. This categorization information is transmitted by an agent program on the host to the central index.

Important uses for the categorization information include the language of the web site, any geographic location to which the web site is particularly relevant, demographic information about the audience of people that will likely be interested in the site or that the owner of the site wishes to target, or the subject matter of the site so that it can be found by people who are searching for certain subject matter.

Like other information about a web site, information contained within the index cards can be used in ranking algorithms on a search engine to rank the kreferences found according to a set of ranking rules. The ranking process can include both data derived from the contents of objects or from meta data associated with objects, or from the index cards. In addition to using the categorization information to filter search results to produce more meaningful search results, the categories can be structured as hierarchies with sub- categories in each category. Then, when a user designates a category to find web sites that match that category designation, the system can also provide to the user references to web sites associated with sub-categories within that category.

The preferred method of transferring the index card information to the central site is with an agent program located on each web site host. To further improve the ranking results, the agent program can also process objects on the web site to parse their contents and extract data from the objects which can be used by the agent program in a ranking algorithm which follows a set of ranking rules, producing assigned rankings for objects on the web site. The agent can then transmit via signed rankings to the central cataloging site for further processing.

The index cards can also be useful for improving the rating of web sites such as rating for adult content or other content that selected groups might consider offensive. The web site owner can apply a rating to the site which is stored in the index card. Also, the administrator of the host computer system can apply a rating to the web site. These ratings can be compared to ratings which are automatically generated by parsing words on the web site to assess their probable accuracy. The agent program can assist in this process by parsing the words in the web site according to rating values and then forwarding the rating values to the central cataloging computer. The index cards can also be used by web site owners and host system administrators to regulate the exposure of objects on the host to other computer systems on the network. The index card can be used to list non-html objects and provide sufficient information about the objects that they can be remotely accessed across the network. Remote computer systems can read the index card directly to obtain its information or, in the preferred embodiment, the index card information is periodically transmitted to a central site where it is organized for searching by remote computer systems.

For purposes of the following discussion, each object consists of both contents (meaning only the essential data itself and not a header) and associated "meta data". The meta data includes all information about the contents of an object but not the contents itself. The meta data includes any information that has been extracted from the contents and is associated with the object, any header information within the object, and any file system information stored outside of the object such as directory entries. The term "object" is used only to refer to anything stored on a site of interest to a person who might access the site from the network and its associated meta data. To avoid confusion, the term "object" is not used more broadly.

BRIEF DESCRIPTION OF THE DRAWINGS

Figure 1 is is block diagram showing the architecture of a search engine for actively indexing the world wide web according to one embodiment of the present invention. Figure 2 is a bubble chart illustrating the generation and processing of a brochure file in the indexing system of Figure 1.

Figure 3 is a bubble chart illustrating the process executed by the queue manager in queuing update entries and transferring these entries to the remote queue manager. Figure 4 is a bubble chart illustrating the overall data flow in the search engine of Figure 1.

Figure 5 illustrates components of the indexing system of Figure 1 for a Java- based implementation. DETAILED DESCRIPTION OF THE INVENTION

Figure 1 is a block diagram of an indexing system for indexing the Internet using index cards according to one embodiment of the present invention. The system includes a central server 202 that stores a central index and processes search queries received over the Internet. The system also includes brochure files or "index card" files 206 residing on respective remote servers 208, each index card file containing non-HTML or conceptual information about the web site for use in generating the central index on the server 202, as will also be explained in more detail below. For the sake of brevity, only two remote servers 208 and the corresponding agent 204 and index card 206 are shown in Figure 1. The system, however, includes numerous such remote servers 208 with index card files 208.

The central server 202 includes a router 210 that directs packets comprising search requests and update transactions to an appropriate set of servers 214, 302 and 222. The web servers 214 receive and preprocess index queries and receive and process index card 206 generation or modification requests. The central server 202 further includes a master index server 218 containing a master copy of the entire central search index or catalog. A number of update servers 222 each receive updates from each host 208.

The central search engine 202 further includes an index card database server 226 and index card check server 228. The index card database server 226 stores an index card database as a list of index card files and their associated data fields for each web site. The web servers 214 may request records from or add records to this index card file database depending on the actions taken by web site administrators while maintaining their index card entries. The index card check server 228 periodically checks for valid new index card files as defined within the index card database server for web sites that are not being processed by a local agent program, as will be described in more detail below. If the defined index card in the index card database server 226 is not found by the index card check server 228, a notification is sent to the administrator of the site where the index card was supposed to be found.

Index card information may be automatically sent by each host to the central system by use of an agent program 204 on the host. Alternatively, instead of using an agent program on each host to send index card information to the central system, index cards may be retrieved directly by external central system programs, such as web crawlers, and the contents used to create categorized sets of web pages. This approach requires that the web server be capable of retrieving a list of the available index cards, or that the cards have predetermined (standardized) names. Once index cards have been retrieved by such systems, the content of the index card may be used to calculate rating values. When an index card file is requested for a site which is not served by an agent

204, a message is sent to the Internet Service Provider ("ISP") or system administrator for the site hosting the web site, indicating that users of the system are requesting index cards. This server also periodically checks the validity of existing index cards on all sites and notifies the web site administrator if an index card file is missing. If an index card is missing and remains missing for a given number of check cycles, the index card check server 228 sends a request to the index card database server 226 to delete the entry for the index card. The index card check server 228 detects any changes in index card files, such as additions or removals, and converts these changes to transaction batches that are forwarded to a queue manager which, in turn, applies these changes to update the central index on the master index server 218, as will be described in more detail below. The index card check server 328 periodically verifies the status of all index cards at sites that are not being indexed by an agent 204.

The components of the central server 202 and their general operation have been described, and now the operation of the agent 204 and index card 206 will be described in more detail. Additional details about the agent technology is disclosed in US patent application 09/575,971 which is incorporated by reference.

The agent 204 and index card 206 may both be present at a remote server 208. An index card 206 and agent can function independently of each other, as will be discussed in more detail below. The agent 204 is a small local program which executes at the remote server 208 and generates an incremental search engine update for all of the participating web sites on the web host 208. These index updates are transmitted by the agent 204 to the central server 202, where they are queued for addition to the central index.

The agent 204 runs on a system, such as a web host server, at the site of an organization, and processes content (objects) for all web sites available via mass storage from that system. The agent 204 processes all web sites located within the mass storage area to which it has access, unless configured to exclude some portion of a site or sites. The agent 204 uses the local web server configuration (object catalog or file system information) data to determine the root directory path (or other location information for the particular file system) for all web site file structures available.

While indexing the web sites at the remote server 208, the agent 204 recognizes index cards 206 stored at web sites on the server and provides index updates based on the contents of the index card files found. Once the agent 204 has indexed the web sites at the remote server 208, the agent transmits a transaction list to the central server 202, and this transaction list is stored on one of the update servers 222. The transaction list is referred to as a batch, and each batch contains a series of deletion and addition transactions formatted as commands. The index card 206 is a small file that may contain conceptual and other non- mark-up language information which would be useful to improve the indexing of sites or parts of a single site on the remote server 208. An index card 206 may contain any information pertinent to the web site, including but not limited to keywords, phrases, categorizations of content, purpose of the site, and other information not generally stored in a web page. The index card 206 is generated manually by individual web site administrators. The administrator fills out a form at the central server 202, and receives an email containing the index card 206 or downloads the index card file after submitting the form contents. Upon receiving the index card 206, the administrator stores it within the file structure of the web site on the remote server 208. There may be multiple index cards 206 at the same web site, each describing specific portions of the site. Each index card 206 may refer to a single web page or a group of web pages stored within a specific subdirectory at the web site. All information stored in each index card 206 is applied to the pages referenced in the index card.

The central server 202 also allows remote users to generate and download index cards 206 to their remote site, and also verifies the validity of index cards 206 on web sites not serviced by an agent 204, as will now be explained in more detail. The web servers 214 receive and process index card 204 generation or modification requests from user browsers. Once the index card 204 has been generated or modified, the index card is transferred to the index card database server 226, which stores all existing index cards. The index card check server 228 periodically checks for new index cards 206 stored on the index card database server 226 for web sites that are not served by an agent 204. When an index card 206 is requested for a web site which is not served by an agent 204, the index card check WO 01/27805 PCTVUSOO/28653

server 228 sends a message to the system administrator or Internet service provider for the server hosting a web site telling them that site administrators on their server are requesting index cards 206. The index card check server 228 also periodically verifies the validity of existing index cards 206 on all sites not serviced by an agent 204. If an index card 206 is missing for a predetermined number of verification cycles, the index card check server 228 instructs the index card database server 226 to delete the entry for that index card. The index card check server 228 also converts any modifications, additions, or deletions to index cards 206 to transaction batches, and forwards these transaction batches to a queue manager 302. The queue manager 302 receives index card update transaction batches from the index card check server 228 and also receives agent update transaction batches from the agent update server 222, as will be described in more detail below.

Figure 2 is a bubble chart illustrating the generation and processing of an index card 206 in the indexing system of Figure 1. As previously mentioned, the purpose of the index card 206 is to allow the web host 208 and the web site to provide specific non- HTML information to help the central server 202 index the site and to provide more relevance to query results. The index card 206 can be created in two ways. First, as part of the installation program for the agent 204, the administrator of the remote server 208 completes a form that is converted to an encoded index card file 206, and then copied into the web directory on the remote server 208. This method of generating the index card 206 will be discussed in more detail below. The second method of generating the index card 206 utilizes an index card creator interface on the web servers 214 at the central server 202. This method will now be described in more detail with reference to Figure 2.

To create an index card 206 using the index card creator interface, a user's browser 400 applies an index card generation request 402 to the associated central site web server 214. In response to the request 404, the index card creator interface generates a form which the user completes, and then sends an index card request 406 to the index card server 226, which generates an encoded index card file that is then sent to the central site web server 214. The central site web server 214 then sends the encoded index card file to the user's browser 400. The encoded index card file 206 is then stored in local storage 408. Subsequent to receiving the encoded index card file 206, the user sends the encoded index card file 206 via the user's web browser 400 to the web host site storage 410 (e.g., the web site host computer).

The index card server 226 stores the index card data 407 in an index card database 424 on the central server 202 once it has been generated as a result of an index card generation request 404. To verify proper storage of encoded index card files 206, the index card check server 425 retrieves index card data 420 from the index card database 424 and sends a request 416 to the web host server 404 to retrieve the encoded index card file 206 from the web host site storage 410. Upon successful retrieval of the index card file 206, the index card check server generates and transmits object references 422 created as a function of the index card data 420 to the queue manager 302. The queue manager 302 thereafter updates the central index to include the generated object references.

The directory structure of the host and web site are used to determine the relevance of the information in the index card. Information in an index card located in the root directory will apply to all sub-directories unless superceded by another index card. Information in a directory index card will apply to all subdirectories unless superceded by information in a subdirectory index card. Where an index card is placed determines the content to which the information applies. A web site owner can have as many index cards as there are pages or directories in his site. A site owner can request that their site be excluded from the central index by checking the EXCLUDE box next to the URL and copying the index cards into the directory to be excluded.

An example of a host index card is shown in Table 1 : Table 1-Host Index Card Records

The host uses the configuration section of the agent program to create site index cards. The agent program can create site index cards for an entire IP address or for any subsection of the site.

In addition to the host index card, a web site owner may also place a site index card on his web site. The purpose of the site index card is to allow the web site owner to provide specific conceptual or non-html information, which will help in indexing the site. A sample site index card is shown below in Table 2.

Table 2- Site Index Card Records

WO 01/27805 PCTYUSOO/28653

The web site owner can create a different site index card for each page or directory on the site. For example, if the web site includes pages in different languages, the web site owner should create a site index card for each language with keywords and categories that match the language. Once the web site owner has filled in the index card form, they will click a button on a web page from the web server at the central server, and a web server creates an encoded html file that is then sent or downloaded to the site owner's computer. Each encoded index card file could be given a particular name, such as index card-domainname-com-directory-directory-directory.html, and the site owner is instructed to copy the encoded file into the specified web directory on the site.

At anytime, the web site owner can visit the central server site, update their index card, and download a new encoded index card. When updating an existing index card, the current index card information for the URL entered is displayed to reduce input time. Any site index card will supercede the host index card information, and information contained in the site index card will be assumed to be more current and accurate and will be used by the agent for indexing purposes. A site index card that is farther down in the directory tree from the root directory will supercede a site index card that is above it in the directory tree. A site owner can request that their web site be excluded from the index by checking the EXCLUDE box next to the URL and copying the index cards into the directory to be excluded.

If the host or web site URL is not currently being indexed, the web server performs the following operations. First, an automatic email is sent to contacts at the host to encourage the host to install the agent. An automatic email is also sent to a contact person for the web site with a "Thank You" and a request that they ask their host to install the agent. In addition, a retrieval order is generated for the central server to retrieve the index card file from the web site in one hour. If the retrieval order is unsuccessful, it will be repeated 2, 4, 8, 24 and 48 hours later, until successful. If still unsuccessful after 48 hours, the retrieval order is canceled. By verifying the presence of the site index card in the specified location, unauthorized information about a site may not be created by a third party in an attempt to have their site indexed along with a more popular site. This is a common problem with existing search engines where a third party copies the keywords from a meta tag in a popular site. The bogus site with copied keywords is then submitted to a search engine for indexing, and when search queries are applied to the search engine that produce the popular site the bogus site is also produced. This may not be done with the site index card because the index card is not an html page available to outside persons and because it is encrypted so even if the file is obtained the information contained therein is not accessible. Index Card Verification and Indexing by the Agent

Software to create index cards and agent programs is distributed free to software publishers for inclusion in their web authoring software and to web server manufactures, publishers and OEMs for pre-loading on or inclusion with their products. As mentioned above, the agent 204 is a software program that a web host downloads from the web servers 214 and installs on the host's server. To install the agent 204, the host runs an agent installation program, which collects information about the web site host and about the site itself, and also creates the web site host's index card 206 of non- HTML information. As part of the installation, the site host schedules a preferred time of day for the agent 204 to automatically index the web site and transfer index updates to the central server 202.

Although the agent 204 automatically indexes the sites on the host at scheduled times, the host can, at anytime, initiate an indexing update by opening the agent 204 and manually initiating an index update. The agent 204 updates the index of the local site. First, the agent 204 determines whether the last index update was completed and transmitted successfully. If not, the agent 204 renames the Old — Site-Index file to Site-Index and the Old-Site-File-List to Site-File-List. The agent 204 then calculates a digital signature for the Site-Index file and a signature for the Site-File-List file and compares each to the digital signatures created at the end of the last successful update for Site-Index and Site-File-List files. If the digital signatures match, the agent 204 sends them to the central server 202 for comparison and waits for confirmation.

If the central server 202 does not confirm the match of the digital signatures (i.e., the signatures for the Site-Index and Site-File-List files on the central server 202 do not match those on the remote site), the agent 204 deletes the Site-Index and Site-File-List files, and notifies the central server 202 to delete all site records. Next, if the agent 204 was updated and Fields were added or deleted from the Site Index file, then the agent updates the Site-Index file to include the updates. The agent 204 then determines if the Site-File-Lists file exists, and renames the Site-File-List file to Old-File-List and create a text file named Site-File-List. If no Site-File-List exists but Old-File list exists, the agent 204 copies the Old- File-List file to Site-File List. If no Site-File-List and no Old-File-List files exist, the agent 204 creates a text file named Site-File-List. The agent 204 then calculates a digital signature hash for each file on the site and the host index card and records the file name including full path and digital signature hash of all files.

If the central server 202 verifies that the digital signature hash of the Site- Index file and the digital signature hash for the Site-File-List file match, the agent 204 verifies the index card files. More specifically, the agent 204 determines if the file index- card.html file name does not match the directory in which it is located. If the file index- card.html is not in the expected directory, the agent 204 sends a warning email to the site contact listed in the index card and then renames index card.html to WrongDirectoryindex- card.html.

If the agent 204 determines that all index-card.html files match the directory in which they are located, the agent 204 deletes a file named Exclude-File-List, creates a text file named Exclude-File-List, checks index cards for EXCLUDE sites flags, and adds file names of files to be excluded from the index to the Exclude-File-List file. The agent 204 then creates a Deleted-File-List file containing a list of files that no longer exist on the site in their original location. More specifically the agent 204 deletes the old Deleted-File-List file, creates a text file called Deleted-File-List, compares the Site-File-List file to Old-File-List file and records in the Deleted-File-List any files in the Old-File-List that are not in Site-File- List. The agent 204 then creates a New-File-List file containing a list of files that where created or modified since the last update. Next, the agent 204 indexes the corresponding site and creates a new Site-Index file.

The agent 204 then creates a New-Records-Index file and a Deleted-Records- List file. The agent 204 next removes records of deleted or modified files from the Site index.

The agent 204 then runs an indexing program against all files in the New-File- List file and creates a record for each new key word, phrase, MP3, Video, Movie, Link and index card information and adds these to the Site-Index file. The agent 204 then copies each new record created to the New-Records-Index file. If new fields were added to the Site Index, the agent 204 runs the indexing program against all files for new field information and creates records in Field-Update-Index for all information found. The agent 204 then updates the Site-Index file from the Field-Update-Index file.

At this point, the Site-Index file has been updated, and the agent 204 calculates a digital signature for the Site-Index file. Finally, the agent 204 creates a Site-Map file for the sites serviced by the agent. Once the Site-Map file has been generated, the agent 204 sends New-Records-Index and Deleted-Records-List files to the central server 202.

The agent 204 generates a site index, which is a database. The database includes a number of tables, each table consisting of records (rows) and fields (columns). Each table in the database includes similar records to speed searches. All Tables may be sorted alphabetically and then by category. In one embodiment of the agent 204, the agent generates Tables 3-12 as shown below.

Table 3 -Agent Created Keywords Table Fields

Table 4-Agent Created Key Phrases Table Fields

Updating the Central Copy of each Index Card

Figure 3 is a bubble chart illustrating the process executed by the queue manager 302 of Figures 1 and 2 in queuing update entries and transferring these entries to the remote queue manager 304. The queue manager 302 receives update entries 600 from the agent update server 222 and update entries 602 from the index card server 228, and places these update entries in an update queue 604. The entries in the queue 604 are transferred to a queue database 606. Once the queue 604 is done receiving update entries 600, 602, which may be when the queue is full or at predetermined intervals, the queue manager 302 goes to step 608 and retrieves the queue entries from the queue database 606 and sends them to the remote queue manager 304. The update entries stored in the queue database 606 are thereafter processed by the update processing server 306 (see Figure 1) to update the local master index on master index sever 218 (see Figure 1). The queue manager 302 also receives a deletion request (not shown) from the update processing server 306 and deletes update entries stored in queue database 606 in response to this deletion request.

Figure 4 is a bubble chart illustrating the overall data flow between the search engine 202, agent, and index card components of the active indexing system. Each aspect of the overall data flow has already been described in a corresponding section above, and thus Figure 4 will now be described merely to provide a brief description of the data flow of the indexing system according to one embodiment of the present invention.

The queue manager 302 receives updates from each of the agents 204 and from the index card check server 228, which services sites without an agent 204 as previously described. The queue manager makes update and deletions to the queue database 602 corresponding to the received updates, and also provides a mirror copy of these updates to the remote queue manager 304. The update processing server 306 retrieves the update entries from the queue manager 302, and applies the updates to the master index servers 218. The server 218 updates the master index to include the applied updates, and the update processing server 306 then sends a deletion request to the queue manager 302 to delete the corresponding entries from the queue database 602. Once the master index server 218 has updated the master index, the server updates the segmented index stored on the search index servers 216, 217 as previously described. Each of the search index servers 216, 217 updates its corresponding portion of the segmented index in response to the updates from the master index server 218. As previously mentioned, the entire segmented index stored on the index servers 216 is continuously available for processing search requests even during updating of the segmented index. The entire segmented index is available due to the redundant architecture of the servers 216, 217, as previously described.

Use of Index Cards to Limit Exposure of Objects

With the architecture of the indexing system, everything, including each field in a local database, is treated as an object. Instead of copying each object to a central location, an object reference is created at each local site and sent to a cataloging location or locations. The objects are not duplicated in a monolithic central database. One advantage to this architecture is that the decision of whether to expose the existence and classification of local objects becomes the responsibility and choice of the author, rather than a generic decision. In the system, the implementation of retention rules and the physical location of the objects remain with the author. The searchable central catalog merely references the distributed objects, eliminating the need to make full copies and therefore manage a large storage system. Rating with Agents or Index Cards The agent 204 may also generate ratings for objects stored on the associated sites so that users may filter their searches based upon the generated ratings. For example, in one embodiment, an owner of a web site provides a rating of his site, such as a "G," "R," or "X" rating. In addition, the web host, on which the agent 204 runs, also provides a rating that the host believes applies to the site. The agent 204 then parses the pages on the site and looks for adult content "trigger" words, such as "XXX" or "XXX-Rated." If the agent 204 finds enough occurrences of such trigger words, the agent "flags" the web site for review to determine the correct rating for the site. To rate the site, the agent 204 compares the words in the web pages to words in a list of ratings values.

The list of ratings values may be, for example, words that are generally found on adult web sites, such as profane and sexually explicit words. The list of ratings values may be generated by a human or may be automatically generated by the agent 204. To automatically generate the list, the agent 204 could, for example, parse known adult web sites. Such known adult web sites could be identified by determining those sites in the catalog that include the phrases "adult content" or "X-rated." Once these sites are identified, the agent parses the pages and determines frequently used words on such pages, and may also determine the frequency with which such words occur on these pages. The frequently used words and associated frequencies are then compiled to form the list of ratings values.

After flagging web sites for review, the review may be either through human review of the web site or through automated review performed by the agent 204. In automated review of flagged web sites, the agent 204 could, for example, determine the frequency of occurrence of words in the list of ratings values, and then set the rating of the web site as a function of the frequency. For example, if the frequency is greater than some threshold TI, the web site is rated "R," and if greater than a second threshold T2, where T2>T1, the site is rated "X." One proposed system for rating web pages on the Internet is described in A

Best Practices Model by Members of the Information Society Project at Yale Law School, J.M. Balkin, Beth Simone Noveck, Kermit Roosevelt (July 15, 1999), which may be found at http://webserver.law.yale.edu/infosociety/. In this proposed system, three layers are implemented to provide for rating web pages. The first layer includes a basic vocabulary of, for example, thirty to sixty terms that are used in rating a web page by a first party, typically the site owner containing the web page. The second layer includes rating templates developed to reflect a particular ideology. Third parties, such as the NAACP or Christian Coalition, would develop such templates to reflect a particular value system. The templates would include terms in the basic vocabulary being categorized and scalar values assigned to each item to reflect the value system. Finally, in layer three, individuals could customize or modify a template to suit their individual values. For example, a template developed by the Christian Coalition could be further modified to include scalar values for web sites designated as racist by the NAACP. The indexing system can utilize such a rating system to perform filtering of search results at the central server 202. For example, user's browsers can be registered with the central server 202, and part of this registration includes selection of a template and any desired modifications to the selected template. Thereafter, whenever the user's browser applies a search query to the central server 202, the browser registration is identified and the search results generated in response to the query are "filtered" according to the template and any template modifications associated with the registered browser. The indexing system also may perform adult-content locking. In conventional search engines, adult-content web sites are automatically provided in response to applied search queries. The only way for a user to filter adult-content is through a filter on his browser. Thus, current search engines are "opt- in" in that the search engine does not preclude adult-content pages from being returned in response to applied search queries. Conversely, in one embodiment of the indexing system, the user is automatically opted out of receiving adult- content web pages in response to applied search queries. The user must reverse this default "opt-out" status and elect receive adult-content web pages in the system. This could be done, for example, by registering a browser with the system so that, when the registered browser is identified, adult-content web sites will be returned in response to applied search queries. Alternatively, a machine level lock using the computer or machine identification, such as the CPU or Windows identification number, could be utilized. In this approach, regardless of the browser being utilized on the computer, adult-content is either returned or not returned in response to applied search queries. This approach may be particularly desirable for parents who want to preclude their children from accessing adult-content, since a child cannot merely use a new browser on the same machine and thereby circumvent the filter the parent has on his or her browser.

Ranking with Index Cards or Agents

The indexing system may also perform ranking of web pages having references in the central index. First, the agent 204 may perform positional and contextual rankings for particular words in the web pages on a site. The positional rankings assign a ranking value to a word based upon, for example, the location of the word in the web page and the position of the word relative to other words in the page. The contextual ranking is determined using contextual information about the site contained in the index card 206. For example, if a word in a web page corresponds to a category as listed in the index card 206 (see Table 2) , the word will be assigned a higher ranking. In addition to rankings generated by the agent 204, the central server 202 also generates rankings for the central index. For example, the central server 202 may generate rankings based upon whether a page is a source or reference to the desired data. In such an analysis, the number of links inbound to the page being processed (and the content of these external pages) are used to generate a ranking value for the current page. Similarly, an analysis of the links outbound from the page are performed, determining the importance of the page as a "reference" to information as opposed to being a "source" containing information referenced by other pages. As a crude example, the number of inbound links to a page would determine it's ranking. Rankings may also be determined based upon user input such as the usage or popularity of a site as measured by how often the site is linked as the source site in other sites, or through positive comments entered by users about the context or ranking of a site.

All the methods of ranking just described are known as static rankings, meaning that the ranking is determined before a particular search query is applied. In addition to static rankings at the central server 202, the central server may also perform dynamic ranking of search results. Dynamic rankings are a function of the applied search query, are not predetermined, and are not independent of the query. For example, if the applied search query is "red barn," the word "barn" is probably more important than "red" so search results including the word "barn" will have their ranking increased relative to those containing only the word "red."

Furthermore, ratings could be applied to search queries to create another type of dynamic ranking at the central server 202. For example, a rating could be used as part of a query, to restrict searches to those sites or documents which have a certain minimum or maximum rating. Once the result set of matching sites or documents is retrieved, the resulting list could be ranked in order of rating value. For example, one might search for all pages with a "PG" rating (as determined by the Motion Picture Association Of America) or lower (where "G" would be the lowest). Pages could then be ranked where "G" rated pages are ranked higher than pages which have more mature content.

Finally, a user may select which ones of the previous methods of rankings should be applied in ranking search results generated in response to his applied query. For example, a user could specify that his search results are to be ranked only on the basis of popularity, or only on the basis of positional and contextual rankings and the applied search query. Another example for the use of dynamic ranking is, using the information in the index card 206, the search results can be ranked dynamically based on the geographic distance from the searcher.

Index cards may be read by external systems as opposed to local programs such as an agent. The information retrieved from the index cards may then be used to perform ranking analysis on the pages related to that index card. For example, the physical location data (address or geographical coordinates) might be used by a system to rank sites based on the proximity of the site owner to a major population center. In the current industry environment, there are automated search and collating systems which regularly interrogate or visit websites and extract relevant information from those sites. The resulting information is then analyzed and presented in some form to subscribers of a service or members of a "portal" site. Similar methods could be used to regularly retrieve index cards from known web sites and then perform analysis on the information contained in those index cards. Ranking with Relationship Values Calculated by Agents

According to another embodiment of the agent 204, the agent calculates a value representing the distance in text between objects and thereby determines which objects at a site are most likely to relate to each other. At the catalog site, these relationship values are combined with the relationship values from other sites to create a relationship value table. This relationship value table represents the likelihood of an object occurring together with another object. This table may be used to refine searches and create relevance ranking. Clustering Search Results with Index Cards

The index cards allow documents on a web site to be automatically categorized based on classifications entered by the web site administrator. Such classifications can apply to the entire site, certain subsets of the site content, or individual documents stored on the site. This categorization information is transmitted by the agent software to the central index or retrieved by the central server in an embodiment without agents.

Since the classification information is known for all pages, the results of a search performed at the central index can be clustered by category. It is not even necessary to display the list of matching documents ~ the user of the system can simply view the number of documents found within each category. The results display can further be refined by structuring the categories in a hierarchical fashion, where selection of a category containing matches would cause a display of all subcategories containing matches as well as any matches found within the selected category itself.

The primary advantage of such clustering is to provide the user of the system context upon which to base a decision as to the relevance of the set of documents found. For example, a query for "Ford" might produce matching documents within the topics of "Retailing", "News" and "Reference Material." If the searcher was interested in finding a Ford Motor Company retail dealership, matches under "Retailing" would be of more interest than all others. By providing the context indicating in what category the search results fall, the searcher is able to discern what search results are relevant without the use of ranking algorithms.

Example part I: The search for "Ford" found the following:

Retailing: 700 matches in 15 subcategories

News: 3000 matches in 8 subcategories Reference Material: 36 matches in 2 subcategories

Example part II Retailing (700 matches)

Ford Motor Company Retail Dealers: 550 matches in 51 subcategories

Repair Facilities - Ford Motor Co. Products: 150 matches in 12 subcategories In the example part I above, a search has been performed by the user for the word

"Ford." A resulting display containing information about matching pages has been generated and is now displayed on the user's screen within a standard web browser. Each heading listed is a hyperlink which, when selected, causes the list of matching pages and subcategories to be displayed as is shown in the example part II where the user has selected the hyperlink titled "Retailing" in part I. In both parts, the categorizing of results based on data supplied by index cards is shown.

This example shows that categorization can done at more than one level in a hierarchy or ontology. Thus, a page which was categorized as "Retailing / Automobiles / Ford Motor Company / Dealers / USA / California / Los Angeles Area" would actually apply towards the match count at several levels of a hierarchy. Implementation with Java

A Java-based implementation of the software elements of the indexing system is now described according to one embodiment of the present invention.

First, most users, with the exception of individuals using the search engine to find information on the Internet, will need to be authenticated, as illustrated in Figure 12. The operations that need to be supported to authenticate users include those shown in Table 13.

Table 13

A web site owner may be a content developer that owns a web site and develops content for that web site. Such a person may be hosting their own site but is often simply deploying content on another entity's machine. In this role, the owner does not administer the hardware/software and manages only site content. The operations that need to be supported include those shown below in Table 14. Table 14

The role of the web searcher is the end user of the system, which operates for free on the Internet, or any other future global communications network, since revenue is brought in through other entities. A web searcher expects to use the system to find things and navigate through their findings. Operations that need to be supported for web searches include those shown in Table 15. Table 15

Persistent information is stored in a database or in temporary files on the system. The database tables relate to each other as shown in Figure 5. The following tables specify the data dictionary for tables illustrated in Figure 5 that relate to index cards, ranking, and rating.

The ContextTable 2111 of Figure 5 defines possible contexts for indexing. These represent a short list such as HEAD, BODY and META for HTML pages. The ContextTable does not reference any other tables.

The Popularity Table 2105 of Figure 5 stores statistical information about the popularity of given pages, based on how often the page was selected after a search. This information is used when the user chooses popularity-based ranking at result display time. The popularity table is shown in more detail in Table 16 below. The Popularity Table 2105 references the PageTable 2103. Table 16

The IndexCardTable 2121 of Figure 5 stores information related to electronic index cards. The IndexCardTable references the FieldTable 2117, the ContactTable 2123, the Geography Table 2119, the DemographicTable2125, the RatingTable 2129, and the DatabaseTable 2127. The fields of the IndexCardTable are shown in Table 17 below:

Table 17

The Geography Table 2119 of Figure 5 is shown in more detail in Table 18 below. This table stores information related to the geographical target market for a given index card. The Geography Table does not reference any other tables.

The DemographicTable 2125 of Figure 5 is shown in more detail in Table 19 below. This table stores information related to the demographic target market for a given index card. The DemographicTable does not reference any other tables.

Table 19

The RatingTable 2129 of Figure 5 is shown in more detail in Table 20 below. The table stores information related to ratings associated with a given index card. The RatingTable does not reference any other tables.

Table 20

The packages in the system are either low-level utility packages, components, applications and services or user interface elements. Support packages, like the database, catalog, html and xml packages, provide a foundation for other program functionality. A few of the services, the message and index services, for example, are grouped as shared because several of their classes provide functional capabilities between both the agent and server elements. The index card package is also shared. The application and service level packages construct the agent and the server-side Jini services. Taken together, the classes in these packages function together as a complete, integrated, distributable system.

The shared index card package is shown in more detail in the following

Table 21

The shared rating package contains classes related to rating systems, as shown in the following Table 22. Table 22

Each of the previously recited methods is performed by a program contained on a computer-readable medium, such as a CDROM. The program may also be contained in a computer-readable data transmission medium that may be transferred over a network, such as the Internet. The data transmission medium may, for example, be a carrier signal that has been modulated to contain information corresponding to the program.

It is to be understood that even though various embodiments and advantages of the present invention have been set forth in the foregoing description, the above disclosure is illustrative only, and changes may be made in detail, and yet remain within the broad principles of the invention. Therefore, the present invention is to be limited only by the appended claims.

Claims

We claim: 1. A method of making categorization information about a site on a computer network available to other computer systems on the network, comprising: a) creating a site on a computer network comprising a plurality of objects which bare available for access by other computer systems on the network; b) creating a data file associated with said site containing human provided categorization information about said site; and c) making the contents of said data file available to other computer systems on the network.

2. A computer data set containing a computer program which, when run on one or more computer systems, causes the systems to perform the method of claim 1.

3. The method of claim 1 further comprising assembling contents from said data file and a plurality of similar data files for other sites and performing searches of said assembled contents to find desired sites.

4. The computer data set of claim 2 further comprising the limitations of claim 3.

5. The method of claim 3 further comprising structuring categories for said categorization information in a hierarchical fashion with subcategories, where selection of a category for a search causes results of said search to include sites associated with subcategories of said category.

6. The computer data set of claim 2 further comprising the limitations of claim 5.

7. The method of claim 1 where said categorization information comprises a human language in which objects of the site are presented when accessed by other computer systems on the network.

8. The computer data set of claim 2 further comprising the limitations of claim 7.

9. The method of claim 1 where said categorization information comprises a subject matter to which objects of the site relate as perceived by humans when accessed by other computer systems on the network.

10. The computer data set of claim 2 further comprising the limitations of claim 9.

11. The method of claim 1 where said categorization information comprises a geographic location to which objects of the site relate as perceived by humans when accessed by other computer systems on the network.

12. The computer data set of claim 2 further comprising the limitations of claim 11.

13. The method of claim 1 where said categorization information comprises a general description of a target audience by whom an owner of the site wishes the site to be accessed.

14. The computer data set of claim 2 further comprising the limitations of claim 13.

15. A method of constructing a catalog of rankings from objects stored within a network, the network including a plurality of interconnected computers with one computer storing the catalog and being designated a cataloging site and each of the other computers storing a plurality of objects and being designated a source site, the method comprising: a) running on the cataloging site a program which assembles data relating to objects stored on the two or more source sites where, for each of the two source sites, such data is gathered from a file that is not a part of any of said objects and said file contains data entered by a human about at least one of said objects; and b) ranking at least some of the assembled data as a function of a set of ranking rules, thereby assigning rankings to the assembled data to generate the catalog of rankings where at least one of the rankings has a value that is function of said human input data about one or more objects with which the ranking is associated.

16. A computer data set containing a computer program which, when run on one or more computer systems, causes the systems to perform the method of claim 15.

17. The method of claim 15 wherein the data assembled at the two or more source sites is assembled by an agent program running on the source site.

18. The computer data set of claim 16 further comprising the limitations of claim 17.

19. The method of claim 15 wherein at least one of the rankings has a value that is function of human usage of the object references.

20. The computer data set of claim 16 further comprising the limitations of claim 19.

21. The method of claim 15 wherein some of the assembled data comprises data from the contents of objects on at least one of the source sites.

22. The computer data set of claim 16 further comprising the limitations of claim 21.

23. The method of claim 15 wherein some of the assembled data comprises meta data relating to objects on at least one of the source sites.

24. The computer data set of claim 16 further comprising the limitations of claim 23.

25. The method of claim 15 wherein some of the assembled data comprises ratings of objects on the source site.

26. The computer data set of claim 16 further comprising the limitations of claim 25.

27. A method of constructing a catalog of rankings from objects stored within a network, the network including a plurality of interconnected computers with one computer storing the catalog and being designated a cataloging site and at least two other computers storing a plurality of objects and being designated source sites, the method comprising: a) running on each source site a program which assembles data relating to objects stored on the source site; b) ranking at least some of the assembled data as a function of a set of ranking rules, thereby assigning rankings to the assembled data; c) transmitting the rankings from each source site to the cataloging site; and d) aggregating the rankings at the cataloging site to generate a catalog of rankings.

28. A computer data set containing a computer program which, when run on one or more computer systems, causes the systems to perform the method of claim 27.

29. The method of claim 27 wherein at least one of the rankings has a value that is function of human input data about one or more objects with which the ranking is associated where the human input data is stored in a file on the source site which file is not a part of said one or more objects and assembled by said program.

30. The computer data set of claim 28 further comprising the limitations of claim 29.

31. The method of claim 27 wherein some of the assembled data comprises data from the content of objects on the source site.

32. The computer data set of claim 28 further comprising the limitations of claim 31.

33. The method of claim 27 wherein some of the assembled data comprises meta data relating to objects on the source site.

34. The computer data set of claim 28 further comprising the limitations of claim 33.

35. The method of claim 27 wherein each transmitted ranking is accompanied by a command to the cataloging site instructing the cataloging site what to do with the ranking.

36. The computer data set of claim 28 further comprising the limitations of claim 35.

37. The method of claim 27 wherein the program further assembles object references for objects on the source site, and these object references are transmitted to the cataloging site and aggregated into the catalog on the cataloging site.

38. The computer data set of claim 28 further comprising the limitations of claim 37.

39. The method of claim 27 wherein the program further transmits to the cataloging site some of the assembled data which is aggregated into the catalog on the cataloging site.

40. The computer data set of claim 28 further comprising the limitations of claim 39.

41. The method of claim 27 wherein at least one of the rankings relates to a set of objects on the source site.

42. The computer data set of claim 28 further comprising the limitations of claim 41.

43. The method of claim 41 wherein the agent calculates a relationship value representing a distance in text between objects and, at the cataloging site, these relationship values are combined with relationship values from other sites to create a relationship value table representing the likelihood of an object being similar to another object.

44. The computer data set of claim 42 further comprising the limitations of claim 43.

45. A method of rating objects stored at a site on a network and constructing a catalog of ratings, the network including a plurality of interconnected source computers and a central computer with access to the objects, the method comprising: a) running on a central computer a program which processes objects stored on the source computers, thereby assembling values found in at least one of the objects for comparison to a list of rating values; b) generating a rating for each object by relating the values found in the object to a list of human input rating values supplied by an owner of the site and stored in a file associated with the site which file is read by said program; and c) aggregating the ratings to generate the catalog of ratings.

46. A computer data set containing a computer program which, when run on one or more computer systems, causes the systems to perform the method of claim 45.

47. The method of claim 45 wherein each of the rating values comprises a word.

48. The computer data set of claim 46 further comprising the limitations of claim 47.

49. The method of claim 45 wherein additional human input rating values are supplied by a host of the site and stored in said file.

50. The computer data set of claim 46 further comprising the limitations of claim 49.

51. A method of rating objects stored at a site on a network and constructing a catalog of ratings, the network including a plurality of interconnected computers with access to the objects, the method comprising: a) running on the site a program which processes objects stored on the site, thereby assembling values found in at least one of the objects for comparison to a list of rating values; b) generating a rating for each object by relating the values found in the object to the list of rating values; and aggregating the ratings to generate the catalog of ratings.

52. A computer data set containing a computer program which, when run on one or more computer systems, causes the systems to perform the method of claim 51.

53. The method of claim 51 wherein each of the rating values comprises a word.

54. The computer data set of claim 52 further comprising the limitations of claim 53.

55. The method of claim 51 wherein the rating values are supplied by a human.

56. The computer data set of claim 52 further comprising the limitations of claim 55.

57. The method of claim 51 wherein the rating values are supplied by a computer.

58. The computer data set of claim 52 further comprising the limitations of claim 57.

59. The method of claim 51 wherein generating ratings of the objects comprises comparing the values found in the object to a list of human input rating values supplied by an owner of the site and stored in a file associated with the site which file is read by said program.

60. The computer data set of claim 52 further comprising the limitations of claim 59.

61. The method of claim 59 wherein additional human input rating values are supplied by a host of the site and stored in said file.

62. The computer data set of claim 60 further comprising the limitations of claim 61.

63. The method of claim 51 wherein generating a rating comprises generating a ratings flag when the values found in the object indicate a first rating for the object and at least one of the values from an owner of the site or a host of the site indicates a second rating for the object different than the first rating.

64. The computer data set of claim 52 further comprising the limitations of claim 63.

65. The method of claim 51 wherein aggregating ratings includes triggering a human review indicator for review by a human of objects having rating flags to determine the correct ratings for the objects.

66. The computer data set of claim 52 further comprising the limitations of claim 65.

67. The method of claim 51 wherein aggregating ratings includes triggering a computer review of objects having rating flags to determine the correct ratings for the objects.

68. The computer data set of claim 52 further comprising the limitations of claim 67.

69. The method of claim 51 wherein the step of processing objects comprises processing meta data for the objects.

70. The computer data set of claim 52 further comprising the limitations of claim 69.

71. The method of claim 51 wherein the list of ratings values is stored on the site.

72. The computer data set of claim 52 further comprising the limitations of claim 71.

73. The method of claim 51 wherein the list of ratings values is stored on a second site.

74. The computer data set of claim 52 further comprising the limitations of claim 73.

75. A method in a network of computer systems to limit exposure of objects on a computer system to other computer systems on the network, comprising: a) assembling a plurality of objects on a computer system connected to a network; b) placing on said computer system an index card file which is not a part of any of said objects and which designates a subset of said objects as accessible to other computer systems; and c) providing to other computer systems information for accessing said objects designated as accessible while retaining as confidential necessary information for accessing other objects on said computer system.

76. A computer data set containing a computer program which, when run on one or more computer systems, causes the systems to perform the method of claim 75.