WO2009066140A2 - Federated search implemented across multiple search engines - Google Patents

Federated search implemented across multiple search engines Download PDF

Info

Publication number
WO2009066140A2
WO2009066140A2 PCT/IB2008/002738 IB2008002738W WO2009066140A2 WO 2009066140 A2 WO2009066140 A2 WO 2009066140A2 IB 2008002738 W IB2008002738 W IB 2008002738W WO 2009066140 A2 WO2009066140 A2 WO 2009066140A2
Authority
WO
WIPO (PCT)
Prior art keywords
search
results
engines
processors
search engines
Prior art date
Application number
PCT/IB2008/002738
Other languages
French (fr)
Other versions
WO2009066140A3 (en
Inventor
Ryan Sue
Original Assignee
Yahoo! Inc.
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 Yahoo! Inc. filed Critical Yahoo! Inc.
Priority to AU2008327678A priority Critical patent/AU2008327678B2/en
Priority to KR1020127027515A priority patent/KR101340747B1/en
Priority to KR1020097019267A priority patent/KR101145083B1/en
Priority to KR1020117028147A priority patent/KR101242917B1/en
Priority to EP08832771A priority patent/EP2111590A4/en
Priority to CN2008800052371A priority patent/CN101641694B/en
Publication of WO2009066140A2 publication Critical patent/WO2009066140A2/en
Publication of WO2009066140A3 publication Critical patent/WO2009066140A3/en
Priority to HK10107072.4A priority patent/HK1140839A1/en

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/30Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F16/33Querying
    • G06F16/338Presentation of query results
    • 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

Definitions

  • the present invention relates generally to information retrieval, and more specifically, to federated searches implemented across multiple search engines.
  • Standard web and internet searches typically cover a small portion, perhaps only about ten percent, of the information that is accessible via the web.
  • One reason relates to scalability. For instance, significant costs, effort and infrastructure are associated with storing and indexing data, keeping information fresh and accessibly available. For information that is accessed relatively rarely, the costs may seem excessive in relation to the apparent demand, usefulness, etc. of the information. Doing this for all information that may be accessible via the web could be cost prohibitive.
  • standard web based search engines are deterred from accessing much information on the web because standard web crawlers, which help to build the indexes used by the search engines for searching, may lack ability to get at that information. For example, a web crawler may not be able to access a database or a website that requires positive access enablement, such as password authentication or other security measures.
  • standard web search is designed for breadth and popularity, spanning the upper stratum of more popular information. While designed, in a sense, to return search results that may most probably please the most users, most of the time, many standard web search results may lack relevance for significant numbers of users.
  • vertical searching may be used, which is more specific than standard web search, being oriented more for specific domains and topics.
  • users of vertical searching configure their systems for each search engine, more or less individually. With a relatively small selection of search engines, this practice may be more or less manageable. However, with many vertical search engines, it may soon become inefficient and expensive. [0006] Based on the foregoing, it would be useful to perform vertical searches more effectively.
  • FIG. 1 depicts an example process, according to an embodiment of the present invention
  • FIG. 2 depicts an example system, according to an embodiment of the present invention
  • FIG. 3 A depicts example search result presentations, according to an embodiment of the present invention
  • FIG. 3B, 3C and 3D depict example screenshots, according to an embodiment of the present invention.
  • FIG. 4 depicts an example computer platform upon which an embodiment of the present invention may be practiced.
  • FIG. 5 depicts an example process for consolidating results from multiple search engines, according to an embodiment.
  • Example embodiments relating to federated searches implemented across multiple search engines are described herein.
  • numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be apparent, however, that the present invention may be practiced without these specific details. In other instances, well-known structures and devices are referred to without exhaustive treatment, in order to avoid unnecessarily obscuring the present invention.
  • a set of vertical search engines is selected based on a search query.
  • the vertical search engines that are more likely to provide search results more relevant to a query are selected for the set. For example, a query may request "pork recipe”. Based on the inclusion of these search terms in the query, vertical search engines for recipes are selected.
  • search results are received. Consolidated search results are generated with consolidation of the certain search results that are received from each search engine of the plurality of search engines.
  • the consolidation of results from queries spanning multiple search engines can be varied, depending upon the preferences of a vertical search user. For instance, a user may prefer being presented with a single list of the combined search results from the multiple search engines. This presents to end users results that are deemed most relevant by the search engine system executing the queries. A user may prefer, in addition or in the alternative thereto, to be presented with results from each search engine of a selection of search engines. In this case, the user is presented results from search engines that are deemed by the search engine system to be the most relevant search engines. Vertical search users intent upon issuing additional queries, which are to be limited to a specific domain, may thus be presented results that are likely to be relevant. Embodiments described herein thus implement federated search across multiple search engines and present search users with relevant search results as well as relevant search engines for further, more domain specific search.
  • a search engine is software (executable instructions and data) configured for searching a set of information resources.
  • a computer executing a search engine generates search results for search queries submitted to the search engine.
  • Search engines often run on servers, referred to herein as search engine servers.
  • a server is a combination of integrated software components (including data) and an allocation of computational resources, such as memory, a node, and processes on a computer for executing the integrated software components, where the combination of the software and computational resources are dedicated to a particular function. In the case of a search engine server, the server is dedicated to searching for a set of information resources.
  • Search engines are widely used on the Internet, the World Wide Web (www, Web, WWW, etc.) and other large internetworks and information resource webs. Often, search engines are publicly accessible on servers as web sites, such as those made available with Yahoo and Google web pages, which are respectively accessible with the links (http://search.yahoo.com/) and (http://www.google.com/).
  • the set of information resources searched by search engines are referred to herein as documents.
  • a document is any unit of information that may be indexed by search engine indexes. Search engine indexes are described below. Often a document is a file which may contain plain or formatted text, inline graphics, and other multimedia data, and hyperlinks to other documents. Documents may be static or dynamically generated.
  • Search engines use a search engine index (i.e., one or more), also referred to herein simply as an index, to search for information.
  • Search engine indexes can be directories, in which content is indexed more or less manually, to reflect human observation. More typically, search engine indexes are created and maintained automatically by processes referred to herein as crawlers. Crawlers explore information over the Internet, essentially continuously, looking for as many documents as they may find at locations to which the crawlers are configured to search. Crawlers may follow links from one document to another.
  • a crawler may retrieve (e.g., fetch, download) a web resource (e.g., a page), save an original form of the page or other resource, identify and extract links to other resources, pages, etc.
  • crawled page or other resource Upon retrieving a crawled page or other resource, other forms of information may be extracted from the crawled resources/pages.
  • the content extracted from the resources/pages retrieved with the crawler may then be indexed.
  • the content of the resources/pages may be indexed (e.g., semantically, conceptually, etc.) in a search index and summarized in databases, typically of significant size. It is these indexes and databases that are actually searched in response to a search query.
  • crawlers acquire content, which is consumed with an indexing process to build indexes.
  • the software for a search engine may be configured to search one set of resources and in another configuration be configured to search another set of resources. Each such configuration is considered to be a different search engine.
  • Vertical search engines are engines that use indexes that index documents that are limited to a particular domain or particular topic. Vertical search engines may be limited in this way by, for example, configuring a crawler to search specific locations. For example, a crawler for a vertical search engine for recipes may be configured to search sites and/or locations known to hold recipe documents.
  • the search result generated by a search engine comprises a list of documents and may contain summary information about the document.
  • the list of documents may be ordered.
  • a search engine may assign a rank to each document in the list. When the list is ordered by rank, a document with a relatively higher rank may be placed closer to the head of the list than a document with a relatively lower rank.
  • a search engine may rank the documents according to relevance to the search query. Relevance is a measure of how closely the subject matter of a document matches search query terms.
  • FIG. 1 depicts an example process 100, according to an embodiment.
  • Process 100 begins with selecting a plurality of search engines from multiple search engines, based on a search query and at least one criterion.
  • One or more search queries are submitted 102 to the plurality of search engines to obtain search results.
  • certain search results are received 103 for each query submitted to each search engine.
  • These results, from each of the search engines, is consolidated 104 to generate consolidated search results.
  • FIG. 2 depicts an example system 200, according to an embodiment.
  • Search federator 201 receives a user query.
  • a federator such as federator 201, comprises one or more computer processes that execute software, in which the software causes the computer process to receive a search query, select one or more search engines based on the search query, and transmit the search query to the selected search engines.
  • the federator may also consolidate the results, which are returned from multiple search engines in response to the search query.
  • a federator may be an integrated component of a search engine, in which the one or more processes allocated to the search engine also execute the federator.
  • federator 201 To select search engines to which to submit search queries, federator 201 needs information that can be used to make the selection. In an embodiment, federator 201 obtains such information by submitting a search meta-data query to a search metadata engine 205.
  • a search meta-data engine is a search engine where the set of information resources is information about other search engines.
  • This information includes search engine meta-data, which is information that describes search engines and/or search engine indexes.
  • the metadata may include descriptors of topics relevant to a search engine and key words associated with the relevant topics.
  • the results returned identify one or more search engines, for example, a web site, and/or the identity of a search engine index.
  • the query submitted to search engine meta-data 205 is referred to herein as a search meta-data query.
  • the search meta-data query is generated based upon a user's query, including terms in the user query.
  • a transformation process essentially transforms the user query into another query that is appropriate for querying the other search engines.
  • the results returned by search engine meta-data 205 may be ranked based on the relevance to the user query.
  • federator 201 selects from among multiple search engines 211 and 212-299 the search engines to which to issue the search queries and then issues the queries to the selected search engines.
  • the selection may be a selection of a particular search engine server, such as a search engine hosted by a search engine server (e.g. web site), or may be a search engine index. In the case of the latter, federator 201 submits a query to a selected search engine by submitting the query to a search engine configured for the search index.
  • Search results are then returned from each of the selected search engines.
  • the results returned are then consolidated and ranked by federator 201.
  • the ranking can be based on a variety of techniques, for instance, using frequencies of document identifiers such as uniform resource locators (URL).
  • ranks are calculated for each search engine; the ranks are used to determine how to consolidate the search results from all the selected search engines.
  • Search engine ranks may be calculated according to a method described in co-pending U.S. Patent Application, Serial No. [to be determined] by Ryan Sue, entitled “Ranking Documents,” which was filed on [date to be determined] and assigned to the Assignee of the present Application, which is incorporated by reference in its entirety as if fully set forth herein.
  • search engine ranks are calculated as described with reference to FIG. 5, below.
  • performance overhead or other costs that may be associated with use of search meta-data engine 205 can be avoided by simply not using it. Instead, a search query is simply submitted to all of a set of multiple search engines. However, the performance savings realized by this measure also have the additional cost of having to execute the end user query against all of the multiple search engines, in which some of the multiple search engines may return content or other results that lack relevance to the end user's query.
  • search federator 201 issues a search meta-data query for "chicken" to search meta-data engine 205
  • the search meta-data engine 205 returns search engine results that identify search engines relevant to an end user query for "chicken.”
  • Search federator 201 issues the "chicken" query over the relevant search engines returned by meta-data engine 205.
  • the search results returned from the relevant search engines "1" and "2" are consolidated into a set of search results for presentation to the end user.
  • the search results, consolidated from all relevant search engines, may be presented to the end user in one or more of several ways.
  • FIG. 3A depicts an example of returned search results 300, according to an embodiment.
  • result presentation 311, result presentation 312 or both may be presented to the user upon execution of the user's query according to an embodiment.
  • a number (e.g., ten) of results are returned in response to the user's query by the relevant search engines "1" and "2.” It should be appreciated that another number of search engines may be relevant and that any number of results may be returned.
  • Result presentation 311 presents, as a single list, the intermixed results from multiple search engines ranked according to relevance to the user's query. Thus, an embodiment presents to the user results deemed most relevant with the system 200 (FIG. T).
  • Result presentation 312 presents results grouped by each of a selection of the multiple search engines. In this format, a user may be better able to visually observe and identify which search engine provides the most relevant results to the query or the user' s desire.
  • FIG. 3B depicts an example screenshot of search results 3 HB, which are consolidated across relevant search engines. In an implementation, search results that are consolidated across relevant search engines may comprise a more or less "standard" view of the results, which may be changed according to a user's preference.
  • FIG. 3C depicts an example screenshot of search results 312C, which are grouped according to which search engine returned each collection of search results.
  • search results that are grouped according to which search engine returned each collection of search results may comprise a more or less exploratory, e.g., "exploration" view of the results, which may be changed according to a user's preference.
  • FIG. 3D depicts an example screenshot of search results 313D, which include results from a single search engine, such as may be selected, designated, etc. by a user, for instance, after consideration of one or more of an exploration screenshot (e.g., search results 312C; FIG. 3C), a single list of consolidated results (e.g., search results 31 IB; FIG. 3B) or both.
  • search results may be sought from a single search engine upon a user discovering (e.g., from previous performance and/or consideration of other search result groupings) that a particular search engine returns most relevant results (e.g., from that user's perspective).
  • the search engine selected to present results is changeable according to a user's preference.
  • FIG. 4 depicts an example computer system 400 upon which an embodiment of the invention may be implemented.
  • Computer system 400 includes a bus 402 or other communication mechanism for communicating information, and a processor 404 coupled with bus 402 for processing information.
  • Computer system 400 also includes a main memory 406, such as a random access memory (RAM) or other dynamic storage device, coupled to bus 402 for storing information and instructions to be executed by processor 404.
  • Main memory 406 also may be used for storing temporary variables or other intermediate information during execution of instructions to be executed by processor 404.
  • Computer system 400 further includes a read only memory (ROM) 408 or other static storage device coupled to bus 402 for storing static information and instructions for processor 404.
  • ROM read only memory
  • a storage device 410 such as a magnetic disk or optical disk, is provided and coupled to bus 402 for storing information and instructions.
  • Computer system 400 may be coupled via bus 402 to a display 412, such as a liquid crystal display (LCD), a cathode ray tube (CRT) or the like, for displaying information to a computer user.
  • a display 412 such as a liquid crystal display (LCD), a cathode ray tube (CRT) or the like
  • An input device 414 is coupled to bus 402 for communicating information and command selections to processor 404.
  • cursor control 416 such as a mouse, a trackball, or cursor direction keys for communicating direction information and command selections to processor 404 and for controlling cursor movement on display 412.
  • This input device typically has two degrees of freedom in two axes, a first axis (e.g., x) and a second axis (e.g., y), that allows the device to specify positions in a plane.
  • Example embodiments of the invention relate to the use of computer system 400 for replicating changes, made to data blocks at a source database system, to replicas of the data blocks at the standby database system.
  • replicating changes, made to data blocks at a source database system, to replicas of the data blocks at the standby database system is provided by one or more instances of computer system 400 in response to processor 404 executing one or more sequences of one or more instructions contained in main memory 406.
  • Such instructions may be read into main memory 406 from another computer-readable medium, such as storage device 410.
  • Execution of the sequences of instructions contained in main memory 406 causes processor 404 to perform the process steps described herein.
  • processors in a multi-processing arrangement may also be employed to execute the sequences of instructions contained in main memory 406.
  • hard-wired circuitry may be used in place of or in combination with software instructions to implement the invention.
  • embodiments of the invention are not limited to any specific combination of hardware circuitry and software.
  • Non- volatile media includes, for example, optical or magnetic disks, such as storage device 410.
  • Volatile media includes dynamic memory, such as main memory 406.
  • Transmission media includes coaxial cables, copper wire and fiber optics, including the wires that comprise bus 402. Transmission media can also take the form of acoustic or light waves, such as those generated during radio wave and infrared data communications.
  • Common forms of computer-readable media include, for example, a floppy disk, a flexible disk, hard disk, magnetic tape, or any other magnetic medium, a CD- ROM, any other optical medium, punch cards, paper tape, any other legacy or other physical medium with patterns of holes and other computer-readable media, a RAM, a PROM, and EPROM, a FLASH-EPROM, any other memory chip or cartridge, a carrier wave as described hereinafter, or any other medium from which a computer can read.
  • Various forms of computer readable media may be involved in carrying one or more sequences of one or more instructions to processor 404 for execution. For example, the instructions may initially be carried on a magnetic disk of a remote computer.
  • the remote computer can load the instructions into its dynamic memory and send the instructions over a telephone line using a modem.
  • a modem local to computer system 400 can receive the data on the telephone line and use an infrared transmitter to convert the data to an infrared signal.
  • An infrared detector coupled to bus 402 can receive the data carried in the infrared signal and place the data on bus 402.
  • Bus 402 carries the data to main memory 406, from which processor 404 retrieves and executes the instructions.
  • the instructions received by main memory 406 may optionally be stored on storage device 410 either before or after execution by processor 404.
  • Computer system 400 also includes a communication interface 418 coupled to bus 402.
  • Communication interface 418 provides a two-way data communication coupling to a network link 420 that is connected to a local network 422.
  • communication interface 418 may be an integrated services digital network (ISDN) card a cable or digital subscriber line (DSL) modem or another modem to provide a data communication connection to a corresponding type of telephone line.
  • ISDN integrated services digital network
  • DSL digital subscriber line
  • communication interface 418 may be a local area network (LAN) card to provide a data communication connection to a compatible LAN.
  • LAN local area network
  • Wireless links may also be implemented.
  • communication interface 418 sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.
  • Network link 420 typically provides data communication through one or more networks to other data devices.
  • network link 420 may provide a connection through local network 422 to a host computer 424 or to data equipment operated by an Internet Service Provider (ISP) 426.
  • ISP 426 in turn provides data communication services through the worldwide packet data communication network now commonly referred to as the "Internet" 428.
  • Internet 428 uses electrical, electromagnetic or optical signals that carry digital data streams.
  • the signals through the various networks and the signals on network link 420 and through communication interface 418, which carry the digital data to and from computer system 400, are exemplary forms of carrier waves transporting the information.
  • Computer system 400 can send messages and receive data, including program code, through the network(s), network link 420 and communication interface 418.
  • a server 430 might transmit a requested code for an application program through Internet 428, ISP 426, local network 422 and communication interface 418.
  • one such downloaded application provides for replicating changes, made to data blocks at a source database system, to replicas of the data blocks at the standby database system, as described herein.
  • the received code may be executed by processor 404 as it is received, and/or stored in storage device 410, or other non-volatile storage for later execution. In this manner, computer system 400 may obtain application code in the form of a carrier wave.
  • FIG. 5 depicts an example process 500 for consolidating results from multiple search engines, according to an embodiment.
  • Process 500 begins with ranking 501 a plurality of documents, each of which is associated with a Uniform Resource Locator (URL).
  • the documents are returned as the result of a query that is computed by each search engine of a plurality of search engines. At least one of the documents of the plurality of documents is returned as a result of the query from each search engine.
  • a frequency of the URL is determined 502.
  • the ranking described above (block 501) includes ranking the plurality of documents based on one or more factors. These factors are based on the frequency determined for each URL associated with the plurality of documents.
  • the frequency f ur i (U 1 , S) of each URL 'u' associated with a document 'i' of a plurality of documents that are returned in response to a query executed over a plurality (e.g., set) of search engines 'S' is calculated to make the URL frequency determination 502.
  • the ranking of a document is measured according to its rarity (e.g., relative to the frequency of other URLs) across a set of search engine results.
  • the rarity of a document in the search results returned from the search engines effectively comprises a metric of how interesting that document is.
  • the ranking of the document thus corresponds in an embodiment with an inverted URL frequency. Searches performed according to such an embodiment may thus return documents that are more highly specialized, obscure, which are usually ignored by other search engines. The results of such searches are thus likely to return results that generalized, e.g., non- specialized searches are unlikely to return.
  • the ranking returned for a query is a function/of the normalized rank (R normahzed ) with the inverse of the frequency f ⁇ of the URL ui, calculated according to Equation 2, below:
  • Equation 2 in which the normalized rank (R n o rm a hz ed) represents all other calculations that are related to combining the native ranks for the search engines of the set S.
  • the other calculations associated with a document's rank can include, but are not limited to, handling of duplicate results across search engines, click through rates, and user ratings.
  • Embodiments are not limited to ranking a document according to its rarity across a set of search engine results. For instance, in an embodiment, the relevancy of a document is measured according to how common that document is across a set of search engine results, which can be a function of a non-inverted frequency associated with a URL.
  • Searches preformed according to such an embodiment may thus return search results that reflect a common opinion, consensus or the like of other searchers, search engine creators, administrators and other participants (e.g., with vertical search).
  • Results of more specialized searches, such as vertical searches that have been customized by previous users may be leveraged. This can allow results obtained for searches performed according to such an embodiment to reflect search results that have proven useful or popular, and thus to capitalize on the opinions, lessons and experience of others, integrate useful social factors such as collective knowledge and wisdom, and thus promote efficiency and economy in search engine use.
  • the overall ranking (R ove r a ll ) of a document in the search results returned for a query is a function /of the normalized rank (R n o rm a l i z ed) with the non-inverted frequency fu r i of the URL U 1 , calculated according to Equation 3, below:
  • Equation 3 in which the normalized rank (R n o rm a l i z ed) represents all other calculations that are related to combining the native ranks for the search engines of the set S.
  • the other calculations associated with the normalized rank can include, but are not limited to, handling of duplicate results across search engines, click through rates, and user ratings.
  • Overall ranks for each URL are assigned 503, based in an embodiment on a simple implementation of an overall ranking function such as sorting a list of frequencies.
  • results, e.g., URLs, returned for an example query executed against three individual search engines 1, 2 and 3 are ranked (501) as shown in Table 1, below. TABLE 1
  • Search Engine 1 Results Search Engine 2 Results Search Engine 3 Results
  • Frequencies for each URL returned in response to the query are determined (502), calculated for instance with Equation 1, above.
  • a list of example frequencies are shown in Table 2, below.
  • the list of frequencies is sorted.
  • the example frequencies shown in Table 2 are ranked as shown in Table 3, below.
  • the rankings may be determined with Equation2 and/or Equation 3 above, or according to another ranking model.
  • the results returned from the multiple search engines are consolidated 504, using in an embodiment the URL frequencies and/or the search engine ranks. For instance, the frequencies of the URLs returned with each search engine may be summed, as shown in Table 4, below.
  • Search engine results may then be ranked according to their summed URL frequencies. Ranking according to the example results shown in Table 4, Search Engine 2 results are ranked first, Search Engine 1 results second and Search Engine 3 results third (e.g., one or more other criteria may be used to distinguish between tied results). Thus, where presented according to the group format (e.g., group presentation format 312; FIG. 3A), the example results are shown in Table 5, below.
  • group format e.g., group presentation format 312; FIG. 3A

Abstract

A plurality of search engines is selected from multiple search engines based on a search query and one or more criteria. To obtain search results for the search query, one or more search queries are submitted to the plurality of search engines. For each search engine of the plurality of search engines, certain search results are received for the one or more search queries submitted to each search engine. Consolidated search results are generated with consolidation of the certain search results that are received from each search engine of the plurality of search engines.

Description

FEDERATED SEARCH IMPLEMENTED ACROSS MULTIPLE SEARCH ENGINES
TECHNOLOGY
[0001] The present invention relates generally to information retrieval, and more specifically, to federated searches implemented across multiple search engines.
BACKGROUND
[0002] Standard web and internet searches typically cover a small portion, perhaps only about ten percent, of the information that is accessible via the web. There are various reasons for this limitation. One reason relates to scalability. For instance, significant costs, effort and infrastructure are associated with storing and indexing data, keeping information fresh and accessibly available. For information that is accessed relatively rarely, the costs may seem excessive in relation to the apparent demand, usefulness, etc. of the information. Doing this for all information that may be accessible via the web could be cost prohibitive.
[0003] Second, standard web based search engines are deterred from accessing much information on the web because standard web crawlers, which help to build the indexes used by the search engines for searching, may lack ability to get at that information. For example, a web crawler may not be able to access a database or a website that requires positive access enablement, such as password authentication or other security measures. [0004] Finally, standard web search is designed for breadth and popularity, spanning the upper stratum of more popular information. While designed, in a sense, to return search results that may most probably please the most users, most of the time, many standard web search results may lack relevance for significant numbers of users. [0005] To seek more relevant search results, vertical searching may be used, which is more specific than standard web search, being oriented more for specific domains and topics. However, users of vertical searching configure their systems for each search engine, more or less individually. With a relatively small selection of search engines, this practice may be more or less manageable. However, with many vertical search engines, it may soon become inefficient and expensive. [0006] Based on the foregoing, it would be useful to perform vertical searches more effectively.
[0007] The approaches described in this section are approaches that could be pursued, but not necessarily approaches that have been previously conceived or pursued.
Therefore, unless otherwise indicated, it should not be assumed that any of the approaches described in this section qualify as prior art merely by virtue of their inclusion in this section.
BRIEF DESCRIPTION OF THE DRAWINGS
[0008] The present invention is illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which like reference numerals refer to similar elements and in which:
[0009] FIG. 1 depicts an example process, according to an embodiment of the present invention;
[0010] FIG. 2 depicts an example system, according to an embodiment of the present invention;
[0011] FIG. 3 A depicts example search result presentations, according to an embodiment of the present invention;
[0012] FIG. 3B, 3C and 3D depict example screenshots, according to an embodiment of the present invention;
[0013] FIG. 4 depicts an example computer platform upon which an embodiment of the present invention may be practiced; and
[0014] FIG. 5 depicts an example process for consolidating results from multiple search engines, according to an embodiment.
DESCRIPTION OF EXAMPLE EMBODIMENTS
[0015] Example embodiments relating to federated searches implemented across multiple search engines are described herein. In the following description, for the purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be apparent, however, that the present invention may be practiced without these specific details. In other instances, well-known structures and devices are referred to without exhaustive treatment, in order to avoid unnecessarily obscuring the present invention. OVERVIEW
[0016] According to an embodiment, a set of vertical search engines is selected based on a search query. The vertical search engines that are more likely to provide search results more relevant to a query are selected for the set. For example, a query may request "pork recipe". Based on the inclusion of these search terms in the query, vertical search engines for recipes are selected.
[0017] Multiple search engines are thus accessed in performing vertical searches with less user configuration for execution of queries therewith. Further, efficient and cost effective vertical search queries are executed across multiple specialized search engines and executed selectively.
[0018] For each selected search engine to which a search query is submitted, search results are received. Consolidated search results are generated with consolidation of the certain search results that are received from each search engine of the plurality of search engines.
[0019] In an embodiment, the consolidation of results from queries spanning multiple search engines can be varied, depending upon the preferences of a vertical search user. For instance, a user may prefer being presented with a single list of the combined search results from the multiple search engines. This presents to end users results that are deemed most relevant by the search engine system executing the queries. A user may prefer, in addition or in the alternative thereto, to be presented with results from each search engine of a selection of search engines. In this case, the user is presented results from search engines that are deemed by the search engine system to be the most relevant search engines. Vertical search users intent upon issuing additional queries, which are to be limited to a specific domain, may thus be presented results that are likely to be relevant. Embodiments described herein thus implement federated search across multiple search engines and present search users with relevant search results as well as relevant search engines for further, more domain specific search.
NOTATION AND NOMENCLATURE
[0020] Some of the terms and phrases used herein have meanings as described in this section, unless specifically stated otherwise. [0021] A search engine is software (executable instructions and data) configured for searching a set of information resources. A computer executing a search engine generates search results for search queries submitted to the search engine. [0022] Search engines often run on servers, referred to herein as search engine servers. A server is a combination of integrated software components (including data) and an allocation of computational resources, such as memory, a node, and processes on a computer for executing the integrated software components, where the combination of the software and computational resources are dedicated to a particular function. In the case of a search engine server, the server is dedicated to searching for a set of information resources.
[0023] Search engines are widely used on the Internet, the World Wide Web (www, Web, WWW, etc.) and other large internetworks and information resource webs. Often, search engines are publicly accessible on servers as web sites, such as those made available with Yahoo and Google web pages, which are respectively accessible with the links (http://search.yahoo.com/) and (http://www.google.com/). [0024] The set of information resources searched by search engines are referred to herein as documents. A document is any unit of information that may be indexed by search engine indexes. Search engine indexes are described below. Often a document is a file which may contain plain or formatted text, inline graphics, and other multimedia data, and hyperlinks to other documents. Documents may be static or dynamically generated.
[0025] Search engines use a search engine index (i.e., one or more), also referred to herein simply as an index, to search for information. Search engine indexes can be directories, in which content is indexed more or less manually, to reflect human observation. More typically, search engine indexes are created and maintained automatically by processes referred to herein as crawlers. Crawlers explore information over the Internet, essentially continuously, looking for as many documents as they may find at locations to which the crawlers are configured to search. Crawlers may follow links from one document to another. A crawler may retrieve (e.g., fetch, download) a web resource (e.g., a page), save an original form of the page or other resource, identify and extract links to other resources, pages, etc. This allows these resources/ pages to be subsequently retrieved, as well. Upon retrieving a crawled page or other resource, other forms of information may be extracted from the crawled resources/pages. [0026] The content extracted from the resources/pages retrieved with the crawler may then be indexed. The content of the resources/pages may be indexed (e.g., semantically, conceptually, etc.) in a search index and summarized in databases, typically of significant size. It is these indexes and databases that are actually searched in response to a search query. Thus generally, crawlers acquire content, which is consumed with an indexing process to build indexes.
[0027] In one configuration the software for a search engine may be configured to search one set of resources and in another configuration be configured to search another set of resources. Each such configuration is considered to be a different search engine. [0028] Vertical search engines are engines that use indexes that index documents that are limited to a particular domain or particular topic. Vertical search engines may be limited in this way by, for example, configuring a crawler to search specific locations. For example, a crawler for a vertical search engine for recipes may be configured to search sites and/or locations known to hold recipe documents.
[0029] The search result generated by a search engine comprises a list of documents and may contain summary information about the document. The list of documents may be ordered. To order a list of documents, a search engine may assign a rank to each document in the list. When the list is ordered by rank, a document with a relatively higher rank may be placed closer to the head of the list than a document with a relatively lower rank. A search engine may rank the documents according to relevance to the search query. Relevance is a measure of how closely the subject matter of a document matches search query terms.
ILLUSTRATIVE EMBODIMENT
[0030] FIG. 1 depicts an example process 100, according to an embodiment. Process 100 begins with selecting a plurality of search engines from multiple search engines, based on a search query and at least one criterion. One or more search queries are submitted 102 to the plurality of search engines to obtain search results. For each search engine, certain search results are received 103 for each query submitted to each search engine. These results, from each of the search engines, is consolidated 104 to generate consolidated search results.
[0031] FIG. 2 depicts an example system 200, according to an embodiment. Search federator 201 receives a user query. A federator, such as federator 201, comprises one or more computer processes that execute software, in which the software causes the computer process to receive a search query, select one or more search engines based on the search query, and transmit the search query to the selected search engines. The federator may also consolidate the results, which are returned from multiple search engines in response to the search query. A federator may be an integrated component of a search engine, in which the one or more processes allocated to the search engine also execute the federator.
[0032] To select search engines to which to submit search queries, federator 201 needs information that can be used to make the selection. In an embodiment, federator 201 obtains such information by submitting a search meta-data query to a search metadata engine 205.
[0033] A search meta-data engine is a search engine where the set of information resources is information about other search engines. This information includes search engine meta-data, which is information that describes search engines and/or search engine indexes. The metadata may include descriptors of topics relevant to a search engine and key words associated with the relevant topics. The results returned identify one or more search engines, for example, a web site, and/or the identity of a search engine index. [0034] The query submitted to search engine meta-data 205 is referred to herein as a search meta-data query. In an embodiment, the search meta-data query is generated based upon a user's query, including terms in the user query. In an implementation, a transformation process essentially transforms the user query into another query that is appropriate for querying the other search engines. The results returned by search engine meta-data 205 may be ranked based on the relevance to the user query. [0035] Based on the results returned from search engine meta-data 205, federator 201 selects from among multiple search engines 211 and 212-299 the search engines to which to issue the search queries and then issues the queries to the selected search engines. The selection may be a selection of a particular search engine server, such as a search engine hosted by a search engine server (e.g. web site), or may be a search engine index. In the case of the latter, federator 201 submits a query to a selected search engine by submitting the query to a search engine configured for the search index.
[0036] Search results are then returned from each of the selected search engines. The results returned are then consolidated and ranked by federator 201. The ranking can be based on a variety of techniques, for instance, using frequencies of document identifiers such as uniform resource locators (URL). Further, in an embodiment, ranks are calculated for each search engine; the ranks are used to determine how to consolidate the search results from all the selected search engines. Search engine ranks may be calculated according to a method described in co-pending U.S. Patent Application, Serial No. [to be determined] by Ryan Sue, entitled "Ranking Documents," which was filed on [date to be determined] and assigned to the Assignee of the present Application, which is incorporated by reference in its entirety as if fully set forth herein. In an implementation, search engine ranks are calculated as described with reference to FIG. 5, below. [0037] In an embodiment, performance overhead or other costs that may be associated with use of search meta-data engine 205 can be avoided by simply not using it. Instead, a search query is simply submitted to all of a set of multiple search engines. However, the performance savings realized by this measure also have the additional cost of having to execute the end user query against all of the multiple search engines, in which some of the multiple search engines may return content or other results that lack relevance to the end user's query.
EXAMPLE SEARCH RESULTS PRESENTATION
[0038] Where the search federator 201 issues a search meta-data query for "chicken" to search meta-data engine 205, the search meta-data engine 205 returns search engine results that identify search engines relevant to an end user query for "chicken." [0039] Search federator 201 issues the "chicken" query over the relevant search engines returned by meta-data engine 205. The search results returned from the relevant search engines "1" and "2" are consolidated into a set of search results for presentation to the end user. The search results, consolidated from all relevant search engines, may be presented to the end user in one or more of several ways.
[0040] FIG. 3A depicts an example of returned search results 300, according to an embodiment. Responsive to a user preference, result presentation 311, result presentation 312 or both may be presented to the user upon execution of the user's query according to an embodiment. A number (e.g., ten) of results are returned in response to the user's query by the relevant search engines "1" and "2." It should be appreciated that another number of search engines may be relevant and that any number of results may be returned. [0041] Result presentation 311 presents, as a single list, the intermixed results from multiple search engines ranked according to relevance to the user's query. Thus, an embodiment presents to the user results deemed most relevant with the system 200 (FIG. T). Result presentation 312 presents results grouped by each of a selection of the multiple search engines. In this format, a user may be better able to visually observe and identify which search engine provides the most relevant results to the query or the user' s desire. [0042] FIG. 3B depicts an example screenshot of search results 3 HB, which are consolidated across relevant search engines. In an implementation, search results that are consolidated across relevant search engines may comprise a more or less "standard" view of the results, which may be changed according to a user's preference. [0043] FIG. 3C depicts an example screenshot of search results 312C, which are grouped according to which search engine returned each collection of search results. In an implementation, search results that are grouped according to which search engine returned each collection of search results may comprise a more or less exploratory, e.g., "exploration" view of the results, which may be changed according to a user's preference. [0044] FIG. 3D depicts an example screenshot of search results 313D, which include results from a single search engine, such as may be selected, designated, etc. by a user, for instance, after consideration of one or more of an exploration screenshot (e.g., search results 312C; FIG. 3C), a single list of consolidated results (e.g., search results 31 IB; FIG. 3B) or both. In an implementation, search results may be sought from a single search engine upon a user discovering (e.g., from previous performance and/or consideration of other search result groupings) that a particular search engine returns most relevant results (e.g., from that user's perspective). The search engine selected to present results is changeable according to a user's preference.
EXAMPLE HARDWARE OVERVIEW
[0045] FIG. 4 depicts an example computer system 400 upon which an embodiment of the invention may be implemented. Computer system 400 includes a bus 402 or other communication mechanism for communicating information, and a processor 404 coupled with bus 402 for processing information. Computer system 400 also includes a main memory 406, such as a random access memory (RAM) or other dynamic storage device, coupled to bus 402 for storing information and instructions to be executed by processor 404. Main memory 406 also may be used for storing temporary variables or other intermediate information during execution of instructions to be executed by processor 404. Computer system 400 further includes a read only memory (ROM) 408 or other static storage device coupled to bus 402 for storing static information and instructions for processor 404. A storage device 410, such as a magnetic disk or optical disk, is provided and coupled to bus 402 for storing information and instructions.
[0046] Computer system 400 may be coupled via bus 402 to a display 412, such as a liquid crystal display (LCD), a cathode ray tube (CRT) or the like, for displaying information to a computer user. An input device 414, including alphanumeric and other keys, is coupled to bus 402 for communicating information and command selections to processor 404. Another type of user input device is cursor control 416, such as a mouse, a trackball, or cursor direction keys for communicating direction information and command selections to processor 404 and for controlling cursor movement on display 412. This input device typically has two degrees of freedom in two axes, a first axis (e.g., x) and a second axis (e.g., y), that allows the device to specify positions in a plane. Example embodiments of the invention relate to the use of computer system 400 for replicating changes, made to data blocks at a source database system, to replicas of the data blocks at the standby database system. According to one embodiment of the invention, replicating changes, made to data blocks at a source database system, to replicas of the data blocks at the standby database system is provided by one or more instances of computer system 400 in response to processor 404 executing one or more sequences of one or more instructions contained in main memory 406. Such instructions may be read into main memory 406 from another computer-readable medium, such as storage device 410. Execution of the sequences of instructions contained in main memory 406 causes processor 404 to perform the process steps described herein. One or more processors in a multi-processing arrangement may also be employed to execute the sequences of instructions contained in main memory 406. In alternative embodiments, hard-wired circuitry may be used in place of or in combination with software instructions to implement the invention. Thus, embodiments of the invention are not limited to any specific combination of hardware circuitry and software.
[0047] The term "computer-readable medium" as used herein refers to any medium that participates in providing instructions to processor 404 for execution. Such a medium may take many forms, including but not limited to, non- volatile media, volatile media, and transmission media. Non- volatile media includes, for example, optical or magnetic disks, such as storage device 410. Volatile media includes dynamic memory, such as main memory 406. Transmission media includes coaxial cables, copper wire and fiber optics, including the wires that comprise bus 402. Transmission media can also take the form of acoustic or light waves, such as those generated during radio wave and infrared data communications.
[0048] Common forms of computer-readable media include, for example, a floppy disk, a flexible disk, hard disk, magnetic tape, or any other magnetic medium, a CD- ROM, any other optical medium, punch cards, paper tape, any other legacy or other physical medium with patterns of holes and other computer-readable media, a RAM, a PROM, and EPROM, a FLASH-EPROM, any other memory chip or cartridge, a carrier wave as described hereinafter, or any other medium from which a computer can read. [0049] Various forms of computer readable media may be involved in carrying one or more sequences of one or more instructions to processor 404 for execution. For example, the instructions may initially be carried on a magnetic disk of a remote computer. The remote computer can load the instructions into its dynamic memory and send the instructions over a telephone line using a modem. A modem local to computer system 400 can receive the data on the telephone line and use an infrared transmitter to convert the data to an infrared signal. An infrared detector coupled to bus 402 can receive the data carried in the infrared signal and place the data on bus 402. Bus 402 carries the data to main memory 406, from which processor 404 retrieves and executes the instructions. The instructions received by main memory 406 may optionally be stored on storage device 410 either before or after execution by processor 404.
[0050] Computer system 400 also includes a communication interface 418 coupled to bus 402. Communication interface 418 provides a two-way data communication coupling to a network link 420 that is connected to a local network 422. For example, communication interface 418 may be an integrated services digital network (ISDN) card a cable or digital subscriber line (DSL) modem or another modem to provide a data communication connection to a corresponding type of telephone line. As another example, communication interface 418 may be a local area network (LAN) card to provide a data communication connection to a compatible LAN. Wireless links may also be implemented. In any such implementation, communication interface 418 sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.
[0051] Network link 420 typically provides data communication through one or more networks to other data devices. For example, network link 420 may provide a connection through local network 422 to a host computer 424 or to data equipment operated by an Internet Service Provider (ISP) 426. ISP 426 in turn provides data communication services through the worldwide packet data communication network now commonly referred to as the "Internet" 428. Local network 422 and Internet 428 both use electrical, electromagnetic or optical signals that carry digital data streams. The signals through the various networks and the signals on network link 420 and through communication interface 418, which carry the digital data to and from computer system 400, are exemplary forms of carrier waves transporting the information.
[0052] Computer system 400 can send messages and receive data, including program code, through the network(s), network link 420 and communication interface 418. In the Internet example, a server 430 might transmit a requested code for an application program through Internet 428, ISP 426, local network 422 and communication interface 418. In accordance with the invention, one such downloaded application provides for replicating changes, made to data blocks at a source database system, to replicas of the data blocks at the standby database system, as described herein.
[0053] The received code may be executed by processor 404 as it is received, and/or stored in storage device 410, or other non-volatile storage for later execution. In this manner, computer system 400 may obtain application code in the form of a carrier wave.
EXAMPLE CONSOLIDATION OF RESULTS FROM MULTIPLE SEARCH ENGINES [0054] FIG. 5 depicts an example process 500 for consolidating results from multiple search engines, according to an embodiment. Process 500 begins with ranking 501 a plurality of documents, each of which is associated with a Uniform Resource Locator (URL). The documents are returned as the result of a query that is computed by each search engine of a plurality of search engines. At least one of the documents of the plurality of documents is returned as a result of the query from each search engine. [0055] For each URL associated with a document of the plurality of documents, a frequency of the URL is determined 502. The ranking described above (block 501) includes ranking the plurality of documents based on one or more factors. These factors are based on the frequency determined for each URL associated with the plurality of documents.
[0056] In an embodiment, the frequency furi (U1, S) of each URL 'u' associated with a document 'i' of a plurality of documents that are returned in response to a query executed over a plurality (e.g., set) of search engines 'S' is calculated to make the URL frequency determination 502. In an embodiment, the frequency of a URL is calculated according to Equation 1, below: furl (U1, S) = IS1 3 U1I / ISI
(Equation 1) in which furi is the URL frequency, ISI is the total number of search engines over which the query is executed and l(si => ui)l is the total number of search engines, which return results that contain the URL, U1.
[0057] In an embodiment, the ranking of a document is measured according to its rarity (e.g., relative to the frequency of other URLs) across a set of search engine results. The rarity of a document in the search results returned from the search engines effectively comprises a metric of how interesting that document is. The ranking of the document thus corresponds in an embodiment with an inverted URL frequency. Searches performed according to such an embodiment may thus return documents that are more highly specialized, obscure, which are usually ignored by other search engines. The results of such searches are thus likely to return results that generalized, e.g., non- specialized searches are unlikely to return.
[0058] For instance, generalized web searches typically return commonly accessed documents and do so with relatively high relevance rankings for those documents. Moreover, if a standard web search does manage to return a relatively rare document, its rarity will most probably yield it a relatively low relevancy rank. A low relevancy rank is likely to "bury" the document within the search results, where it can be obscured with many other search results. This can essentially force a user to hunt for it within pages of search results, which can be tedious and inefficient.
[0059] In an embodiment in which the ranking of a document in the search results is based upon its relative rarity, the ranking returned for a query is a function/of the normalized rank (R normahzed) with the inverse of the frequency f^ of the URL ui, calculated according to Equation 2, below:
R overall (U1, S) = / (R normahzed (U1, S), l/furl (U1, S))
(Equation 2) in which the normalized rank (R normahzed) represents all other calculations that are related to combining the native ranks for the search engines of the set S. In an embodiment, the other calculations associated with a document's rank can include, but are not limited to, handling of duplicate results across search engines, click through rates, and user ratings. [0060] Embodiments are not limited to ranking a document according to its rarity across a set of search engine results. For instance, in an embodiment, the relevancy of a document is measured according to how common that document is across a set of search engine results, which can be a function of a non-inverted frequency associated with a URL. Searches preformed according to such an embodiment may thus return search results that reflect a common opinion, consensus or the like of other searchers, search engine creators, administrators and other participants (e.g., with vertical search). [0061] Results of more specialized searches, such as vertical searches that have been customized by previous users, may be leveraged. This can allow results obtained for searches performed according to such an embodiment to reflect search results that have proven useful or popular, and thus to capitalize on the opinions, lessons and experience of others, integrate useful social factors such as collective knowledge and wisdom, and thus promote efficiency and economy in search engine use.
[0062] In an embodiment in which document relevancy is measured according to how common that document occurs in the search results across a set of search engine results, the overall ranking (R overall) of a document in the search results returned for a query is a function /of the normalized rank (R normalized) with the non-inverted frequency furi of the URL U1, calculated according to Equation 3, below:
R overall (Ui, S) = / (R normalized (Ui, S), furl (U1, S))
(Equation 3) in which the normalized rank (R normalized) represents all other calculations that are related to combining the native ranks for the search engines of the set S. In an embodiment, the other calculations associated with the normalized rank can include, but are not limited to, handling of duplicate results across search engines, click through rates, and user ratings. [0063] Overall ranks for each URL are assigned 503, based in an embodiment on a simple implementation of an overall ranking function such as sorting a list of frequencies. [0064] For instance, results, e.g., URLs, returned for an example query executed against three individual search engines 1, 2 and 3 are ranked (501) as shown in Table 1, below. TABLE 1
Search Engine 1 Results Search Engine 2 Results Search Engine 3 Results
A A D
B D F
C E G
[0065] Frequencies for each URL returned in response to the query are determined (502), calculated for instance with Equation 1, above. A list of example frequencies are shown in Table 2, below.
TABLE 2
URL Frequency
A 0.66
B 0.33
C 0.33
D 0.66
E 0.33
F 0.33
G 0.33
[0066] For assigning (503) overall ranks for each URL, the list of frequencies is sorted. When sorted, the example frequencies shown in Table 2 are ranked as shown in Table 3, below. The rankings may be determined with Equation2 and/or Equation 3 above, or according to another ranking model.
TABLE 3 URL Ranking A 1 D 2 B 3 C 4 E 5 F 6 G 7
These rankings are presentable, e.g., to a user and/or for further processing. [0067] The results returned from the multiple search engines are consolidated 504, using in an embodiment the URL frequencies and/or the search engine ranks. For instance, the frequencies of the URLs returned with each search engine may be summed, as shown in Table 4, below.
TABLE 4
Search Engine 1 Results: 0.66 + 0.33 + 0.33 = 1.33 Search Engine 2 Results: 0.66 + 0.66 + 0.33 = 1.66 Search Engine 3 Results: 0.66 + 0.33 + 0.33 = 1.33
Search engine results may then be ranked according to their summed URL frequencies. Ranking according to the example results shown in Table 4, Search Engine 2 results are ranked first, Search Engine 1 results second and Search Engine 3 results third (e.g., one or more other criteria may be used to distinguish between tied results). Thus, where presented according to the group format (e.g., group presentation format 312; FIG. 3A), the example results are shown in Table 5, below.
TABLE 5
Search Engine Results 2 A D E Search Engine Results 1
A
B
C
Search Engine Results 3
D
F
G
EQUIVALENTS, EXTENSIONS, ALTERNATIVES & MISCELANEOUS [0068] Thus, example embodiments relating to a readable physical standby database system are described. In the foregoing specification, embodiments of the invention have been described with reference to numerous specific details that may vary from implementation to implementation. Thus, the sole and exclusive indicator of what is the invention, and is intended by the applicants to be the invention, is the set of claims that issue from this application, in the specific form in which such claims issue, including any subsequent correction. Any definitions expressly set forth herein for terms contained in such claims shall govern the meaning of such terms as used in the claims. Hence, no limitation, element, property, feature, advantage or attribute that is not expressly recited in a claim should limit the scope of such claim in any way. The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense.

Claims

CLAIMSWhat is claimed is:
1. A method, comprising: selecting a plurality of search engines from multiple search engines based on a search query and one or more criteria; to obtain search results for said search query, submitting one or more search queries to said plurality of search engines; for each search engine of said plurality of search engines, receiving certain search results for said one or more search queries submitted to said each search engine; and consolidating said certain search results, which are received from each search engine of said plurality of search engines.
2. The method as recited in Claim 1 wherein said one or more criteria is based on information describing each search engine of said plurality of search engines.
3. The method as recited in Claim 2 wherein said issuing a query based upon said information comprises generating another query based on said search query.
4. The method as recited in Claim 1 wherein one or more of said search engines of said plurality of search engines comprise a web site.
5. The method as recited in Claim 1 wherein selecting a plurality of search engines comprises selecting a search engine index.
6. The method as recited in Claim 1 wherein said consolidating comprises combining results returned from each search engine of said selected plurality of search engines into a single set of search results for presentation to an end user submitting said search query.
7. The method as recited in Claim 6 wherein said single set of search results is ranked according to relevance.
8. The method as recited in Claim 6 wherein one or more results of said single set of search results is grouped according to which search engine of said plurality of search engines returned said one or more results.
9. A method, comprising: to obtain search results for a search query, submitting one or more search queries to a plurality of search engines; wherein said plurality of search engines is selected from multiple search engines based on said search query and one or more criteria; for each search engine of said plurality of search engines, receiving certain search results for said one or more search queries submitted to said each search engine; and consolidating said certain search results, which are received from each search engine of said plurality of search engines; wherein said consolidating comprises grouping said search results according to which search engine of said plurality of search engines returned said search results.
10. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in Claim 1.
11. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in Claim 2.
12. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in Claim 3.
13. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in Claim 4.
14. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in Claim 5.
15. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in Claim 6.
16. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in Claim 7.
17. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in Claim 8.
18. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in Claim 9.
19. A system, comprising: a computer system configured to: select a plurality of search engines from among multiple search engines based on a search query received and meta-data describing the search engines; submit one or more search queries to said plurality of search engines; for each search engine of said plurality of search engines, receive certain search results for said one or more search queries submitted to said each search engine; and consolidate search results based on the certain search results received from each search engine of said plurality of search engines.
PCT/IB2008/002738 2007-02-16 2008-02-12 Federated search implemented across multiple search engines WO2009066140A2 (en)

Priority Applications (7)

Application Number Priority Date Filing Date Title
AU2008327678A AU2008327678B2 (en) 2007-02-16 2008-02-12 Federated search implemented across multiple search engines
KR1020127027515A KR101340747B1 (en) 2007-02-16 2008-02-12 Federated search implemented across multiple search engines
KR1020097019267A KR101145083B1 (en) 2007-02-16 2008-02-12 Federated search implemented across multiple search engines
KR1020117028147A KR101242917B1 (en) 2007-02-16 2008-02-12 Federated search implemented across multiple search engines
EP08832771A EP2111590A4 (en) 2007-02-16 2008-02-12 Federated search implemented across multiple search engines
CN2008800052371A CN101641694B (en) 2007-02-16 2008-02-12 Federated search implemented across multiple search engines
HK10107072.4A HK1140839A1 (en) 2007-02-16 2010-07-22 Federated search implemented across multiple search engines

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US11/707,684 2007-02-16
US11/707,684 US7930286B2 (en) 2007-02-16 2007-02-16 Federated searches implemented across multiple search engines

Publications (2)

Publication Number Publication Date
WO2009066140A2 true WO2009066140A2 (en) 2009-05-28
WO2009066140A3 WO2009066140A3 (en) 2009-10-15

Family

ID=39707513

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/IB2008/002738 WO2009066140A2 (en) 2007-02-16 2008-02-12 Federated search implemented across multiple search engines

Country Status (8)

Country Link
US (1) US7930286B2 (en)
EP (1) EP2111590A4 (en)
KR (3) KR101145083B1 (en)
CN (2) CN101641694B (en)
AU (1) AU2008327678B2 (en)
HK (1) HK1140839A1 (en)
TW (1) TWI463337B (en)
WO (1) WO2009066140A2 (en)

Families Citing this family (91)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8468168B2 (en) 2007-07-25 2013-06-18 Xobni Corporation Display of profile information based on implicit actions
US9953329B2 (en) * 2007-08-02 2018-04-24 International Business Machines Corporation System and method for providing preview results for search systems integrating mulitple collections
US8046351B2 (en) * 2007-08-23 2011-10-25 Samsung Electronics Co., Ltd. Method and system for selecting search engines for accessing information
US7716203B2 (en) * 2007-08-31 2010-05-11 International Business Machines Corporation Method and system for tracking, evaluating and ranking results of multiple matching engines
US8793265B2 (en) * 2007-09-12 2014-07-29 Samsung Electronics Co., Ltd. Method and system for selecting personalized search engines for accessing information
US9224149B2 (en) * 2007-10-15 2015-12-29 Google Inc. External referencing by portable program modules
US8370372B2 (en) * 2007-11-05 2013-02-05 Jones Scott A Method and system of promoting human-assisted search
US20100082609A1 (en) * 2008-09-30 2010-04-01 Yahoo! Inc. System and method for blending user rankings for an output display
US20100094891A1 (en) * 2008-10-13 2010-04-15 Bid Solve, Inc. Client-Server System for Multi-Resource Searching
US20100094856A1 (en) * 2008-10-14 2010-04-15 Eric Rodrick System and method for using a list capable search box to batch process search terms and results from websites providing single line search boxes
US8548797B2 (en) * 2008-10-30 2013-10-01 Yahoo! Inc. Short text language detection using geographic information
US20110213771A1 (en) * 2008-11-18 2011-09-01 Kyota Kanno Hybrid search system, hybrid search method, and hybrid search program
US8321399B2 (en) * 2008-12-17 2012-11-27 Sap Ag Method and system for searching data
US9031216B1 (en) 2009-03-05 2015-05-12 Google Inc. In-conversation search
US20100293175A1 (en) * 2009-05-12 2010-11-18 Srinivas Vadrevu Feature normalization and adaptation to build a universal ranking function
WO2010134363A1 (en) * 2009-05-18 2010-11-25 株式会社東芝 Mobile terminal
US20100313252A1 (en) * 2009-06-08 2010-12-09 Erie Trouw System, method and apparatus for creating and using a virtual layer within a web browsing environment
US8612435B2 (en) * 2009-07-16 2013-12-17 Yahoo! Inc. Activity based users' interests modeling for determining content relevance
CN101996211B (en) 2009-08-20 2013-01-23 华为技术有限公司 Method for interconnecting search servers for mobile search, search servers and system
US9760866B2 (en) 2009-12-15 2017-09-12 Yahoo Holdings, Inc. Systems and methods to provide server side profile information
US9020938B2 (en) 2010-02-03 2015-04-28 Yahoo! Inc. Providing profile information using servers
US8346780B2 (en) * 2010-04-16 2013-01-01 Hitachi, Ltd. Integrated search server and integrated search method
US8650173B2 (en) 2010-06-23 2014-02-11 Microsoft Corporation Placement of search results using user intent
US8600979B2 (en) * 2010-06-28 2013-12-03 Yahoo! Inc. Infinite browse
US8306964B2 (en) * 2010-07-20 2012-11-06 Microsoft Corporation Extraction of rich search information from index servers via an alternative asynchronous data path
US8341142B2 (en) 2010-09-08 2012-12-25 Nuance Communications, Inc. Methods and apparatus for searching the Internet
US20120059814A1 (en) * 2010-09-08 2012-03-08 Nuance Communications, Inc. Methods and apparatus for selecting a search engine to which to provide a search query
US8239366B2 (en) * 2010-09-08 2012-08-07 Nuance Communications, Inc. Method and apparatus for processing spoken search queries
CN103339623B (en) * 2010-09-08 2018-05-25 纽昂斯通讯公司 It is related to the method and apparatus of Internet search
US8577915B2 (en) * 2010-09-10 2013-11-05 Veveo, Inc. Method of and system for conducting personalized federated search and presentation of results therefrom
US8869277B2 (en) 2010-09-30 2014-10-21 Microsoft Corporation Realtime multiple engine selection and combining
CN102456016B (en) * 2010-10-18 2014-10-01 中国移动通信集团四川有限公司 Method and device for sequencing search results
CN102043834B (en) * 2010-11-25 2013-07-31 北京搜狗科技发展有限公司 Method for realizing searching by utilizing client and search client
US20120203751A1 (en) * 2011-02-07 2012-08-09 International Business Machines Corporation Capture, Aggregate, and Use Search Activities as a Source of Social Data Within an Enterprise
US8706756B2 (en) * 2011-05-11 2014-04-22 Futurewei Technologies, Inc. Method, system and apparatus of hybrid federated search
US9262513B2 (en) * 2011-06-24 2016-02-16 Alibaba Group Holding Limited Search method and apparatus
US9747583B2 (en) 2011-06-30 2017-08-29 Yahoo Holdings, Inc. Presenting entity profile information to a user of a computing device
US9489457B2 (en) 2011-07-14 2016-11-08 Nuance Communications, Inc. Methods and apparatus for initiating an action
US8635201B2 (en) 2011-07-14 2014-01-21 Nuance Communications, Inc. Methods and apparatus for employing a user's location in providing information to the user
US8812474B2 (en) 2011-07-14 2014-08-19 Nuance Communications, Inc. Methods and apparatus for identifying and providing information sought by a user
US8930340B1 (en) * 2011-09-20 2015-01-06 Google Inc. Blending content in an output
US9292603B2 (en) 2011-09-30 2016-03-22 Nuance Communications, Inc. Receipt and processing of user-specified queries
US8700622B2 (en) * 2011-12-16 2014-04-15 International Business Machines Corporation Activities based dynamic data prioritization
US8880992B2 (en) * 2012-01-10 2014-11-04 Google Inc. Method and apparatus for animating transitions between search results
US8645361B2 (en) 2012-01-20 2014-02-04 Microsoft Corporation Using popular queries to decide when to federate queries
CN103377240B (en) * 2012-04-26 2017-03-01 阿里巴巴集团控股有限公司 Information providing method, processing server and merging server
US9922120B2 (en) * 2012-08-24 2018-03-20 Microsoft Technology Licensing, Llc Online learning of click-through rates on federated search results
US10229138B2 (en) 2012-09-27 2019-03-12 Nokia Technologies Oy Method and apparatus for tagged deletion of user online history
US10192200B2 (en) 2012-12-04 2019-01-29 Oath Inc. Classifying a portion of user contact data into local contacts
CN102982173B (en) * 2012-12-17 2016-10-12 北京奇虎科技有限公司 A kind of web search method and device
US8793246B1 (en) * 2013-03-08 2014-07-29 Fmr Llc Identifying ranking scores for domains of interest
US9405803B2 (en) * 2013-04-23 2016-08-02 Google Inc. Ranking signals in mixed corpora environments
CN103646039A (en) * 2013-11-15 2014-03-19 天脉聚源(北京)传媒科技有限公司 Webpage searching method and device
EP2881898A1 (en) 2013-12-09 2015-06-10 Accenture Global Services Limited Virtual assistant interactivity platform
US11921715B2 (en) 2014-01-27 2024-03-05 Microstrategy Incorporated Search integration
US10255320B1 (en) 2014-01-27 2019-04-09 Microstrategy Incorporated Search integration
US9251224B2 (en) * 2014-03-04 2016-02-02 Google Inc. Triggering and ranking of native applications
US11004139B2 (en) 2014-03-31 2021-05-11 Monticello Enterprises LLC System and method for providing simplified in store purchases and in-app purchases using a use-interface-based payment API
US10152756B2 (en) 2014-03-31 2018-12-11 Monticello Enterprises LLC System and method for providing multiple payment method options to browser
US9430794B2 (en) 2014-03-31 2016-08-30 Monticello Enterprises LLC System and method for providing a buy option in search results when user input is classified as having a purchase intent
US11080777B2 (en) 2014-03-31 2021-08-03 Monticello Enterprises LLC System and method for providing a social media shopping experience
US10832310B2 (en) 2014-03-31 2020-11-10 Monticello Enterprises LLC System and method for providing a search entity-based payment process
US11282131B2 (en) 2014-03-31 2022-03-22 Monticello Enterprises LLC User device enabling access to payment information in response to user input
US20240013283A1 (en) 2014-03-31 2024-01-11 Monticello Enterprises LLC System and method for providing a social media shopping experience
US10643266B2 (en) 2014-03-31 2020-05-05 Monticello Enterprises LLC System and method for in-app payments
US9361638B2 (en) 2014-03-31 2016-06-07 Monticello Enterprises LLC System and method for providing a single input field having multiple processing possibilities
US10002396B2 (en) 2014-03-31 2018-06-19 Monticello Enterprises LLC System and method for transitioning from a first site to a second site
US10121186B2 (en) 2014-03-31 2018-11-06 Monticello Enterprises LLC System and method of using a browser application programming interface for making payments
US10621653B2 (en) 2014-03-31 2020-04-14 Monticello Enterprises LLC System and method for providing payments for users in connection with a device software module having a payment application programming interface
US10726472B2 (en) 2014-03-31 2020-07-28 Monticello Enterprises LLC System and method for providing simplified in-store, product-based and rental payment processes
US10497037B2 (en) 2014-03-31 2019-12-03 Monticello Enterprises LLC System and method for managing cryptocurrency payments via the payment request API
US9922380B2 (en) 2014-03-31 2018-03-20 Monticello Enterprises LLC System and method for providing messenger application for product purchases
US10511580B2 (en) 2014-03-31 2019-12-17 Monticello Enterprises LLC System and method for providing a social media shopping experience
US11250493B2 (en) 2014-03-31 2022-02-15 Monticello Enterprises LLC System and method for performing social media cryptocurrency transactions
US10642845B2 (en) * 2014-05-30 2020-05-05 Apple Inc. Multi-domain search on a computing device
US10896186B2 (en) 2014-06-30 2021-01-19 Microsoft Technology Licensing, Llc Identifying preferable results pages from numerous results pages
AU2015249157B2 (en) * 2014-10-31 2017-06-29 Financial & Risk Organisation Limited Digital communications interface and graphical user interface
AU2016340043A1 (en) * 2015-10-15 2018-05-24 Big Ip Pty Ltd A system, method, computer program and data signal for conducting an electronic search of a database
CN105447095A (en) * 2015-11-10 2016-03-30 上海斐讯数据通信技术有限公司 Website information collection method and system
US10061819B2 (en) * 2015-12-18 2018-08-28 International Business Machines Corporation Unsupervised boosting of unique search results in a metasearch environment
CN105701216B (en) * 2016-01-13 2017-03-08 北京三快在线科技有限公司 A kind of information-pushing method and device
CN106126653B (en) * 2016-06-27 2019-12-31 广州探途网络技术有限公司 Searching device and method
US20180150525A1 (en) * 2016-11-29 2018-05-31 Facebook, Inc. Methods and Systems for Prioritizing Entities in Search Results
CN108121815B (en) * 2017-12-28 2022-03-11 深圳开思时代科技有限公司 Automobile part query method, device and system, electronic equipment and medium
US11080313B2 (en) * 2018-03-20 2021-08-03 International Business Machines Corporation Recommendation technique using automatic conversation
US11100106B1 (en) * 2018-08-16 2021-08-24 Amazon Technologies, Inc. Query engine virtualization
US10853434B2 (en) 2019-03-11 2020-12-01 Vladimir Prelovac User interface for presenting search results
US11366814B2 (en) * 2019-06-12 2022-06-21 Elsevier, Inc. Systems and methods for federated search with dynamic selection and distributed relevance
US20210157813A1 (en) * 2019-11-27 2021-05-27 Microstrategy Incorporated Mutually exclusive search operations
US11614970B2 (en) 2019-12-06 2023-03-28 Microstrategy Incorporated High-throughput parallel data transmission
US20220358176A1 (en) * 2021-05-08 2022-11-10 Greenburger Noah System and method of merging online search and consolidation

Family Cites Families (21)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100382600B1 (en) * 2000-01-31 2003-05-01 주식회사 제이.이.씨 Method for providing integrated web search service through network system and computer-readable medium recording the method
US7725526B1 (en) * 2000-06-23 2010-05-25 International Business Machines Corporation System and method for web based sharing of search engine queries
US20020069194A1 (en) * 2000-12-06 2002-06-06 Robbins Benjamin Jon Client based online content meta search
US6631367B2 (en) * 2000-12-28 2003-10-07 Intel Corporation Method and apparatus to search for information
US7519605B2 (en) 2001-05-09 2009-04-14 Agilent Technologies, Inc. Systems, methods and computer readable media for performing a domain-specific metasearch, and visualizing search results therefrom
US6728704B2 (en) * 2001-08-27 2004-04-27 Verity, Inc. Method and apparatus for merging result lists from multiple search engines
KR20030069640A (en) * 2002-02-22 2003-08-27 이의범 System and method for geting information on hierarchical and conceptual clustering
US7716199B2 (en) * 2005-08-10 2010-05-11 Google Inc. Aggregating context data for programmable search engines
US20070038614A1 (en) * 2005-08-10 2007-02-15 Guha Ramanathan V Generating and presenting advertisements based on context data for programmable search engines
US6829599B2 (en) 2002-10-02 2004-12-07 Xerox Corporation System and method for improving answer relevance in meta-search engines
US6944612B2 (en) * 2002-11-13 2005-09-13 Xerox Corporation Structured contextual clustering method and system in a federated search engine
KR20040073694A (en) * 2003-02-14 2004-08-21 구민오 A Method For Providing Multiple Search Using Web Service And Exterior Library And Storage Media Thereof
US7308643B1 (en) 2003-07-03 2007-12-11 Google Inc. Anchor tag indexing in a web crawler system
JP2006528383A (en) * 2003-07-23 2006-12-14 ユニバーシティ・カレッジ・ダブリン,ナショナル・ユニバーシティ・オブ・アイルランド,ダブリン Information retrieval
CN1856791A (en) * 2003-07-23 2006-11-01 爱尔兰都柏林国立大学-都柏林大学 Information retrieval
US8312014B2 (en) * 2003-12-29 2012-11-13 Yahoo! Inc. Lateral search
WO2006023765A2 (en) * 2004-08-19 2006-03-02 Claria, Corporation Method and apparatus for responding to end-user request for information
US7440968B1 (en) 2004-11-30 2008-10-21 Google Inc. Query boosting based on classification
CN101164067B (en) * 2005-02-28 2013-11-06 搜索引擎科技有限责任公司 Methods of and systems for searching by incorporating user-entered information
US20060288001A1 (en) 2005-06-20 2006-12-21 Costa Rafael Rego P R System and method for dynamically identifying the best search engines and searchable databases for a query, and model of presentation of results - the search assistant
US8386469B2 (en) * 2006-02-16 2013-02-26 Mobile Content Networks, Inc. Method and system for determining relevant sources, querying and merging results from multiple content sources

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of EP2111590A4 *

Also Published As

Publication number Publication date
TWI463337B (en) 2014-12-01
AU2008327678A1 (en) 2009-05-28
KR20090121336A (en) 2009-11-25
KR101145083B1 (en) 2012-05-11
US7930286B2 (en) 2011-04-19
KR20120130272A (en) 2012-11-29
HK1140839A1 (en) 2010-10-22
CN101641694A (en) 2010-02-03
WO2009066140A3 (en) 2009-10-15
EP2111590A2 (en) 2009-10-28
US20080201304A1 (en) 2008-08-21
TW200842624A (en) 2008-11-01
KR101340747B1 (en) 2013-12-12
CN101641694B (en) 2013-05-22
EP2111590A4 (en) 2012-07-25
AU2008327678B2 (en) 2011-06-23
KR101242917B1 (en) 2013-03-12
CN103309935A (en) 2013-09-18
KR20120003959A (en) 2012-01-11

Similar Documents

Publication Publication Date Title
AU2008327678B2 (en) Federated search implemented across multiple search engines
US7756867B2 (en) Ranking documents
US6112202A (en) Method and system for identifying authoritative information resources in an environment with content-based links between information resources
US6751612B1 (en) User query generate search results that rank set of servers where ranking is based on comparing content on each server with user query, frequency at which content on each server is altered using web crawler in a search engine
US8046347B2 (en) Method and apparatus for reconstructing a search query
KR101298334B1 (en) Techniques for including collection items in search results
US8412702B2 (en) System, method, and/or apparatus for reordering search results
US8438469B1 (en) Embedded review and rating information
US20080208808A1 (en) Configuring searches
US20080168048A1 (en) User content feeds from user storage devices to a public search engine
US20080104042A1 (en) Personalized Search Using Macros
KR20060080579A (en) A system and a method for presenting multiple sets of search results for a single query
WO2008045981A2 (en) Virtual network of real-world entities
US20100125781A1 (en) Page generation by keyword
WO2009023371A2 (en) Categorization of queries
Tarakeswar et al. Search engines: a study
Fatima et al. New framework for semantic search engine
US20060116992A1 (en) Internet search environment number system
WO2012162683A1 (en) Dynamically-created landing webpage
Sadeh The challenge of metasearching
JP5525424B2 (en) Document search apparatus, document search method, and document search program
Wiza Interactive 3D visualization of search results

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 200880005237.1

Country of ref document: CN

WWE Wipo information: entry into national phase

Ref document number: 2008832771

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 2008327678

Country of ref document: AU

NENP Non-entry into the national phase

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 4917/CHENP/2009

Country of ref document: IN

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 08832771

Country of ref document: EP

Kind code of ref document: A2

ENP Entry into the national phase

Ref document number: 2008327678

Country of ref document: AU

Date of ref document: 20080212

Kind code of ref document: A

WWE Wipo information: entry into national phase

Ref document number: KR

Ref document number: 1020097019267

Country of ref document: KR

WWE Wipo information: entry into national phase

Ref document number: 1020117028147

Country of ref document: KR

WWE Wipo information: entry into national phase

Ref document number: 1020127027515

Country of ref document: KR