Federation for parallel searching
A search engine can be configured to improve search times by implementing a parallel computing architecture. The index is split across a plurality of independent search nodes. A query is communicated to each of the parallel nodes and the query is searched in each independent node. The results from e...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Patent |
| Sprache: | eng |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Dutton, Keith A Roizen, Igor Ganz, Sanford J |
| description | A search engine can be configured to improve search times by implementing a parallel computing architecture. The index is split across a plurality of independent search nodes. A query is communicated to each of the parallel nodes and the query is searched in each independent node. The results from each node are routed to a federator that is configured to aggregate the results to a result set. The federator is configured to determine a subset of intermediate results to retrieve and aggregate from each of the independent nodes. The federator determines a number of results to retrieve from each of the nodes based at least in part on the number of nodes and the number of search results desired in the results set. |
| format | Patent |
| fullrecord | <record><control><sourceid>uspatents_EFH</sourceid><recordid>TN_cdi_uspatents_grants_07953723</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>07953723</sourcerecordid><originalsourceid>FETCH-uspatents_grants_079537233</originalsourceid><addsrcrecordid>eNrjZFB0S01JLUosyczPU0jLL1IoSCxKzMlJzVEoTk0sSs7IzEvnYWBNS8wpTuWF0twMCm6uIc4euqXFBYklqXklxfHpRYkgysDc0tTY3MjYmAglAGq1Jqc</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Federation for parallel searching</title><source>USPTO Issued Patents</source><creator>Dutton, Keith A ; Roizen, Igor ; Ganz, Sanford J</creator><creatorcontrib>Dutton, Keith A ; Roizen, Igor ; Ganz, Sanford J ; Shopzilla, Inc</creatorcontrib><description>A search engine can be configured to improve search times by implementing a parallel computing architecture. The index is split across a plurality of independent search nodes. A query is communicated to each of the parallel nodes and the query is searched in each independent node. The results from each node are routed to a federator that is configured to aggregate the results to a result set. The federator is configured to determine a subset of intermediate results to retrieve and aggregate from each of the independent nodes. The federator determines a number of results to retrieve from each of the nodes based at least in part on the number of nodes and the number of search results desired in the results set.</description><language>eng</language><creationdate>2011</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://image-ppubs.uspto.gov/dirsearch-public/print/downloadPdf/7953723$$EPDF$$P50$$Guspatents$$Hfree_for_read</linktopdf><link.rule.ids>230,308,780,802,885,64038</link.rule.ids><linktorsrc>$$Uhttps://image-ppubs.uspto.gov/dirsearch-public/print/downloadPdf/7953723$$EView_record_in_USPTO$$FView_record_in_$$GUSPTO$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Dutton, Keith A</creatorcontrib><creatorcontrib>Roizen, Igor</creatorcontrib><creatorcontrib>Ganz, Sanford J</creatorcontrib><creatorcontrib>Shopzilla, Inc</creatorcontrib><title>Federation for parallel searching</title><description>A search engine can be configured to improve search times by implementing a parallel computing architecture. The index is split across a plurality of independent search nodes. A query is communicated to each of the parallel nodes and the query is searched in each independent node. The results from each node are routed to a federator that is configured to aggregate the results to a result set. The federator is configured to determine a subset of intermediate results to retrieve and aggregate from each of the independent nodes. The federator determines a number of results to retrieve from each of the nodes based at least in part on the number of nodes and the number of search results desired in the results set.</description><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2011</creationdate><recordtype>patent</recordtype><sourceid>EFH</sourceid><recordid>eNrjZFB0S01JLUosyczPU0jLL1IoSCxKzMlJzVEoTk0sSs7IzEvnYWBNS8wpTuWF0twMCm6uIc4euqXFBYklqXklxfHpRYkgysDc0tTY3MjYmAglAGq1Jqc</recordid><startdate>20110531</startdate><enddate>20110531</enddate><creator>Dutton, Keith A</creator><creator>Roizen, Igor</creator><creator>Ganz, Sanford J</creator><scope>EFH</scope></search><sort><creationdate>20110531</creationdate><title>Federation for parallel searching</title><author>Dutton, Keith A ; Roizen, Igor ; Ganz, Sanford J</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-uspatents_grants_079537233</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2011</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Dutton, Keith A</creatorcontrib><creatorcontrib>Roizen, Igor</creatorcontrib><creatorcontrib>Ganz, Sanford J</creatorcontrib><creatorcontrib>Shopzilla, Inc</creatorcontrib><collection>USPTO Issued Patents</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Dutton, Keith A</au><au>Roizen, Igor</au><au>Ganz, Sanford J</au><aucorp>Shopzilla, Inc</aucorp><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Federation for parallel searching</title><date>2011-05-31</date><risdate>2011</risdate><abstract>A search engine can be configured to improve search times by implementing a parallel computing architecture. The index is split across a plurality of independent search nodes. A query is communicated to each of the parallel nodes and the query is searched in each independent node. The results from each node are routed to a federator that is configured to aggregate the results to a result set. The federator is configured to determine a subset of intermediate results to retrieve and aggregate from each of the independent nodes. The federator determines a number of results to retrieve from each of the nodes based at least in part on the number of nodes and the number of search results desired in the results set.</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_uspatents_grants_07953723 |
| source | USPTO Issued Patents |
| title | Federation for parallel searching |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T08%3A49%3A32IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-uspatents_EFH&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=Dutton,%20Keith%20A&rft.aucorp=Shopzilla,%20Inc&rft.date=2011-05-31&rft_id=info:doi/&rft_dat=%3Cuspatents_EFH%3E07953723%3C/uspatents_EFH%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |