CA2478358A1 - Systems and methods for client-based web crawling - Google Patents

Systems and methods for client-based web crawling Download PDF

Info

Publication number
CA2478358A1
CA2478358A1 CA002478358A CA2478358A CA2478358A1 CA 2478358 A1 CA2478358 A1 CA 2478358A1 CA 002478358 A CA002478358 A CA 002478358A CA 2478358 A CA2478358 A CA 2478358A CA 2478358 A1 CA2478358 A1 CA 2478358A1
Authority
CA
Canada
Prior art keywords
data set
data
web page
information
web
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
CA002478358A
Other languages
French (fr)
Inventor
Eric D. Brill
Christopher A. Meek
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Microsoft Technology Licensing LLC
Original Assignee
Microsoft Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Microsoft Corp filed Critical Microsoft Corp
Publication of CA2478358A1 publication Critical patent/CA2478358A1/en
Abandoned legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/95Retrieval from the web
    • G06F16/951Indexing; Web crawling techniques
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/95Retrieval from the web
    • G06F16/953Querying, e.g. by the use of web search engines
    • G06F16/9538Presentation of query results

Abstract

The present invention provides systems and methods for obtaining information from a networked system utilizing a distributed web crawler. The distributed nature of clients of a server is leveraged to provide fast and accurate web crawling data.
Information gathered by a server's web crawler is compared to data retrieved by clients of the server to update the crawler's data. In one instance of the present invention data comparison is achieved by utilizing information disseminated via a search engine results page. In another instance of the present invention, data validation is accomplished by client dictionaries, emanating from a server, that summarize web crawler data.
The present invention also facilitates data analysis by providing a means to resist spoofing of a web crawler to increase data accuracy.

Description

MS305080.1 Express Mail No. EV330021149US
Title: SYSTEMS AND METHODS FOR CLIENT-BASED WEB CRAWLING
TECHNICAL FIELD
The present invention relates generally to data analysis, and more particularly to systems and methods for obtaining information from a networked system utilizing a distributed web crawler.
BACKGROUND OF THE INVENTION
The evolution of computers and networking technologies from high-cost, low performance data processing systems to low cost, high-performance communication, problem solving and entertainment systems has provided a cost-effective and time saving means to lessen the burden of performing every day tasks such as correspondence, bill paying, shopping, budgeting and information gathering. For example, a computing system interfaced to the Internet, via wire or wireless technology, can provide a user with a channel for nearly instantaneous access to a wealth of information from a repository of web sites and servers located around the world, at the user's fingertips.
Typically, the information available via web sites and servers is accessed via a web browser executing on a web client (e.g., a computer). For example, a web user can deploy a web browser and access a web site by entering the web site Uniform Resource Locator (URL) (e.g., a web address and/or an Internet address) into an address bar of the web browser and pressing the enter key on a keyboard or clicking a "go" button with a mouse. The URL typically includes four pieces of information that facilitate access: a protocol (a language for computers to communicate with each other) that indicates a set of rules and standards for the exchange of information, a location to the web site, a name of an organization that maintains the web site, and a suffix (e.g., com, org, net, gov and edu) that identifies the type of organization.
In some instances, the user knows, a priori, the name of the site or server, and/or the URL to the site or server that the user desires to access. In such situations, the user can access the site, as described above, via entering the URL in the address bar and connecting to the site. However, in most instances, the user does not know the URL or the site name. Instead, the user employs a search engine to facilitate locating a site based MS305080.1 on keywords provided by the user. In general, the search engine is comprised of executable applications or programs that search the contents of web sites and servers for keywords, and return a list of links to web sites and servers where the keywords are found. Basically, the search engine incorporates a web "crawler" (aka, a "spider" or a "robot") that retrieves as many documents as possible as their associated URL.
This information is then stored such that an indexer can manipulate the retrieved data. The indexer reads the documents, and creates a prioritized index based on the keywords contained in each document and other attributes of the document. Respective search engines generally employ a proprietary algorithm to create indices such that meaningful results are returned for a query.
Thus, a web crawler is crucial to the operation of search engines. In order to provide current and up-to-date search results, the crawler must constantly search the web to find new web pages, to update old web page information, and to remove deleted pages.
The number of web pages found on the Internet is astronomical. It therefore requires that a web crawler be extremely fast. Since most web crawlers gather their data by polling servers that provide the web pages, a crawler must also be as unobtrusive as possible when accessing a particular server. Otherwise, the crawler can absorb all of the server's resources very quickly and cause the server to shut down. Generally, a crawler identifies itself to a server and seeks permission before accessing a server's web pages.
At this point, a server can deny access to an abusive crawler that steals all of the server's resources. A web page hosting server typically benefits from search engines, because they allow users to find their web pages more easily. Thus, most servers welcome crawlers, as long as they do not drain all of the server's resources, so that the server's contents can be better exploited by users.
One of the downsides to a crawler identifying itself to a server is that the server can then "spoof" the crawler. Servers usually have protected areas that they do not want to have exposed to the general Internet. When a crawler identifies itself, it is also told what areas it cannot access. If the crawler wants to maintain a working relationship with that particular server, it abides by the server's requests. However, if a server desires to spoof or disguise its true contents, it can refer the crawler to an area of pages that mimic true URLs of that server but that contain "alternate" contents. Thus, a server that
2 MS305080.1 normally provides information only about cats can set up its URLs with information about dogs in a section that only web crawlers access. This is done so that when a user searches for "dogs," the server's web pages about cats will be shown by the search engine. Typically, spoofing is utilized when a server's content is deemed objectionable by society, but the server desires to proliferate its contents beyond its normal "keywords." In this manner, objectionable material can be returned in a search engine list by using common words such as flowers, dogs, cats, weather, etc. Spoofing diminishes the accuracy and also the reputation of search engines utilizing the spoofed web crawler data.
SUMMARY OF THE INVENTION
The following presents a simplified summary of the invention in order to provide a basic understanding of some aspects of the invention. This summary is not an extensive overview of the invention. It is not intended to identify keylcritical elements of the invention or to delineate the scope of the invention. Its sole purpose is to present some concepts of the invention in a simplified form as a prelude to the more detailed description that is presented later.
The present invention relates generally to data analysis, and more particularly to systems and methods for obtaining information from a networked system utilizing a distributed web crawler. The distributed nature of clients of a server is leveraged to provide fast and accurate web crawling data. Information gathered by a server's web crawler is compared to data retrieved by clients of the server to update the crawler's data.
In one instance of the present invention, data comparison is achieved by utilizing information disseminated via a search engine results page. In another instance of the present invention, data validation is accomplished by client dictionaries, emanating from a server, that summarize web crawler data. In one aspect of the present invention, a "weak indicator" function from a set of weak indicator functions is randomly sent to clients. These weak indicator functions are significantly smaller than a total listing of all URLs found by a server's web crawler, thus, tremendously reducing server-client communication traffic. This facilitates in simplifying server-client interfaces while maintaining optimum accuracy of a web crawler's data.
3 MS305080.1 The present invention also facilitates data analysis by providing a means to resist spoofing of a web crawler to increase data accuracy. A server that employs the present invention can resist spoofing by comparing its web crawler data to data provided by a client. This allows the server to eliminate spoofed data from its search engine, permitting S a higher quality of search engine results. This capability facilitates in filtering out objectionable material that is not normally returned during an innocuous search, providing a more user-friendly experience for clients of the search engine.
To the accomplishment of the foregoing and related ends, certain illustrative aspects of the invention are described herein in connection with the following description and the annexed drawings. These aspects are indicative, however, of but a few of the various ways in which the principles of the invention may be employed and the present invention is intended to include all such aspects and their equivalents. Other advantages and novel features of the invention may become apparent from the following detailed description of the invention when considered in conjunction with the drawings.
BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a block diagram of a data analysis system in accordance with an aspect of the present invention.
FIG. 2 is another block diagram of a data analysis system in accordance with an aspect of the present invention.
FIG. 3 is yet another block diagram of a data analysis system in accordance with an aspect of the present invention.
FIG. 4 is still yet another block diagram of a data analysis system in accordance with an aspect of the present invention.
FIG. 5 is an illustration of a data analysis system utilizing search page results in accordance with an aspect of the present invention.
FIG. 6 is a block diagram of a spoofing process involving a web crawler system in accordance with an aspect of the present invention.
FIG. 7 is a block diagram of an anti-spoofing process involving a web crawler system in accordance with an aspect of the present invention.
4 MS305080.1 FIG. 8 is a flow diagram of a method of client-based web crawling in accordance with an aspect of the present invention.
FIG. 9 is another flow diagram of a method of client-based web crawling in accordance with an aspect of the present invention.
FIG. 10 is yet another flow diagram of a method of client-based web crawling in accordance with an aspect of the present invention.
FIG. 11 is still yet another flow diagram of a method of client-based web crawling in accordance with an aspect of the present invention.
FIG. 12 is a flow diagram of a method of generating a proper set of weak I O indicator functions for client-based web crawling in accordance with an aspect of the presentinvention.
FIG. 13 illustrates an example operating environment in which the present invention can function.
FIG. 14 illustrates another example operating environment in which the present invention can function.
DETAILED DESCRIPTION OF THE INVENTION
The present invention is now described with reference to the drawings, wherein like reference numerals are used to refer to like elements throughout. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It may be evident, however, that the present invention may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to facilitate describing the present invention.
As used in this application, the term "component" is intended to refer to a computer-related entity, either hardware, a combination of hardware and software, software, or software in execution. For example, a component may be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and/or a computer. By way of illustration, both an application running on a server and the server can be a computer component. One or more components may reside within a process and/or thread of execution and a component
5 MS305080. I
may be localized on one computer and/or distributed between two or more computers. A
"thread" is the entity within a process that the operating system kernel schedules for execution. As is well known in the art, each thread has an associated "context" which is the volatile data associated with the execution of the thread. A thread's context includes S the contents of system registers and the virtual address belonging to the thread's process.
Thus, the actual data comprising a thread's context varies as it executes.
The present invention provides improved systems and methods of maintaining an index of web documents. It can also be utilized to retrieve and maintain data for other types of information. Traditional web crawlers have certain shortcomings which are alleviated by the present invention. Each client (e.g., a machine of any person who accesses the Web) stores local information, so it can learn whether a web page has changed since the last time the client visited it. If it has changed, the client can then communicate this information to the search engine. Likewise, a server can use information about web pages visited by clients to find pages currently unknown to the 1 S server. Effectively finding documents and maintaining current knowledge about those documents is an extremely important task for both intranet and Internet search. The present invention can also be utilized in contexts such as intranet searches, where crawling pages and keeping page information fresh on a server is an even greater challenge.
An important component of a search engine (for the Internet, an intranet, or otherwise) is a data or document crawler. The document crawler performs two primary tasks: finding unknown documents to be indexed by the search engine and trying to ensure it has up-to-date knowledge about each known document. Both of these tasks are difficult and (along with page rank quality) are among the most important and visible 2S quality differentiators among search engines. Document crawlers are typically based on a server model. A search engine crawls the Web by topological search.
Beginning with a seed set of known web pages, the crawler follows links from those pages and can thereby find all web pages that are connected via a path (set of URL references) from the seed set.
To ensure the search engine has up-to-date knowledge of a document collection, the crawl has to be repeated frequently. Since the crawler revisits web pages each time it
6 MS305080.1 crawls, it can learn how frequently a page (or subgraph) changes, and recrawl certain pages more frequently than others based on their past frequency of change.
There are a number of weaknesses with the current server-based crawling paradigm. First, a crawler can only find pages that can be reached by following links S starting with one of the seed documents. Recent studies have shown that a large percentage of web pages are not currently indexed by any search engine.
Second, the search engine can only learn about a change to a document {e.g., a content change. or a page that no longer exists) when the crawler happens to revisit the page.
The present invention offers systems and methods for effectively finding documents (e.g., data) and maintaining up-to-date knowledge about known documents in a way that remedies the above mentioned weaknesses. This is accomplished via a distributed client-based crawl. Each client (e.g., a machine of any person who accesses the Web) stores local information, so it can learn whether a page has changed since the last time the client visited it. If it has changed, the client can then communicate this I S information to the search engine. Likewise, the server can use information about the web pages visited by the clients to find pages currently unknown to the server.
In FIG. l, a block diagram of a data analysis system 100 in accordance with an aspect of the present invention is illustrated. In this instance of the present invention, the data analysis system 100 is comprised of clients 102-106 numbered from 1 to "N," where N represents any number from 1 to infinity; a communication system 108, a search server 110, and web page servers I 12. The clients 102-l OG comprise a group of "distributed resources" for web page information for the search server 110. They generally function to provide new URLs and web page changes and the like to the searoh server 110 via the communication system 108. The communication system 108 is comprised of an Internet and/or an intranet and the like. It provides a means of access for communication purposes between the search server 110 and the clients 102-106. It also enables communications between the clients 102-106 and other web page servers 112 and/or the search server I 10 and other servers for gathering web page information. In essence, web crawler functionality is distributed among the search server 110 and the clients 102-106 instead of only functioning in a search server. The search server 110 utili2es the clients 102-106 to obtain information from web page servers 112 to facilitate in refining its own
7 MS305080.1 information. By distributing this functionality, the present invention provides a more up-to-date, robust, and spoof proof data set from which a search engine can utilize data.
Turning to FIG. 2, another block diagram of a data analysis system 200 in accordance with an aspect of the present invention is shown. The data analysis system 200 is comprised of a client 202 and a server 204 with a communication means interoperative between them. During typical operation, the server 204 hosts a web crawler that searches a communication network such as the Internet for other servers hosting web pages. The crawler compiles a source of information about these web pages for utilization with a web page search engine. The server 204 then sends a representation of this web page information to the client 202. This provides the client 202 with the capability to independently verify web page information when it accesses a server hosting that particular web page. The client 202 can also detect web pages that are unknown to the server 204. This allows the client 202 to compile changes/status and/or new information about known and unknown web pages. This information is then transmitted to the server 204. The server 204 utilizes the information to refine its original crawler web page data. By having distributed resources, the server 204 expands its crawler capabilities without burdening its own immediate resources (e.g., processor utilization, storage space, etc.). Additionally, because a web crawler typically identifies itself to each server it accesses, it risks being redirected to false data on that server. Servers also may limit the amount of access and time that a web crawler can impose on the server's resources. A client accessing a server typically does not have these restrictions and is not redirected to false data. Thus, a client's web page data can be utilized to correct false data compiled by a web crawler. This aspect of the present invention is described in more detail infra.
Referring to FIG. 3, yet another block diagram of a data analysis system 300 in accordance with an aspect of the present invention is depicted. The data analysis system 300 is comprised of a client system component 302 and a server system component 304 with a communication system (CS) 306 interoperative between them. In this instance of the present invention, the client system component 302 is comprised of a CS
interface component 308, a client control component 310, and a data storage component 312. The CS graphical user interface (GUI) component 308 provides a user with an interface that is
8 MS305080.1 typically specific to a type of communication system employed. One example of such an interface is a web browser utilized to graphically relay information on at least the World Wide Web. A web browser can also be utilized to "surf" an intranet such as web pages served within a single corporation. In other instances of the present invention, similar S information can be relayed utilizing a text based interface and the like rather than a graphical user interface. Typically, it is this component 308 that permits a user to run search queries on a search engine residing on a remote server connected to the communication system 306. Thus, the CS GUl component 308 transmits and/or receives information from the communication system 306. The client control component provides control of a client with regard to facilitating web crawling. The client control component 310 receives and/or transmits data relating to information such as web pages and the like. It 310 processes algorithms, tracks data changes and status, and/or controls local data storage for a client in the data analysis system 300. It 314 can also analyze information from the CS GUI component 308 with information received from a web I S crawler to determine differences and the like. The client control component 310 allows a client to participate as a "distributed resource" for a web crawler and the like. It 310 can also access stored data and provide information to the CS GUI component 308.
In one instance of the present invention, the CS GUI component 308 transmits and/or receives embedded crawler data. Thus, the client control component 310 interfaces with the GUI
component 308 to receive and/or transmit embedded crawler related data in this manner.
Likewise, it 310 can also send and/or receive controls from a server in the same manner.
In another instance of the present invention, the client control component 310 can behave similar to a server and provide control in a peer-to-peer fashion to other clients. One skilled in the art will recognize that functionality of the client control component 310 and the CS GUI component can be combined in a single component. It is also possible to utilize a client as a distributed resource without having a CS GUI component 308. An example of this instance of the present invention would include, but is not limited to, a client relaying and/or controlling another client. The data storage component 312 is utilized to store, for example, crawler data from a server, crawler data from a client, web page changes, new web page data, and client control parameters and the like.
It 312 can interface directly with the client control component 310 and/or the CS GUI
component
9 MS305080.1 308 depending on the instance of the present invention employed. The data storage component 312 can also be a data storage device such as a hard drive, random access memory, read only memory, removable media, and CD-ROMs and the like. In yet another instance of the present invention. information stored on the data storage component 312 can be directly accessed by a server without interfacing with the CS GUI
component 308 or the client control component 3 l0. In some instances, this permits faster data retrieval.
In one instance of the present invention, the communication system 306 i's an Internet such as "the Internet." It 306 can also be an intranet system such as a wide area network (WAN) and/or a local area network (LAN) and the like. The communication system 306 can also utilize more traditional communication means such as, for example, telephone systems, radio systems, light signal (optic) systems, and sound systems and the like. One skilled in the art will recognize that other global and local network structures can also be utilized by the present invention as the communication system 306.
I S The server system component 304 is comprised of a search engine component 314, a distributed resources control component 316, a crawler component 318, a data storage component 320, and an optional CS data hosting component 322. In one instance of the present invention, the crawler component 318 utilizes the communication system 306 to access servers and/or proxy servers to obtain web page related information such as web page content, age, size, URL, and embedded links and the like. This information is then stored in the data storage component 320. The data storage component 320 can be a data storage device such as a hard drive, random access memory, read only memory, removable media, and CD-ROMs and the like. The search engine component 314 provides a search capability for all web pages revealed by the web crawler 318 and stored in the data storage component 320. It 314 receives a search request/query from a user and accesses the information on the data storage component 320 to compile a list of links and web page data to send to the user. Thus, in a typical system, the search component 314 can only rely on the information obtained by the crawler component 318.
However, in instances of the present invention, the distributed resources controller 316 facilitates compilation of the information stored in the data storage component 320, permitting it to be more robust, up-to-date, and more encompassing. The distributed resources control MS30S080.1 component 316 provides control over distributed resources such as, for example, clients of a server that interact as a single distributed crawler or "client-based web crawler." The component 316 provides, for example, such functionality as analysis of data received from distributed resources such as the client system component 302 and the like.
determination of function and data allocations and their timing, provide algorithms to the distributed resources to determine known crawler data, receive data updates and/or additions, store data updates and/or additions in the data storage component 320, determination of an optimized utilization of the distributed resources, provide page data to the search engine component 314 to allow data embedding in search result pages for a particular search query, pmvide page data to an Internet service provider to generate pages that include embedded page link information, and track data characteristics such as counts, types, spoof percentage, and source and the like. In another instance of the present invention, the search page component 314 sends andlvr receives information for the distributed resources control component 316 rather than the' component 316 directly 1 S accessing the communication system 306.
In an instance of the present invention, the optional CS data hosting component 322 interfaces with both the communication system 306 and the distributed resources control component 316. The CS data hosting component 322 provides a web page hosting capability to provide users with access to a web page. Because the CS
data hosting component 322 is interactive with the distributed resources control component 316, it can receive and embed web page link information directly in its hosted web page.
In other instances of the present invention, the CS data hosting component 322 interfaces directly with the data storage component 320 to access information for embedding in a web page. In yet another instance of the present invention, the CS data hosting 2S component 322 interfaces with the search engine component 314 to access information for embedding in its web page links. In still yet another instance of the present invention, the CS data hosting component 322 can reside in a distributed resource such as a client.
It 322 can also reside in another server that has access to the server system component 304. In this instance, the client (or a server) would in effect become a server for hosted web pages and supply information for embedding in web page links from its local storage and/or other local means.

MS305080.1 One skilled in the art will appreciate that although each component is described independently, a component in other instances of the present invention can include functionality associated with other components. Likewise, some components can be eliminated without altering the scope of the present invention.
Moving on to FIG. 4, still yet another block diagram of a data analysis system in accordance with an aspect of the present invention is illustrated. The data analysis system 400 is comprised of a client system component 402 and a server system component 404 with a communication system 406 interoperative between them. In this instance of the present invention, the server system component 404 is comprised of a distributed resources control component 414 and a data storage component 416.
The server system component 404 is abbreviated in order to emphasize an instance of the present invention with regard to reception of web page information from the client system component 402. Typically, information flows into and out of the distributed resources control component 414 via the communication system 406. The client system component 402 is comprised of a client control component 408, a data storage component 410, and an optional notification component 412. In this instance of the present invention, the notification component 412 controls data that flows from the client system component 402 to the server system component 404. In other instances of the present invention, it 412 also controls peer-to-peer communications between the client system component 402 and other client system components. Specifically, the notification component 412 determines when and/or what data is to be transmitted from the client system component 402. A determination can be based on size of accumulated web page data, whether links have been found which are unknown to the server system component 404, significance of changes to web pages (such as SO% or more content change and/or high priority page changes and the like), time-of day permissions, and/or general time permissions set by the distributed resources control component 414 and the like. The notification component 412 can also utilize an algorithm to determine its own significance factors and/or its own timing schedule for data transfers. One skilled in the art will appreciate that the functionality of the notification component 412 can reside within a client control component 408 a»dlor other client system components not illustrated in FIG. 4.

MS305080.1 In order to fully comprehend the present invention, operational examples are described. In one instance of the present invention, a distributed client-based crawler operates as follows. A server is assumed to exist that receives incoming client messages about potential new web pages and content/status changes for web pages, as well as a set of clients that communicate with the server. The client machines can either be personal computers that are used for web-browsing or a proxy-server which is used to serve pages to a personal computer. The clients are instrumented to gather information on web pages that are viewed which can include, but are not limited to, (1) a URL used to reach a web page (2) a hash of contents of the web page (3) contents of the web page (4) and time of visit. In some instances of the present invention (e_g., proxy-server and the like). it might be impractical to persist all of this infonmation and some information might only be persisted for some period of time.
In another instance of the present invention, a client records URLs of web pages visited from a particular browser or proxy server for a particular period of time, and then sends this set of URLs to a server. The server then checks which URLs were previously unknown to it, and adds these to a known-URL list for future crawling/downloading/indexing. This allows a search engine associated with the server to learn about web pages that might not have been found by a topological crawl.
In order to decrease the volume of information sent from clients to a server, a client can keep information locally as to whether it has already informed the server of a particular URL, and only send information to the server if it has not already done so.
There are well known methods for effciently determining if two web pages are identical by mapping each document to an integer via a hash function and then checking whether the two hash values are identical. If a most recent hash for content associated with a URL is different than a previous hash of the content associated with the URL
then the content has changed. Every time a client visits a web page, it computes a hash value for that page. If the client has previously visited the page, it checks whether the hash value has changed. If so, the client has determined that the web page has changed since the client last accessed it and can inform a server. The client records the new <url, hash value> pair locally.

MS305080.1 There are a number of different ways a client can inform a server about a change.
The simplest is just to send a message that a URL content/status has changed.
Then the server can schedule to recrawl that page as soon as possible. To circumvent a server needing to revisit a page, a client can send additional information. If the client has a S cached copy of the page from its last visit, it can send an old hash value, along with differences between the old and new versions, and a new hash value. The server first checks if the client's old hash value matches the server's current hash value for that page.
If so, it can update the page content accordingly. Note that some document changes are more important than others. For example, in one case an entire page might change whereas in another only a single comma has been added to one sentence. The client can compute the significance of a change and either (a) utilize this information to prioritize what updates it sends to the server or (b) send the significance value to the server along with other page information so the server can use this information in prioritizing its recrawling/reindexing of the page. Examples of change significance functions include, but are not limited to, such items as percentage of document that has changed, linguistic/semantic significance of a change, and estimate of a percentage of user searches that would be affected by the change and the like. Significance can also be weighted by an estimate of the popularity of a page.
One disadvantage with the aforementioned communication means is that it results in significant traffic overhead between clients and a server. For example, if 100 clients all visit page "X" for the first time, each sends a message to a server that it has discovered page "X." Likewise, once the server has been notified that page "Y"
has changed, it does not need additional clients to inform it. Thus, additional instances of the present invention are provided infra which result in a significant decrease in unneeded communication between clients and a server.
Referring to FIG. 5, an illustration of a data analysis system S00 utilizing search page results in accordance with an aspect of the present invention is shown.
The data analysis system 500 is comprised of a client 502 with a search results page 506 and a search server 504 with a communication means for transmitting 508 and receiving 510 from the client 502 to the server 504. In a first example of an instance of the present invention, the client 502 notifies the server 504 of a changed web page, but does not send MS305080. I
any additional information. When a user utilizes a search engine, the search server 504 provides results to clients that include a hash of a server's version of the content and a freshness flag that indicates whether the contents are known not to be fresh, for each web page in the search results page 506, if the client 502 visits one of the pages in the search results page 506, it first checks whether the server 504 already knows the page not to be fresh (e.g., another client has informed the server 504, but the server 504 has not yet refreshed the page), computes a hash of the contents of the page and compares it to the hash that the search engine provided. If they disagree, the client 502 then sends the server 504 a notification that the content associated with that URL has changed. When the server 504 receives the notification, it changes a status of the freshness flag anti adds the URL to a priority queue for recrawling.
This example can be extended for a scenario where clients send page difference information to a server (which can be utilized either for the server to update its information about a web page without crawling andJor to help prioritize when the server I S should recrawl the web page). This can be accomplished by having a search engine send two additional fields with each search result, namely a time of last client notification and a page hash value from the last client notification. If a client visits a page returned by the search engine and either (a) a known-not-fresh flag is false or (b) a known-not-fresh flag is true AND a hash value from last client notification differs from a hash value this, client computes for a page then a client notifies a server. It is also possible to recognize ~~ycles of page changes so that if a page repeatedly changes from A to B to C to A, the present invention can recognize that and limit the client updates about this page.
In addition to decreasing the amount of unnecessary communication between clients and server, one additional benefit of "Messaging via Search Engine Results Page"
is that it avoids some possible privacy concerns by assuring a client only sends information to a server about a web page the server already knows about. In this manner it is assured that the client does not, for example, visit a page that a client expects to be kept secret and inform the server about the existence of this page.
One disadvantage with the aforementioned instance of the present invention is that a server can only learn information about web pages that it returned to a client via a user search query. This requirement can be relaxed by informing a server about web MS305080.1 pages retunned to a client via an search engine. The client is instrumented to recognize that a user is utilizing any search engine. When the client visits a search result it computes a hash of the content. If the client has previously visited this URL
then it will have cached a hash for the content. If these hashes differ then the client can upload the URL and new hash to the server (as a function of a time since a previous visit and other information). if the client has never visited the URL then the client can upload the URL
and new hash to the server (as a function of a time since a previous visit and other information).
However, if a client had a local copy of a full list of URLs known to a server then when it encountered a potentially novel URL, it could simply check to see if it is in a list of known URLs and only send the URL to the server if it is not already in the list.
Likewise, if the client had a local copy of a full list of <url, hash value>
pairs for all URLs known to the server, it need only send update information if the information is new to the server. The problem with this idea is that it is infeasible to pass these entire lists to each client. For example, a search engine may know about many billions of URLs, which is many gigabytes of data. In addition to a significant bandwidth problem, it is unreasonable to expect each client to devote this large amount of local storage for such lists.
Alternatively, in another instance of the present invention, a communication means is provided that eliminates the significant bandwidth problem. For example, assume an alphabet S is given. Then S* is a set of all strings consisting of letters from S.
Define a dictionary D to be a subset of strings in the set S*. An indicator function I for dictionary D, I: S* ~ {0,1 } has a property that 1(d) = I iff d a D. A weak indicator function I". for dictionary D is a function that has a property that I",(d) =
0 implies d is not in D (in other words, I".(d) = 1 for all d a D and 1"(d) can be either 0 or 1 for any d not in D). Finally, define a proper set of weak indicator functions I = {I",~, Iwl, ..., I","} to be a fnite set of weak indicator functions that have a property that for any d not in D, there exists at least one I"~; a I such that Iw;(d) = 0.
Thus, each client receives a randomly chosen weak indictor function from 1.
These indicator functions are significantly smaller than an overall set of URLs, an~i so it is practical to send them to clients. For any URL already known by a server, an indicator MS305080.1 function correctly determines that it is known. For URLs net known by the server, it may falsely label it as known, in which case a client does nothing. or con ectly label it a:
unknown, in which case the client can inform the server. By definition of a proper set oJ~
vJeak indicator functions, it is guaranteed that any time a web site is visited by a cli °nt that is unknown to a server, there is a nonzero probability that a client's indicator function will recognize that site as new.
To further simplify the example given supra, assume S= {a,b,c,d}, all strin;s in S* are of length less than 4, and a dictionary D = {abc, adc, b, cbd, ddd}. An exert ple of a weak indicator function for this dictionary is:
I(string) = 1 iff (a second character is one of {b, d, null}).
A weak indicator function can be randomly constructed for D as follows:
( 1 ) Randomly partition D into two non-overlapping sub-dictionaries D' and D
"
(2) Randomly choose a weak indicator function I' for D' that consists of a conjunction of one or more terms of the form "the ith character is a member of the set S (S is a subset of S).
(3) Randomly choose a weak indicator function I " for D " in the same way.
(4) Create a function I(x) = 1 iff I'(x) = 1 or I "(x) = 1.
A set of all such weak indicator functions produces a proper set of weak indicator functions. Client dictionaries can be extended also to the problem of detecting peg recency by having a dictionary consisting of <url, page hash value> pairs.
One unique aspect of the present invention is its ability to compare crawler data from a view point of a dedicated crawler and from a view point of a client.
This is particularly important as the sophistication of servers increases. With "smarter"
software, servers are better able to control the flow and access of data residing witl in it.
This includes the ability to block any or all users from accessing some or all of the information found on a server. Even different types of users can be given different "permissions levels" with regard to server access and even time-of access privileges.

MS305080.1 Generally, this increased flexibility is utilized for constructive purposes such as se:urity, enforcing pay access, and preventing malicious hacking. However, it is often time s utilized to mask the real content of web pages found on the server. In FIG. 6, a bhxk diagram of a spoofing process 600 involving a web crawler system 602 in accordance with an aspect of the present invention is shown. The process 600 involves the we b crawler system 602 and a server 604 with a communication system 606 interopera:ive between them. The web crawler system 602 is comprised of a crawler component and a data storage component 610. The server 604 is comprised of a server access control 612, spoof data 614, and actual data 616. When the typical crawler component 608 accesses the server 604, it 608 identifies itself as a web crawler to the server 6~4.
This is deemed being "polite." Politeness is self policing in that a web crawler tha t abuses a server by ignoring server rules will generally be denied access to the serv ~r in the future. Being denied access to a server is especially critical to a search engine which relies on server access to provide content to users of a search engine. Thus, crawlE ~rs typically abide by the politeness rules. Other politeness rules include time-of day access, server resource usage, and non-destructive retrieval of data and the like. In this ex ample, the server access control 612 identifies the crawler component 608 and, instead of directing access to the actual data 616, it 612 directs the crawler component 608 tc the spoof data 614. The spoof data typically contains the same URL information as the actual data 616 but with different content. This is usually done to mask objection ble content. As an example, the server 604 can fool a search engine into returning UR Ls with dog content to ardent cat lovers searching for cat toys. The server 604 compi les spoof data 614 utilizing the correct URLs but the content has been changed to cat ~ elated information. The actual data 616, however, contains dog related information.
This, the crawler component 608 retrieves the spoof data 614 thinking that the URLs relate .o cats, when in fact, they relate to dogs. The crawler component 608 then stores the spoof data 614 in the data storage component 610 which is accessible by a search engine.
Thereafter, a search for cats via the search engine will also return UR,Ls that contain dog information. The dog/cat example may seem benign, but the same technique can f.lso be utilized to mask things such as advertising, pornography, extreme literature, subversive groups, and other subjectively offensive material and the like.

MS3050$0.1 In FIG. 7, a block diagram of an anti-spoofing process 700 involving a web crawler system 702 in accordance with an aspect of the present invention. The process 700 involves the web crawler system 702, a client control component 704, a web s~:rver 706, and a communication system 708 providing interconnectivity. The web crawler system 702 is comprised of a crawler component 710, a data storage component 712 with spoof data 714, and a distributed resources control component 716 with a comparison component 718. The crawler component 710 retrieves the spoof data 714 from the web server 706 as illustrated and described for FIG. 6. The spoof data 714 is then stored in the data storage component 712. At this point, a typical search engine (not illustra~ ed in FIG. 7) accesses the spoof data 714 and disseminates it to users of the search engine unbeknownst of its true contents. However, by utilizing the present invention, the >poof data 714 can be eliminated. This is achievable due to the fact that although a server spoofs crawlers, it typically does not spoof users accessing its web pages.
Since the present invention employs distributed resources such as the client control component ?04, it 704 can access the server 706 as a user and retrieve actual data from the server ?~ )6.
The client control component 704 can then forward the actual data (or "client data' ) and/or a representation of the actual data, to the distributed resources control comF onent 716. The comparison component 718 within the distributed resources control com ~onent 716 can then retrieve the stored spoof data 714 and compare it to the actual data re~;eived from a client. If the data is different, the distributed resources control component ;'16 can overwrite the spoof data 714 residing in the data storage component 712, eliminating this inaccuracy. This permits a search engine to access accurate data that otherwise wculd not be available to it.
In view of the exemplary systems shown and described above, methodolog es that may be implemented in accordance with the present invention will be better apprec fated with reference to the flow charts of FIGs. 8-12. While, for purposes of simplicity c~f explanation, the methodologies are shown and described as a series of blocks, it is to be understood and appreciated that the present invention is not limited by the order of the blocks, as some blocks may, in accordance with the present invention, occur in dif erent orders and/or concurrently with other blocks from that shown and described herein.

MS305080.1 Moreover, not all illustrated blocks may be required to implement the methodologies in accordance with the present invention.
The invention may be described in the general context of computer-execute ble instructions, such as program modules, executed by one or more components.
Generally, S program modules include routines, programs, objects, data structures, erc.
that perform particular tasks or implement particular abstract data types. Typically the functionality of the program modules may be combined or distributed as desired in various embodiments.
Referring to FIG. 8, a flow diagram of a method 800 of client-based web ct awling in accordance with an aspect of the present invention is illustrated. The method 8( 0 starts 802 by a client recording web page information obtained while visiting web gages 804. In a simple instance of the present invention, the information contains only L RLs of the visited web pages. More complex instances of the present invention can incluc.e, for example, URL, hash data of the web page's contents, and time stamps and the like The client then sends the web page information to a server 806. It is also possible, in a ~
instance of the present invention, for the client to inform other clients of the web p age information. Again, in a simple instance, the information can include only URLs, ar in a complex instance, the information can include several different types of data about the web pages. In one instance of the present invention, the client generates additions information derived from the web page information. This data can include, for ex.unple, time periods that a web page is accessible, ease of accessing (overloading, retries t ~
connect, etc.), and embedded link status and the like. Additionally, the web page information can be scheduled, to control when the information is sent. The sched~:ling can be instigated by the client a»dlor by the server. Criteria for sending the inforn~ation can include, but is not limited to, time of day, length of time, date, amount of data gathered, and type of data gathered (e.g., unknown data v. known data, spoof data discovered, etc.) and the like. In order to decrease the volume of information sent from clients to the server, a client, in one instance of the present invention, can keep information locally as to whether it has already informed the server of a particular URL, and only send information to the server if it has not already done so. When the server receives the web page information, it reviews the information to determine if there is any new data relative to data it has already accumulated 808. In a simple instance of the MS305080.1 present invention, this includes determining if any URLs are new compared to the accumulated list of URLs already on the server. When unknown information has been found, the server adds the unknown information to its accumulated or "known"
data 810, ending the flow 812. The known data. in one instance of the present invention, is a URL
list that is employed for future web crawling, downloading, and/or indexing and the like by the server.
Turning to FIG. 9, another flow diagram of a method 900 of client-based w~:b crawling in accordance with an aspect of the present invention is shown. The method 900 starts by a client computing a hash value for contents of a web page it has visited 904. When the client has visited the web page more than once, a previous hash value has been computed and stored for that web page. The client then compares the just computed or "recent'' hash value to the previous hash value for the web page 906. The client in doing the compare can establish a significance of differences found. For example, in one case an entire web page might have changed whereas in another case only a single comma has been added to a sentence. The client can compute the significance of a change and either (a) use this information to prioritize what updates it sends to a server and/or (b) send the significance value to the server along with other web page information so the server can use this information in prioritizing its recrawling/reindexing of the page. Examples of change significance can include, but are not limited to, percentage of document that has changed, linguistic/semantic significance of a change, and estimate of a percentage of user searches that are affected by a change and the like.
Significance can also be weighted by an estimate of the popularity of a page.
Typi~~ally, the client stores web page status information locally and updates this stored information when necessary 908. The client then informs a server about the web page status information 910. It is also possible, in an instance of the present invention, for the client to inform other clients of the web page status information. The manner in which t1~.e server and/or client is notified can include, but is not limited to, URL only, URL p: us new hash, and/or URL plus new hash and old hash and the like. The server (or other client) then compares the client web page status information, if it contains additional information besides a URL, to its own server web page status information 912.
If the server only receives a URL for a web page as a status change, the server typically MS305080.1 instigates a revisiting/crawl of that web page to gain new status information for comparison with its previous server web page status information. The server then updates its web page status information when necessary 914, ending the flow 916. To circumvent the server needing to revisit a web page, the client can send additional information. If the client has a cached copy of the page from its last visit, it can se ~d the old hash value, along with the differences between the old and new versions, and the new hash value. The server first checks if the client's old hash value matches the server's current hash value for that page. If so, it can update the page content accordingly.
In FIG. 10, yet another flow diagram of a method 1000 of client-based web crawling in accordance with an aspect of the present invention is depicted.
The method 1000 starts 1002 by a client initiating a search query on a search server 1004. The search server resolves the search query and compiles a list of search results in response to the query 1006. The search server then constructs a search results page with embedded web page link information 1008. Typical information can include, but is not limited to. a hash of the server's version of a web page's content undlor a flag to indicate whether contents are known not to be fresh for each web page (e.g., another client has informed the ;search server with a new update for the web page, but the search server has not yet refreshed the web page). Thus, a web page with a "known not to be fresh" flag is a web page that the search server does not want the client requesting the search to send update information about. The search server then sends the search results page with embedded links to the client that requested the search 1010. As the client visits web pages that are listed on the search results page, it checks the embedded freshness flag (or freshness status) provided by the search server 1012. The client computes a hash of the contents of a web page it visits when the freshness status is "fresh" 1014. A fresh status indicates that the search server believes it possesses the latest or freshest version of a web page.
Thus, the ~;lient computes a new hash of the contents of the web page and compares it to an embed 3ed hash provided by the search server 1016. The client then notifies the search server whenever a difference or delta is found between the new hash and the search server provided hash 1018. The search server then receives the notification and updates the freshness status to "known not to be fresh" and also adds the web page to a list for recrawling 1020, ending the flow 1022. The recrawling list, in this instance of the MS305080.1 present invention, is the method the search server utilizes to update its hash of the contents of a listed web page with a "known not to be fresh" status. The search server "recrawls" or re-visits the web page in order to complete the update.
In another instance, the supra method is extended to construct a method where clients send page difference information to a search server (which is then utilized either for the search server to update its information about a web page without crawling arrdlor to facilitate prioritization when the search server should recrawl a web page) by having the search server send additional fields with each search result including, but not li nited to, time of last client notification and a web page hash value from the last client notification. If a client visits a page returned by the search server and either (a) a "known not to be fresh" flag is false or (b) a "known not to be fresh" is true AND a hash value from the last client notification differs from a hash value this client computes for a web page then the client notifies the search server. It is also possible to recognize cycles of page changes so that if a page repeatedly changes from A to B to C to A, it can rec ~gnize that and limit the client updates about this page.
By utilizing a search results page, traffic between a client and a server is drastically reduced in a client-based web crawler as denoted by the present invention.
Additionally, client privacy is maintained due to the fact that only web pages that a: server has provided in a search results page are updated by a client. In this manner, if a c lient visits a web page that has restricted access, this information is not inadvertently seat to a search server. The advantage of this method is also a disadvantage in that the sear~:h server cannot utilize a client to expand its known web pages for employment in se:~rches, even if a new web page is not private.
In another instance of the present invention, a method (not illustrated) expl pits not only a search server's web page information, but exploits other search server's web page information as well. Thus, a new web page returned by another search server to a client can be utilized to notify the search server that a new web page exists. This still mantains privacy for a client because it only notifies the search server of publicly available web pages that the search server does not have listed. 'This enables the search server to add unknown web pages without compromising the client's trust. The notification can include, but is not limited to, a URL for the web page, a hash of contents of the wf~b page, MS305080.1 a time stamp of web page access, and a delta of new hash compared to previous ha:;h for the web page and the like.
Turning to FIG. I 1, still yet another flow diagram of a method 1100 of clieot-based web crawling in accordance with an aspect of the present invention is shown. The method 1100 starts 1102 by a search server generating a set of weak flossy) indicator functions I 104. The method for generating these functions is discussed infra.
The search server transmits randomly selected weak indicator functions to clients comprising a client-based web crawler 1106. A client then generates web page data for web pages that are indicated as nor known by the randomly selected weak indicator function l Generally, only the not known web pages are accurately represented by the weak indicator function. "Known" web pages may or may not be truly known. The clie it then transmits the unknown web page data to the server I 110. The server then utilizes this data to update its information relating to web pages 1112, ending the flow 1114.
Referring to FIG. 12, a flow diagram of a method 1200 of generating a proper set I 5 of weak indicator functions for client-based web crawling in accordance with an a~ pect of the present invention is illustrated. The method 1200 starts 1202 by randomly partitioning a dictionary representative of web page information residing on a sear~:h server into non-overlapping subdictionaries 1204. Typically, the subdictionaries a ~e chosen such that they each represent common traits among a grouping of web page information. A weak flossy) indicator function is then randomly chosen for each subdictionary to represent web page information found in a particular subdictionary 1206.
A function is then created such that I(x) = I , if and only if at least one subdictiona~ y's weak function is equal to one 1208, ending the flow 1210. In this manner a "prop<:r set"
of weak indicator functions is generated. Thus, for example, for any URL
already known by a server, the indicator function correctly determines that it is known. For URL~; not known by the server, it may falsely label it as known, in which case a client does r othing, or it may correctly label it as unknown, in which case the client can inform the serer.
By definition, a proper set of weak indicator functions guarantees that any time a web site is visited by a client that is unknown to a server, there is a nonzero probability that the client's indicator function will recognize that site as new.

MS305080.1 In order to provide additional context for implementing various aspects of t)~
a present invention, FIG. 13 and the following discussion is intended to provide a brief, general description of a suitable computing environment 1300 in which the various aspects of the present invention may be implemented. While the invention has beer.
described above in the general context of computer-executable instructions of a con iputer program that runs on a local computer and/or remote computer, those skilled in the art will recognize that the invention also may be implemented in combination with other program modules. Generally, program modules include routines, programs, components, data structures, e~c. that perform particular tasks and/or implement particular abstract data types. Moreover, those skilled in the art will appreciate that the inventive methods may be practiced with other computer system configurations, including single-prod=ssor or mufti-processor computer systems, minicomputers, mainframe computers, as we l as personal computers, hand-held computing devices, microprocessor-based and/or programmable consumer electronics, and the like, each of which may operatively communicate with one or more associated devices. The illustrated aspects of the invention may also be practiced in distributed computing environments where certain tasks are performed by remote processing devices that are linked through a communications network. However, some, if not all, aspects of the invention may ~e practiced on stand-alone computers. In a distributed computing environment, program modules may be located in local and/or remote memory storage devices.
As used in this application, the term "component" is intended to refer to a computer-related entity, either hardware, a combination of hardware and software, software, or software in execution. For example, a component may be, but is not li mited to, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and a computer. By way of illustration, an application running on a server and/or the server can be a component. In addition, a component may inclL de one or more subcomponents.
With reference to FIG. 13, an exemplary system environment 1300 for implementing the various aspects of the invention includes a conventional compute r 1302, including a processing unit 1304, a system memory 1306, and a system bus l 308 that couples various system components, including the system memory, to the processing MS305080.1 unit 1304. The processing unit 1304 may be any commercially available or proprietary processor. In addition, the processing unit may be implemented as mufti-processor formed of more than one processor, such as may be connected in parallel.
The system bus 1308 may be any of several types of bus structure including a S memory bus or memory controller. a peripheral bus. and a local bus using any of a variety of conventional bus architectures such as PCI, VESA, Microchannel, ISA, and EISA, to name a few. The system memory 1306 includes read only memory (ROM}
1310 and random access memory (RAM) 1312. A basic input/output system (BIO;i) 1314, containing the basic routines that help to transfer information between elements within the computer 1302, such as during start-up, is stored in ROM 1310.
The computer 1302 also may include, for example, a hard disk drive 1316, i magnetic disk drive 1318, e.g., to read from or write to a removable disk 1320, and an optical disk drive 1322, e.g., for reading from or writing to a CD-ROM disk 1324 c~r other optical media. The hard disk drive 1316, magnetic disk drive 1318, and optical disk drive I S 1322 are connected to the system bus 1308 by a hard disk drive interface 1326, a magnetic disk drive interface 1328, and an optical drive interface 1330, respective) y. The drives 1316-1322 and their associated computer-readable media provide nonvolatile storage of data. data structures, computer-executable instructions, etc. for the comb uter 1302. Although the description of computer-readable media above refers to a hard disk, a removable magnetic disk and a CD, it should be appreciated by those skilled in the art that other types of media which are readable by a computer, such as magnetic cass~ ~ttes, flash memory cards, digital video disks, Bernoulli cartridges, and the like, can also be used in the exemplary operating environment I 300, and further that any such medi ~ may contain computer-executable instructions for performing the methods of the preser t invention.
A number of program modules may be stored in the drives 1316-1322 and ItAM
1312, including an operating system 1332, one or more application programs 1334, other program modules 1336, and program data 1338. The operating system 1332 may I~e any suitable operating system or combination of operating systems. By way of examp; e, the application programs 1334 and program modules 1336 can include facilitating client based web crawling in accordance with an aspect of the present invention.

MS305080.1 A user can enter commands and information into the computer 1302 through one or more user input devices, such as a keyboard 1340 and a pointing device (e.g., a riouse 1342). Other input devices (not shown) may include a microphone, a joystick, a game pad, a satellite dish, wireless remote, a scanner, or the like. 'These and other input cevices are often connected to the processing unit 1304 through a serial port interface 1344 that is coupled to the system bus 1308, but may be connected by other interfaces, such as ;i parallel port, a game port or a universal serial bus (USB). A monitor 1346 or other type of display device is also connected to the system bus 1308 via an interface, such as a video adapter 1348. In addition to the monitor 1346, the computer 1302 may include other peripheral output devices (not shown), such as speakers, printers, etc.
It is to be appreciated that the computer 1302 can operate in a networked environment using logical connections to one or more remote computers 1360.
Th~:
remote computer 1360 may be a workstation, a server computer, a router, a peer device or other common network node, and typically includes many or all of the elements described relative to the computer 1302, although, for purposes of brevity.
only a memory storage device 1362 is illustrated in FIG. 13. The logical connections depicted in FIG. 13 can include a local area network (LAN) 1364 and a wide area network ( WAN) 1366. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets and the Internet.
When used in a LAN networking environment, for example, the computer : 302 is connected to the local network 1364 through a network interface or adapter 1368. When used in a WAN networking environment, the computer 1302 typically includes a modem (e.g., telephone, DSL, cable, etc.) 1370, or is connected to a communications server on the LAN, or has other means for establishing communications over the WAN 136E, such as the Internet. The modem I 370, which can be internal or external relative to the computer 1302, is connected to the system bus I 308 via the serial port interface 1344. In a networked environment, program modules (including application programs 1334) and/or program data 1338 can be stored in the remote memory storage device 136;'.. It will be appreciated that the network connections shown are exemplary and other means (e.g., wired or wireless) of establishing a communications link between the computers 1302 and 1360 can be used when carrying out an aspect of the present invention.

MS305080.1 In accordance with the practices of persons skilled in the art of computer programming, the present invention has been described with reference to acts and symbolic representations of operations that are performed by a computer, such as tl~e computer 1302 or remote computer 1360, unless otherwise indicated. Such acts an3 S operations are sometimes referred to as being computer-executed. It will be appreciated that the acts and symbolically represented operations include the manipulation by t ~e processing unit 1304 of electrical signals representing data bits which causes a resulting transformation or reduction of the electrical signal representation, and the maintem: nce of data bits at memory locations in the memory system (including the system memory 1306, hard drive 1316, floppy disks 1320, CD-ROM 1324, and remote memory 1362) to thereby reconfigure or otherwise alter the computer system's operation, as well as ether processing of signals. The memory locations where such data bits are maintained are physical locations that have particular electrical, magnetic, or optical properties corresponding to the data bits.
FIG. 14 is another block diagram of a sample computing environment 1400 with which the present invention can interact. The system 1400 further illustrates a system that includes one or more clients) 1402. The clients) 1402 can be hardware andlc~r software (e.g., threads, processes, computing devices). The system 1400 also includes one or more servers) 1404. The server{s) 1404 can also be hardware and/or software (e.g., threads, processes, computing devices). The servers 1404 can house threads to perform transformations by employing the present invention, for example. One possible communication between a client 1402 and a server 1404 may be in the form of a d:~ta packet adapted to be transmitted between two or more computer processes. The sy stem 1400 includes a communication framework 1408 that can be employed to facilitate communications between the clients) 1402 and the servers) 1404. The clients) are operably connected to one or more client data stores) 1410 that can be employed to store information local to the clients) 1402. Similarly, the servers) 1404 are operably connected to one or more server data stores) 1406 that can be employed to store information local to the servers 1404.
In one instance of the present invention, a data packet transmitted between two or more computer components that facilitate web crawling, the data packet is comprised of, MS305080. I
at least in pan, information relating to web crawling that utilizes, at least in part, a distributed system for web crawling.
In another instance of the present invention. a computer readable medium st Bring computer executable components of a system for facilitating web crawling is comprised of,, at least in part, a web crawling system that determines, at least in part, information pertaining to web pages compiled by a distributed system for web crawling.
It is to be appreciated that the systems and/or methods of the present invention can be utilized in web crawling systems facilitating computer components and non-computer related components alike. Further, those skilled in the art will recognize that the systems and/or methods of the present invention are employable in a vast array of electronic related technologies. including, but not limited to, computers, servers ancUor handheld electronic devices and the like which can be wired and/or wireless and th~~ like.
One skilled in the art will also appreciate that the present invention can be utilized not only for server to client based crawling systems but also for peer-to-peer crawling systems. It is also possible that a client can perform tasking typically associated wi ch "server" behavior and thus transfer some characteristics associated with the server to the client in some instances of the present invention. An example of one instance of th~:
present invention is a client that performs "sub-crawls" to other clients to ascertain and/or retrieve information to send to a server. This instance can be beneficial, for example, in networks that have bottlenecks between certain clients and a server. D;ita can be transferred to a client with the best access to the server. In other instances o .-'the present invention, a client can exhibit server behavior by initiating sub-crawls in an intranet system, thus reporting out information to a server from only a single and/or substantially reduced number of clients present on the intramet. In this manner a se~uch server coot initiate multiple sub-crawls in clients to expand its crawling resources.
What has been described above includes examples of the present invention. It is, of course, not possible to describe every conceivable combination of components o r methodologies for purposes of describing the present invention, but one of ordinary skill in the art may recognize that many further combinations and permutations of the present invention are possible. Accordingly, the present invention is intended to embrace all such alterations, modifications and variations that fall within the spirit and scope oi'the MS305080.1 appended claims. Furthermore, to the extent that the term "includes" is used in either the detailed description or the claims, such term is intended to be inclusive in a manner similar to the term "comprising'' as "comprising'' is interpreted when employed as ~
transitional word in a claim.

Claims (116)

What is claimed is:
1. A data analysis system comprising:
a first component that facilitates generation of a first data set related to web page information obtained via a communication system; and a second component that coordinates a data set relating to web page information from at least one distributed resource which interacts with the communication system; the second data set is utilized to refine the first data set.
2. The system of claim 1, the first component comprising an intern a web crawler.
3. The system of claim 1, the first component comprising an intranet web crawler.
4. The system of claim 1, the second component further utilized to optimize reception of data from the distributed resources.
5. The system of claim 1, the second component provides a scheduling function to control reception of the second data set from the at least one distributed resource.
6. The system of claim 1, the second component utilized to facilitate communication traffic reduction via the communication system by employing a proper set of weak indicator functions representative of the first data set.
7. The system of claim 6, the second component further utilized to randomly select and transmit a weak indicator function selected from the proper set of weak indicator functions to at least one of the distributed resources.
8. The system of claim 1, the second component further utilized to compare the first data set and the second data set to detect spoof data retrieved by the first component.
9. The system of claim 1, the second component further utilized to generate status information about data related to the first data set; the status information transmitted to at least one distributed resource.
10. The system of claim 9, the status information comprising, at least in part, a freshness flag to indicate freshness of information related to the first data set.
11. The system of claim 9, the status information comprising, at least in part, a hash of contents of information related to the first data set.
12. The system of claim 9, the status information comprising, at least in part, a copy of information of the first data set.
13. The system of claim 1, the communication system comprising an internet.
14. The system of claim 1, the communication system comprising a world wide web.
15. The system of claim 1, the communication system comprising an intranet.
16. The system of claim 15, the intranet comprising a local area network.
17. The system of claim 15, the intranet comprising a wide area network.
18. The system of claim 1, the distributed resources comprising clients of a server.
19. The system of claim 1, the distributed resources comprising trusted entities interactive with the communication system and the second component.
20. The system of claim 1, the first data set comprising Internet web page data.
21. The system of claim 1, the first data set comprising intranet web page data.
22. The system of claim 1, the second data set utilized to add additional data to the first data set; the additional data comprising data unknown to the first component.
23. The system of claim 1, the second data set comprising, at least in part, a hash of contents of at least one web page.
24. The system of claim 1, the second data set comprising, at least in part, a Uniform Resource Locator (URL) of at least one web page.
25. The system of claim 1, the second data set comprising, at least in part, a time stamp relating to an acquisition time for information about at least one web page.
26. The system of claim 1, the second data set comprising, at least in part, a delta indication of changes to contents of at least one web page.
27. The system of claim 26, the delta indication including, at least in part, a hash of previous contents of a web page and a hash of recent contents of the web page.
28. The system of claim 1, the second data set comprising, at least in part a status indication of changes to contents of at least one web page.
29. The system of claim 28, the status indication including at least in part, a percentage relating to an amount of change of contents of a web page.
30. The system of claim 28, the status indication including, at least in part, a significance indicator to signify importance of changes in contents of a web page.
31. The system of claim 1, the second data set comprising internet web page data.
32. The system of claim 1, the second data set comprising intranet web page data.
33. The system of claim 1, the second data set comprising data compiled utilizing at least one weak indicator function randomly selected from a set of weak indicator functions; the set of weak indicator functions representative of the first data set.
34. The system of claim 1, further comprising a search component to accept at least one search query and generate at least one search reply having at least a portion of the first data set represented by information embedded in the search reply.
35. The system of claim 1, further comprising a web page server component to construct web pages having at least a portion of the first data set represented by information embedded in at least one link found on at least one constructed web page.
36. The system of claim 1, further comprising a storage component to store the first data set.
37. A method for facilitating data analysis, comprising:
generating a first data set relating to a second data set obtained from web pages interactive with a communication system;
receiving a third data set from at least one distributed resource that is interactive with the communication system; the third data set comprising web page related information generated by the distributed resource; and refining the second data set to reflect information obtained from the third data set.
38. The method of claim 37, the first data set comprising a representation of the second data set.
39. The method of claim 38, the representation of the second data set comprising, at least in part, a hash of contents of at least one web page contained in the second data set.
40. The method of claim 38, the representation of the second data set comprising, at least in part, a status indication of at least one web page contained in the second data set.
41. The method of claim 40, the status indication comprising a freshness flag to indicate if the web page information is current.
42. The method of claim 37, the first data set comprising a copy of the second data set.
43. The method of claim 37, the second data set comprising web page information compiled by a web crawler.
44. The method of claim 37, the third data set comprising web page information based upon client accessed web page information on the communication system.
45. The method of claim 37, the distributed resource comprising a client of a distributed crawler system.
46. The method of claim 37, the communication system comprising an internet.
47. The method of claim 37, the communication system comprising an intranet.
48. The method of claim 37, refining the second data set comprising:
adding unknown information to the second data set when new information a received from the distributed source via the third data set;
updating existing information in the second data set when changes have occurred as indicated by the third data set; and resetting any indicators utilized to pass status information to the distributed resources after information from the third data set has been analyzed.
49. The method of claim 37, further including:
transmitting the first data set to at least one distributed resource that is inter active with the communication system making the first data set available to be utilized by the distributed resource to generate the third data set.
50. The method of claim 38, further including:
generating a set of weak indicator functions to represent the second data set and selecting random weak indicator functions from the set of weak indicator functions to transmit to the distributed resources as the first data set.
51. The method of claim 50, the set of weak indicator functions comprising a proper set of weak indicator functions such that a non-zero probability exists that a randomly selected weak indicator function can identify a new web page.
52. The method of claim 50, generating a set of weak indicator functions comprising:
providing a dictionary representative of the second data set;
partitioning randomly the dictionary into non-overlapping subdictionaries; and creating a function where 1(x) = 1 if and only if at least one subdictionary's weak indicator function is equal to one.
53. The method of claim 37, further including:
comparing the third data set to the second data set to reveal spoof data included in the second data set.
54. The method of claim 37, further including:
optimizing reception of at least one third data set through scheduling of the distributed resources.
55. The method of claim 37, further including:
receiving a web page search query from at least one distributed resource;
generating a web search results page in response to the web page search query from the distributed resource;
embedding portions of the first data set in links found on the web search results page; and transmitting the web search results page as a representation of at least a potion of the second data set to the distributed resource.
56. The method of claim 37, further including:
constructing a web page utilizing at least a portion of the first data set to embed information about links found in the web page; and transmitting the web page to disseminate the first data set to at least one distributed resource.
57. A data analysis system, comprising:
means for generating at least one first data set from a communication system;
means for receiving and coordinating at least one second data set from at least one distributed resource which interacts with the communication system; and means for refining the first data set utilizing at least one second data set.
58. The system of claim 57, the means for generating at least one first data set including a web crawler.
59. The system of claim 58, the first data set comprising data relating to web pages obtained by the web crawler.
60. The system of claim 57, the second data set comprising web page comparison data compiled by at least one distributed resource and based, at least in part, upon representative data of the first data set.
61. A data analysis system, comprising:
a first component that generates web page information from at least one visited web site for utilization in a distributed web crawling system; the web page information transmitted by the first component to a second component via a communication system.
62. The system of claim 61, the first component providing at least one time stamp relevant to a time of acquisition of data utilized in the generation of the web page information.
63. The system of claim 61, the first component receiving a set of embedded web crawler data from at least one search result page to utilize in the generation of the web page information.
64. The system of claim 61, the first component receiving a set of embedded web crawler data from at least one web page to utilize in the generation of the web page information.
65. The system of claim 61, the first component further operational to obtain web page data indirectly via at least one other client of the distributed crawler system to provide a gateway to a second component to substantially reduce traffic flow to the second component.
66. The system of claim 61, the first component receiving web page related data from at least one client and at least one server of the distributed web crawling system.
67. The system of claim 61, the generated web page information comprising, at least in part, a status indication of changes to contents of at least one web page.
68. The system of claim 67, the status indication including, at least in part, a percentage relating to an amount of change of contents of a web page.
69. The system of claim 67, the status indication including, at least in part, a significance indicator to signify importance of changes in contents of a web page.
70. The system of claim 61, at least a portion of the generated web page information made available for peer-to-peer client transmission via the communication system.
71. The system of claim 61, the generated web page information compiled utilizing a randomly selected weak indicator function from a proper set of weal:
indicator functions that represent web page data compiled by a web crawler.
72. The system of claim 61, the communication system comprising an internet.
73. The system of claim 61, the communication system comprising an intranet.
74. The system of claim 61, further comprising a storage component to store the web page information.
75. The system of claim 61, further comprising a notification component that determines when and if the generated web page information is to be communicated via the communication system.
76. The system of claim 75, the notification component receiving scheduling information from a second component; the scheduling information relating to obtaining and transmitting the generated web page information.
77. The system of claim 61, the first component receiving a set of data from a second component to utilize in the generation of the web page information.
78. The system of claim 77, the first component utilizing web search servers outside of the distributed web crawling system to retrieve data unknown to the second component.
79. The system of claim 77, the first component generates comparison data based on the web page information and the received set of data; the first component making the comparison data discretionarily available to the second component via the communication system.
80. The system of claim 79, the comparison data including, at least in part, at least one Uniform Resource Locator (URL) of at least one web page.
81. The system of claim 79, the comparison data including, at least in part, a hash of contents of at least one web page representative of a recent web site visit.
82. The system of claim 79, the comparison data including, at least in part, a delta indication of contents of at least one web page.
83. The system of claim 82, the delta indication including, at least in part, a hash of previous contents of a web page and a hash of recent contents of the web page.
84. The system of claim 77, the second component comprising a server of the distributed crawling system.
85. The system of claim 77, the second component comprising a client of the distributed crawling system.
86. The system of claim 77, the generated web page information comprising data unknown to the second component.
87. The system of claim 77, at least a portion of the received set of data made available for peer-to-peer client transmission via the communication system.
88. The system of claim 77, the received set of data comprising a dictionary for data compiled by a web crawler.
89. The system of claim 77, the received set of data comprising a representation of data compiled by a web crawler; the representation of data generated by utilizing a weak indicator function.
90. The system of claim 77, the received set of data comprising a copy of data compiled by a web crawler.
91. The system of claim 77, further comprising a storage component to store the set of data received from the second component.
92. A method for facilitating data analysis. comprising:
compiling a first data set derived from accessing web pages via a communication system; and transmitting, selectively, the first data set to an entity of a distributed crawling system that is interactive with the communication system.
93. The method of claim 92, the entity comprising a server of the distributed crawling system.
94. The method of claim 92, the entity comprising at least one client of the distributed crawling system.
95. The method of claim 92, the first data set comprising, at least in part, a uniform resource locator (URL) for at least one web page.
96. The method of claim 92, the first data set comprising, at least in part, a hash of contents of at least one web page.
97. The method of claim 92, selectively transmitting based upon time of day.
98. The method of claim 92, selectively transmitting based upon priority of at least one web page.
99. The method of claim 92, selectively transmitting based upon percentage of content change of at least one web page.
100. The method of claim 92. selectively transmitting based upon identifying at least one new web page.
101. The method of claim 92, further comprising:
receiving a representation of a second data set compiled by a web crawler; the second data set relating to at least one web page from the communication system.
102. The method of claim 101, receiving the representation of the second data set is accomplished via reception of a web page with embedded information derived from the second data set and generated by a web page hosting server with access to the second data set.
103. The method of claim 101, receiving the representation of the second data set is accomplished via reception of a search results page with embedded information derived from the second data set and generated in response to a query transmitted to a search server having access to the second data set.
104. The method of claim 101, further comprising:
utilizing the second data set to control which web pages to visit to compile the first data set.
105. The method of claim 101, further comprising:
determining when to transmit the first data set via the communication system based upon the second data set.
106. The method of claim 105, the second data set containing a freshness indicator to indicate when its data is stale and requires updating via the first data set.
107. The method of claim 105, the second data set containing a schedule for when the first data set is to be transmitted.
108. The method of claim 101, further comprising:
comparing at least a portion of the second data set with at least a portion of information obtained via accessing web pages to create comparison data; and generating a representation of the comparison data to derive the first data set.
109. The method of claim 108, the first data set comprising data unknown to the second data set.
110. The method of claim 109, the unknown data comprising only unknown data derived from at least one search results page from a search server outside of the distributed crawling system.
111. The method of claim 108. the first data set comprising content changes to web pages represented by the second data set.
112. The method of claim 108, the first data set comprising status information relating to web pages represented by the second data set.
113. A data packet transmitted between two or more computer components that facilitate information gathering, the data packet comprising, at least in part, information relating to web crawling that utilizes, at least in part, a distributed system for gathering information about web pages.
114. A computer readable medium having stored thereon computer executable components of the system of claim 1.

44~~
115. A device employing the method of claim 37 comprising at least one selected from the group consisting of a computer, a server, and a handheld electronic device.
116. A device employing the system of claim 1 comprising at least one selected from the group consisting of a computer, a server, and a handheld electronic device.
CA002478358A 2003-09-25 2004-08-20 Systems and methods for client-based web crawling Abandoned CA2478358A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US10/670,681 US7685296B2 (en) 2003-09-25 2003-09-25 Systems and methods for client-based web crawling
US10/670,681 2003-09-25

Publications (1)

Publication Number Publication Date
CA2478358A1 true CA2478358A1 (en) 2005-03-25

Family

ID=34194835

Family Applications (1)

Application Number Title Priority Date Filing Date
CA002478358A Abandoned CA2478358A1 (en) 2003-09-25 2004-08-20 Systems and methods for client-based web crawling

Country Status (12)

Country Link
US (1) US7685296B2 (en)
EP (1) EP1519281A3 (en)
JP (1) JP4668567B2 (en)
KR (1) KR101153138B1 (en)
CN (1) CN1601528B (en)
AU (1) AU2004205329B2 (en)
BR (1) BRPI0403803A (en)
CA (1) CA2478358A1 (en)
MY (2) MY143875A (en)
RU (1) RU2383920C2 (en)
TW (1) TWI367428B (en)
ZA (1) ZA200407180B (en)

Families Citing this family (172)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7540021B2 (en) 2000-04-24 2009-05-26 Justin Page System and methods for an identity theft protection bot
US8527495B2 (en) * 2002-02-19 2013-09-03 International Business Machines Corporation Plug-in parsers for configuring search engine crawler
US7725452B1 (en) * 2003-07-03 2010-05-25 Google Inc. Scheduler for search engine crawler
US8707312B1 (en) * 2003-07-03 2014-04-22 Google Inc. Document reuse in a search engine crawler
US7346839B2 (en) 2003-09-30 2008-03-18 Google Inc. Information retrieval based on historical data
CA2447961A1 (en) * 2003-10-31 2005-04-30 Ibm Canada Limited - Ibm Canada Limitee Research data repository system and method
US7873724B2 (en) * 2003-12-05 2011-01-18 Microsoft Corporation Systems and methods for guiding allocation of computational resources in automated perceptual systems
US20050149615A1 (en) * 2003-12-17 2005-07-07 Nedimyer Joseph P. System and method for processing resource registry updates without regard to chronological order
US8452880B2 (en) * 2003-12-22 2013-05-28 Oracle International Corporation System and method for verifying intended contents of an electronic message
US7299222B1 (en) * 2003-12-30 2007-11-20 Aol Llc Enhanced search results
US20050192948A1 (en) * 2004-02-02 2005-09-01 Miller Joshua J. Data harvesting method apparatus and system
US8131702B1 (en) 2004-03-31 2012-03-06 Google Inc. Systems and methods for browsing historical content
US9203648B2 (en) * 2004-05-02 2015-12-01 Thomson Reuters Global Resources Online fraud solution
US20070107053A1 (en) * 2004-05-02 2007-05-10 Markmonitor, Inc. Enhanced responses to online fraud
US8041769B2 (en) * 2004-05-02 2011-10-18 Markmonitor Inc. Generating phish messages
US7992204B2 (en) 2004-05-02 2011-08-02 Markmonitor, Inc. Enhanced responses to online fraud
US7870608B2 (en) * 2004-05-02 2011-01-11 Markmonitor, Inc. Early detection and monitoring of online fraud
US7457823B2 (en) 2004-05-02 2008-11-25 Markmonitor Inc. Methods and systems for analyzing data related to possible online fraud
US8769671B2 (en) * 2004-05-02 2014-07-01 Markmonitor Inc. Online fraud solution
US7913302B2 (en) * 2004-05-02 2011-03-22 Markmonitor, Inc. Advanced responses to online fraud
US7987172B1 (en) * 2004-08-30 2011-07-26 Google Inc. Minimizing visibility of stale content in web searching including revising web crawl intervals of documents
US8386459B1 (en) * 2005-04-25 2013-02-26 Google Inc. Scheduling a recrawl
US8666964B1 (en) 2005-04-25 2014-03-04 Google Inc. Managing items in crawl schedule
US8312074B2 (en) * 2005-05-26 2012-11-13 Bytemobile, Inc. Method for multipart encoding
US7509315B1 (en) 2005-06-24 2009-03-24 Google Inc. Managing URLs
CA2613083A1 (en) * 2005-07-01 2007-01-11 Markmonitor Inc. Enhanced fraud monitoring systems
KR100705413B1 (en) * 2005-08-19 2007-04-10 엔에이치엔(주) Desktop Search System and Method for Automatically Crawling Registered Web Page and Providing Search Result
US8321198B2 (en) 2005-09-06 2012-11-27 Kabushiki Kaisha Square Enix Data extraction system, terminal, server, programs, and media for extracting data via a morphological analysis
US8812526B2 (en) 2005-09-14 2014-08-19 Millennial Media, Inc. Mobile content cross-inventory yield optimization
US20110313853A1 (en) 2005-09-14 2011-12-22 Jorey Ramer System for targeting advertising content to a plurality of mobile communication facilities
US8195133B2 (en) 2005-09-14 2012-06-05 Jumptap, Inc. Mobile dynamic advertisement creation and placement
US7577665B2 (en) * 2005-09-14 2009-08-18 Jumptap, Inc. User characteristic influenced search results
US20080214153A1 (en) * 2005-09-14 2008-09-04 Jorey Ramer Mobile User Profile Creation based on User Browse Behaviors
US10592930B2 (en) 2005-09-14 2020-03-17 Millenial Media, LLC Syndication of a behavioral profile using a monetization platform
US10911894B2 (en) 2005-09-14 2021-02-02 Verizon Media Inc. Use of dynamic content generation parameters based on previous performance of those parameters
US7769764B2 (en) * 2005-09-14 2010-08-03 Jumptap, Inc. Mobile advertisement syndication
US8615719B2 (en) 2005-09-14 2013-12-24 Jumptap, Inc. Managing sponsored content for delivery to mobile communication facilities
US8660891B2 (en) 2005-11-01 2014-02-25 Millennial Media Interactive mobile advertisement banners
US9471925B2 (en) 2005-09-14 2016-10-18 Millennial Media Llc Increasing mobile interactivity
US8503995B2 (en) 2005-09-14 2013-08-06 Jumptap, Inc. Mobile dynamic advertisement creation and placement
US9058406B2 (en) 2005-09-14 2015-06-16 Millennial Media, Inc. Management of multiple advertising inventories using a monetization platform
US20070100806A1 (en) * 2005-11-01 2007-05-03 Jorey Ramer Client libraries for mobile content
US20080214204A1 (en) * 2005-11-01 2008-09-04 Jorey Ramer Similarity based location mapping of mobile comm facility users
US20080214154A1 (en) * 2005-11-01 2008-09-04 Jorey Ramer Associating mobile and non mobile web content
US8989718B2 (en) 2005-09-14 2015-03-24 Millennial Media, Inc. Idle screen advertising
US7912458B2 (en) 2005-09-14 2011-03-22 Jumptap, Inc. Interaction analysis and prioritization of mobile content
US8238888B2 (en) 2006-09-13 2012-08-07 Jumptap, Inc. Methods and systems for mobile coupon placement
US8364521B2 (en) * 2005-09-14 2013-01-29 Jumptap, Inc. Rendering targeted advertisement on mobile communication facilities
US20080215557A1 (en) * 2005-11-05 2008-09-04 Jorey Ramer Methods and systems of mobile query classification
US8819659B2 (en) 2005-09-14 2014-08-26 Millennial Media, Inc. Mobile search service instant activation
US8290810B2 (en) 2005-09-14 2012-10-16 Jumptap, Inc. Realtime surveying within mobile sponsored content
US8532633B2 (en) 2005-09-14 2013-09-10 Jumptap, Inc. System for targeting advertising content to a plurality of mobile communication facilities
US10038756B2 (en) 2005-09-14 2018-07-31 Millenial Media LLC Managing sponsored content based on device characteristics
US8364540B2 (en) 2005-09-14 2013-01-29 Jumptap, Inc. Contextual targeting of content using a monetization platform
US8103545B2 (en) 2005-09-14 2012-01-24 Jumptap, Inc. Managing payment for sponsored content presented to mobile communication facilities
US7676394B2 (en) 2005-09-14 2010-03-09 Jumptap, Inc. Dynamic bidding and expected value
US9703892B2 (en) 2005-09-14 2017-07-11 Millennial Media Llc Predictive text completion for a mobile communication facility
US8229914B2 (en) * 2005-09-14 2012-07-24 Jumptap, Inc. Mobile content spidering and compatibility determination
US8156128B2 (en) 2005-09-14 2012-04-10 Jumptap, Inc. Contextual mobile content placement on a mobile communication facility
US9201979B2 (en) * 2005-09-14 2015-12-01 Millennial Media, Inc. Syndication of a behavioral profile associated with an availability condition using a monetization platform
US8832100B2 (en) * 2005-09-14 2014-09-09 Millennial Media, Inc. User transaction history influenced search results
US7702318B2 (en) 2005-09-14 2010-04-20 Jumptap, Inc. Presentation of sponsored content based on mobile transaction event
US9076175B2 (en) 2005-09-14 2015-07-07 Millennial Media, Inc. Mobile comparison shopping
US20090240568A1 (en) * 2005-09-14 2009-09-24 Jorey Ramer Aggregation and enrichment of behavioral profile data using a monetization platform
US20080270220A1 (en) * 2005-11-05 2008-10-30 Jorey Ramer Embedding a nonsponsored mobile content within a sponsored mobile content
US8302030B2 (en) 2005-09-14 2012-10-30 Jumptap, Inc. Management of multiple advertising inventories using a monetization platform
US7660581B2 (en) * 2005-09-14 2010-02-09 Jumptap, Inc. Managing sponsored content based on usage history
US8027879B2 (en) * 2005-11-05 2011-09-27 Jumptap, Inc. Exclusivity bidding for mobile sponsored content
US8209344B2 (en) 2005-09-14 2012-06-26 Jumptap, Inc. Embedding sponsored content in mobile applications
US20080214148A1 (en) * 2005-11-05 2008-09-04 Jorey Ramer Targeting mobile sponsored content within a social network
US8805339B2 (en) 2005-09-14 2014-08-12 Millennial Media, Inc. Categorization of a mobile user profile based on browse and viewing behavior
US20070060173A1 (en) * 2005-09-14 2007-03-15 Jorey Ramer Managing sponsored content based on transaction history
US7752209B2 (en) 2005-09-14 2010-07-06 Jumptap, Inc. Presenting sponsored content on a mobile communication facility
US8666376B2 (en) * 2005-09-14 2014-03-04 Millennial Media Location based mobile shopping affinity program
US8131271B2 (en) 2005-11-05 2012-03-06 Jumptap, Inc. Categorization of a mobile user profile based on browse behavior
US8688671B2 (en) 2005-09-14 2014-04-01 Millennial Media Managing sponsored content based on geographic region
US20070061246A1 (en) * 2005-09-14 2007-03-15 Jorey Ramer Mobile campaign creation
US8311888B2 (en) * 2005-09-14 2012-11-13 Jumptap, Inc. Revenue models associated with syndication of a behavioral profile using a monetization platform
US20080214151A1 (en) * 2005-09-14 2008-09-04 Jorey Ramer Methods and systems for mobile coupon placement
US8175585B2 (en) 2005-11-05 2012-05-08 Jumptap, Inc. System for targeting advertising content to a plurality of mobile communication facilities
US8640231B2 (en) 2006-02-23 2014-01-28 Microsoft Corporation Client side attack resistant phishing detection
US8707451B2 (en) 2006-03-01 2014-04-22 Oracle International Corporation Search hit URL modification for secure application integration
US9177124B2 (en) 2006-03-01 2015-11-03 Oracle International Corporation Flexible authentication framework
US7941419B2 (en) * 2006-03-01 2011-05-10 Oracle International Corporation Suggested content with attribute parameterization
US8875249B2 (en) * 2006-03-01 2014-10-28 Oracle International Corporation Minimum lifespan credentials for crawling data repositories
US8214394B2 (en) 2006-03-01 2012-07-03 Oracle International Corporation Propagating user identities in a secure federated search system
US20070214129A1 (en) * 2006-03-01 2007-09-13 Oracle International Corporation Flexible Authorization Model for Secure Search
US8868540B2 (en) * 2006-03-01 2014-10-21 Oracle International Corporation Method for suggesting web links and alternate terms for matching search queries
US8332430B2 (en) 2006-03-01 2012-12-11 Oracle International Corporation Secure search performance improvement
US11062267B1 (en) 2006-03-30 2021-07-13 Geographic Solutions, Inc. Automated reactive talent matching
US7941525B1 (en) 2006-04-01 2011-05-10 ClickTale, Ltd. Method and system for monitoring an activity of a user
US20080155409A1 (en) * 2006-06-19 2008-06-26 Andy Santana Internet search engine
US10223671B1 (en) 2006-06-30 2019-03-05 Geographic Solutions, Inc. System, method and computer program products for direct applying to job applications
US7660787B2 (en) * 2006-07-19 2010-02-09 International Business Machines Corporation Customized, personalized, integrated client-side search indexing of the web
US7634458B2 (en) * 2006-07-20 2009-12-15 Microsoft Corporation Protecting non-adult privacy in content page search
US7620634B2 (en) * 2006-07-31 2009-11-17 Microsoft Corporation Ranking functions using an incrementally-updatable, modified naïve bayesian query classifier
US7996487B2 (en) * 2006-08-23 2011-08-09 Oracle International Corporation Managing searches on mobile devices
US8359278B2 (en) 2006-10-25 2013-01-22 IndentityTruth, Inc. Identity protection
US8225192B2 (en) * 2006-10-31 2012-07-17 Microsoft Corporation Extensible cache-safe links to files in a web page
CN101187925B (en) * 2006-11-17 2010-11-03 北京酷讯科技有限公司 Automatic optimized crawler grab method
WO2008074482A2 (en) * 2006-12-19 2008-06-26 Koninklijke Kpn N.V. Data network service based on profiling ip-addresses
US20080162486A1 (en) * 2006-12-27 2008-07-03 Research In Motion Limited Method and apparatus for storing data from a network address
US8275741B2 (en) * 2006-12-27 2012-09-25 Research In Motion Limited Method and apparatus for memory management in an electronic device
US10156953B2 (en) * 2006-12-27 2018-12-18 Blackberry Limited Method for presenting data on a small screen
US8099386B2 (en) * 2006-12-27 2012-01-17 Research In Motion Limited Method and apparatus for synchronizing databases connected by wireless interface
US7979458B2 (en) * 2007-01-16 2011-07-12 Microsoft Corporation Associating security trimmers with documents in an enterprise search system
US7953868B2 (en) 2007-01-31 2011-05-31 International Business Machines Corporation Method and system for preventing web crawling detection
US9665543B2 (en) * 2007-03-21 2017-05-30 International Business Machines Corporation System and method for reference validation in word processor documents
US20080235163A1 (en) * 2007-03-22 2008-09-25 Srinivasan Balasubramanian System and method for online duplicate detection and elimination in a web crawler
KR101584123B1 (en) * 2007-04-10 2016-01-12 액센츄어 글로벌 서비시즈 리미티드 System and method of search validation
JP4867799B2 (en) * 2007-06-05 2012-02-01 沖電気工業株式会社 Crawling method, program and device thereof, agent device, network system
US8843471B2 (en) * 2007-08-14 2014-09-23 At&T Intellectual Property I, L.P. Method and apparatus for providing traffic-based content acquisition and indexing
JP5233250B2 (en) * 2007-11-09 2013-07-10 日本電気株式会社 Server apparatus, information processing apparatus, information processing method, and program
US8954867B2 (en) * 2008-02-26 2015-02-10 Biz360 Inc. System and method for gathering product, service, entity and/or feature opinions
US8359651B1 (en) * 2008-05-15 2013-01-22 Trend Micro Incorporated Discovering malicious locations in a public computer network
US8078974B2 (en) * 2008-06-27 2011-12-13 Microsoft Corporation Relating web page change with revisitation patterns
US8775465B2 (en) * 2008-07-30 2014-07-08 Yahoo! Inc. Automatic updating of content included in research documents
CN101650715B (en) * 2008-08-12 2011-06-29 厦门市美亚柏科信息股份有限公司 Method and device for screening links on web pages
JP5405190B2 (en) * 2009-01-15 2014-02-05 株式会社Nttドコモ Content management information collection system and content management information collection method
AU2010226395B2 (en) * 2009-03-20 2016-10-13 Ad-Vantage Networks, Llc Methods and systems for searching, selecting, and displaying content
US8712992B2 (en) * 2009-03-28 2014-04-29 Microsoft Corporation Method and apparatus for web crawling
CN101515300B (en) 2009-04-02 2011-07-20 阿里巴巴集团控股有限公司 Method and system for grabbing Ajax webpage content
US10108432B1 (en) * 2009-04-16 2018-10-23 Intuit Inc. Generating a script based on user actions
US20110088100A1 (en) * 2009-10-14 2011-04-14 Serge Rutman Disabling electronic display devices
JP2011107557A (en) * 2009-11-20 2011-06-02 Fuji Xerox Co Ltd Image forming apparatus
US8666996B2 (en) * 2009-12-23 2014-03-04 Mastercard International Incorporated Methods and systems for detecting broken links within a file
US8600979B2 (en) * 2010-06-28 2013-12-03 Yahoo! Inc. Infinite browse
US9043306B2 (en) 2010-08-23 2015-05-26 Microsoft Technology Licensing, Llc Content signature notification
CN102480524B (en) * 2010-11-26 2014-09-10 中国科学院声学研究所 Web page crawler cooperating method
WO2012167149A1 (en) * 2011-06-01 2012-12-06 Mycomingle, Llc System and method for internet services aggregation
US8671108B2 (en) 2011-09-02 2014-03-11 Mastercard International Incorporated Methods and systems for detecting website orphan content
US20130159051A1 (en) * 2011-12-15 2013-06-20 Sybase 365, Inc. System and Method for Enhanced Information Gathering
US8577610B2 (en) 2011-12-21 2013-11-05 Telenav Inc. Navigation system with point of interest harvesting mechanism and method of operation thereof
CN102594934B (en) * 2011-12-30 2015-03-25 奇智软件(北京)有限公司 Method and device for identifying hijacked website
WO2013097742A1 (en) * 2011-12-30 2013-07-04 北京奇虎科技有限公司 Methods and devices for identifying tampered webpage and identifying hijacked website
US20130283097A1 (en) * 2012-04-23 2013-10-24 Yahoo! Inc. Dynamic network task distribution
FR2994297B1 (en) * 2012-08-01 2015-06-19 Netwave METHOD OF PROCESSING CONNECTION DATA OF A PLATFORM OF AN INTERNET SITE
FR2994296B1 (en) * 2012-08-01 2015-06-19 Netwave DATA PROCESSING METHOD FOR SITUATIONAL ANALYSIS
FR2994358B1 (en) * 2012-08-01 2015-06-19 Netwave SYSTEM FOR PROCESSING CONNECTION DATA TO A PLATFORM OF AN INTERNET SITE
CN102917053B (en) * 2012-10-18 2016-03-30 北京奇虎科技有限公司 A kind of method, apparatus and system for judging webpage urlrewriting
CN102932435B (en) * 2012-10-18 2016-06-15 北京奇虎科技有限公司 Network detection system
EP2779016B1 (en) * 2013-03-15 2018-10-31 Qnective AG Automated contact list matching with improved privacy
US9805018B1 (en) * 2013-03-15 2017-10-31 Steven E. Richfield Natural language processing for analyzing internet content and finding solutions to needs expressed in text
JP6104729B2 (en) * 2013-06-17 2017-03-29 株式会社Nttドコモ Content search system, content search method, and content search program
US20150074101A1 (en) * 2013-09-10 2015-03-12 Microsoft Corporation Smart search refinement
EP3049983B1 (en) * 2013-09-24 2018-07-25 McAfee, LLC Adaptive and recursive filtering for sample submission
US9614869B2 (en) * 2013-11-23 2017-04-04 Universidade da Coruña—OTRI System and server for detecting web page changes
KR101560716B1 (en) * 2014-02-14 2015-10-16 (주)엠더블유스토리 Contents monitoring system for checking the integrity of digital contents
RU2634218C2 (en) * 2014-07-24 2017-10-24 Общество С Ограниченной Ответственностью "Яндекс" Method for determining sequence of web browsing and server used
CN104750804A (en) * 2015-03-24 2015-07-01 南京途牛科技有限公司 Plug-in type configurable vertical network spider implementation method
US10210255B2 (en) * 2015-12-31 2019-02-19 Fractal Industries, Inc. Distributed system for large volume deep web data extraction
KR20190044134A (en) 2015-12-28 2019-04-29 후아웨이 테크놀러지 컴퍼니 리미티드 Website access method, apparatus, and website system
US10681182B1 (en) * 2016-04-06 2020-06-09 Uipco, Llc Multi-device work flow management method and system for managing work flow data collection for users across a diverse set of devices and processes by unifying the work process to be data and device agnostic
CN106156291A (en) * 2016-06-29 2016-11-23 深圳市彬讯科技有限公司 The caching method of static resource and system thereof based on Localstroage
CN106326447B (en) * 2016-08-26 2019-06-21 北京量科邦信息技术有限公司 A kind of detection method and system of crowdsourcing web crawlers crawl data
US10491622B2 (en) * 2017-01-04 2019-11-26 Synack, Inc. Automatic webpage change detection
US10970354B2 (en) * 2017-07-17 2021-04-06 Songtradr, Inc. Method for processing code and increasing website and client interaction speed
CN108170843B (en) * 2018-01-17 2019-07-12 百度在线网络技术(北京)有限公司 Method and apparatus for obtaining data
KR102222287B1 (en) 2018-05-17 2021-03-02 동서대학교 산학협력단 Web Crawler System for Collecting a Structured and Unstructured Data in Hidden URL
KR102221045B1 (en) * 2018-08-08 2021-02-25 동명대학교산학협력단 Multi-threaded Web Crawling System
CN109284430A (en) * 2018-09-07 2019-01-29 杭州艾塔科技有限公司 Visualization subject web page content based on distributed structure/architecture crawls system and method
US11361076B2 (en) * 2018-10-26 2022-06-14 ThreatWatch Inc. Vulnerability-detection crawler
CN109740038A (en) * 2019-01-02 2019-05-10 安徽芃睿科技有限公司 Network data distributed parallel computing environment and method
US11366862B2 (en) * 2019-11-08 2022-06-21 Gap Intelligence, Inc. Automated web page accessing
CN111368164B (en) * 2020-02-24 2023-05-09 支付宝(杭州)信息技术有限公司 Crawler recognition model training method, crawler recognition device, crawler recognition system, crawler recognition equipment and crawler recognition medium
CN111506786B (en) * 2020-03-06 2023-10-27 百度在线网络技术(北京)有限公司 Method, device, electronic equipment and computer readable storage medium for web page update
CN111506787B (en) * 2020-03-06 2023-04-25 百度在线网络技术(北京)有限公司 Method, device, electronic equipment and computer readable storage medium for web page update
CN111767442B (en) * 2020-04-29 2023-12-26 百度在线网络技术(北京)有限公司 Data updating method, device, search server, terminal and storage medium
KR102615979B1 (en) * 2020-04-29 2023-12-20 바이두 온라인 네트웍 테크놀러지 (베이징) 캄파니 리미티드 Data update method, device, search server, terminal and storage medium
KR102550868B1 (en) 2021-01-22 2023-07-04 인하대학교 산학협력단 verification system for achievements of faculty
US20230216913A1 (en) * 2021-12-31 2023-07-06 Tangoe Us, Inc. Robotic Process Automation For Telecom Expense Management Information Change Detection And Notification
KR102632300B1 (en) * 2023-08-30 2024-02-01 (주)잇츠솔루션 Method and system for managing environment-related information of companies based on neural networks

Family Cites Families (28)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5185040A (en) * 1988-12-19 1993-02-09 Murata Manufacturing Co., Ltd. Apparatus for forming electrode on electronic component
GB2257386B (en) * 1991-06-24 1995-07-05 Tani Denki Kogyo Kk Screen printing apparatus
US5786701A (en) * 1993-07-02 1998-07-28 Mitel Semiconductor Limited Bare die testing
NL9301820A (en) * 1993-10-20 1995-05-16 Stork Screens Bv Squeegee assembly.
US5492266A (en) * 1994-08-31 1996-02-20 International Business Machines Corporation Fine pitch solder deposits on printed circuit board process and product
US6286422B1 (en) * 1994-12-27 2001-09-11 Visteon Global Tech., Inc. Method and apparatus for dispensing viscous material
US5868302A (en) * 1995-09-06 1999-02-09 Matsushita Electric Industrial Co., Ltd. Method and apparatus for mounting electronic component
US5925187A (en) * 1996-02-08 1999-07-20 Speedline Technologies, Inc. Apparatus for dispensing flowable material
US5935210A (en) * 1996-11-27 1999-08-10 Microsoft Corporation Mapping the structure of a collection of computer resources
WO1998027690A1 (en) 1996-12-16 1998-06-25 Samsung Electronics Co. Ltd. Method for sending e-mail messages in a local area network, and device for applying same
US5909634A (en) * 1996-12-20 1999-06-01 Texas Instruments Method and apparatus for forming solder on a substrate
US6574661B1 (en) * 1997-09-26 2003-06-03 Mci Communications Corporation Integrated proxy interface for web based telecommunication toll-free network management using a network manager for downloading a call routing tree to client
US6421675B1 (en) 1998-03-16 2002-07-16 S. L. I. Systems, Inc. Search engine
US6638314B1 (en) * 1998-06-26 2003-10-28 Microsoft Corporation Method of web crawling utilizing crawl numbers
US6199081B1 (en) * 1998-06-30 2001-03-06 Microsoft Corporation Automatic tagging of documents and exclusion by content
JP2000168045A (en) * 1998-12-02 2000-06-20 Fuji Mach Mfg Co Ltd Screen printing squeegee and method for screen printing
US6547829B1 (en) * 1999-06-30 2003-04-15 Microsoft Corporation Method and system for detecting duplicate documents in web crawls
US6434548B1 (en) 1999-12-07 2002-08-13 International Business Machines Corporation Distributed metadata searching system and method
AU4712601A (en) * 1999-12-08 2001-07-03 Amazon.Com, Inc. System and method for locating and displaying web-based product offerings
US6785671B1 (en) * 1999-12-08 2004-08-31 Amazon.Com, Inc. System and method for locating web-based product offerings
US6883135B1 (en) 2000-01-28 2005-04-19 Microsoft Corporation Proxy server using a statistical model
US6687696B2 (en) * 2000-07-26 2004-02-03 Recommind Inc. System and method for personalized search, information filtering, and for generating recommendations utilizing statistical latent class models
JP2002140257A (en) * 2000-10-31 2002-05-17 Nippon Telegr & Teleph Corp <Ntt> Contents judging method
US7028039B2 (en) 2001-01-18 2006-04-11 Hewlett-Packard Development Company, L.P. System and method for storing connectivity information in a web database
JP2002312284A (en) * 2001-04-10 2002-10-25 Clover Network Com:Kk Device and program for detecting dishonest alteration of homepage
US6950821B2 (en) 2001-05-04 2005-09-27 Sun Microsystems, Inc. System and method for resolving distributed network search queries to information providers
US20040240388A1 (en) * 2003-05-28 2004-12-02 Lee Albion System and method for dynamic assignment of timers in a network transport engine
US20050027670A1 (en) * 2003-07-30 2005-02-03 Petropoulos Jack G. Ranking search results using conversion data

Also Published As

Publication number Publication date
TW200516466A (en) 2005-05-16
KR20050030542A (en) 2005-03-30
AU2004205329A1 (en) 2005-04-14
KR101153138B1 (en) 2012-06-04
JP2005135381A (en) 2005-05-26
CN1601528A (en) 2005-03-30
RU2383920C2 (en) 2010-03-10
MY143875A (en) 2011-07-15
MY146316A (en) 2012-07-31
ZA200407180B (en) 2005-07-29
JP4668567B2 (en) 2011-04-13
TWI367428B (en) 2012-07-01
AU2004205329B2 (en) 2010-08-26
CN1601528B (en) 2011-04-13
BRPI0403803A (en) 2005-05-24
RU2004125187A (en) 2006-02-20
US7685296B2 (en) 2010-03-23
US20050071766A1 (en) 2005-03-31
EP1519281A2 (en) 2005-03-30
EP1519281A3 (en) 2005-04-20

Similar Documents

Publication Publication Date Title
US7685296B2 (en) Systems and methods for client-based web crawling
Bonchi et al. Web log data warehousing and mining for intelligent web caching
CA2413854C (en) Parallel random proxy usage for large scale web access
JP5015935B2 (en) Mobile site map
US7860895B1 (en) Method and system for determining interest spaces among online content sources
Baeza-Yates et al. Crawling the infinite Web: five levels are enough
JP2004509415A (en) How to search and analyze information in a data network
US20120016857A1 (en) System and method for providing search engine optimization analysis
Möller et al. Learning from linked open data usage: Patterns & metrics
JP2006107446A (en) Batch indexing system and method for network document
US7634458B2 (en) Protecting non-adult privacy in content page search
US9495453B2 (en) Resource download policies based on user browsing statistics
Sethi An optimized crawling technique for maintaining fresh repositories
Baeza-Yates et al. Crawling the infinite web
US9529911B2 (en) Building of a web corpus with the help of a reference web crawl
Ansari et al. A comparative study of mining web usage patterns using variants of k-means clustering algorithm
EP2414949A1 (en) Selective metering of networking capabilities
Liquori et al. ETSI SmartM2M Technical Report 103716; oneM2M Discovery and Query solution (s) simulation and performance evaluation
Ahmed Analysis, Modeling, and Algorithms for Scalable Web Crawling
Kar et al. Knowledge Retrieval from Web Server Logs Using Web Usage Mining
Sayal A scalable and adaptive Web client-server architecture
Dutta Applying optimization techniques to improve e-business performance
Roy Web Site Metadata
Huq Web Optimizer: Reducing the Intermediate Web Traffic
Rousskov Performance of web caching proxies

Legal Events

Date Code Title Description
EEER Examination request
FZDE Discontinued

Effective date: 20150820