text:
Patent US20020198869 - Metasearch technique that ranks documents obtained from multiple collections - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inPatentsIn a metasearch conducted across multiple document collections, a multi-phase approach is employed in which local and global statistics are dynamically exchanged between the search engines and the metasearch engine in response to a user's query. In the first phase, the query is transmitted to the search...http://www.google.com/patents/US20020198869?utm_source=gb-gplus-sharePatent US20020198869 - Metasearch technique that ranks documents obtained from multiple collectionsAdvanced Patent SearchTry the new Google Patents, with machine-classified Google Scholar results, and Japanese and South Korean patents.Publication numberUS20020198869 A1Publication typeApplicationApplication numberUS 09/884,109Publication dateDec 26, 2002Filing dateJun 20, 2001Priority dateJun 20, 2001Also published asUS6795820Publication number09884109, 884109, US 2002/0198869 A1, US 2002/198869 A1, US 20020198869 A1, US 20020198869A1, US 2002198869 A1, US 2002198869A1, US-A1-20020198869, US-A1-2002198869, US2002/0198869A1, US2002/198869A1, US20020198869 A1, US20020198869A1, US2002198869 A1, US2002198869A1InventorsRussell BarnettOriginal AssigneeBarnett Russell ClarkExport CitationBiBTeX, EndNote, RefManPatent Citations (9), Referenced by (79), Classifications (7), Legal Events (10) External Links: USPTO, USPTO Assignment, EspacenetMetasearch technique that ranks documents obtained from multiple collections
US 20020198869 A1Abstract
In a metasearch conducted across multiple document collections, a multi-phase approach is employed in which local and global statistics are dynamically exchanged between the search engines and the metasearch engine in response to a user's query. In the first phase, the query is transmitted to the search engines from the metasearch engine, and each search engine computes or retrieves previously-computed local statistics for those terms in its associated document collection. In the second phase, each search engine returns its local statistics. A third phase consists of computing metacollection level statistics at the metasearch engine, based upon the information contained in the local statistics. The metacollection level statistics are disseminated to the search engines. In the final phase, the search engines rank the documents in their respective collections pursuant to the metacollection level statistics, and transmit the rankings to the metasearch engine. The metasearch engine merges the results from the individual search engines, to produce a single ranked results list for the user. Images(6) Claims(49)
FIELD OF THE INVENTION [0001] The present invention is generally directed to the field of information search and retrieval, and more particularly to techniques for locating and ranking documents and/or other forms of information that are contained in multiple collections accessible via a network. BACKGROUND OF THE INVENTION [0002] Computer networking technology has made large quantities of digital content available to users, resulting in a phenomenon popularly known as information overload; users have access to much more information and entertainment than they can absorb. Significant practical and commercial value has therefore been provided by search technologies, whose goal is to identify the information that is of greatest utility to a user within a given content collection. [0003] The quality of a search is typically quantified by two measures. First, a search should find all the information in a collection that is relevant to a given query. Second, it should suppress information that is irrelevant to the query. These two measures of success correspond to recall and precision, respectively. A search is considered less effective to the extent that it cannot maximize both measures simultaneously. Thus, while one may be able to increase recall by relaxing parameters of the search, such a result may be achieved only at the expense of precision, in which case the overall effectiveness of the search has not been enhanced. [0004] A metasearch combines results from more than one search, with each search typically being conducted over a different content collection. Often, the various content collections are respectively associated with different information resources, e.g. different file servers or databases, in which case the metasearch is sometimes referred to as a distributed search. The present invention is concerned with the difficulty of maximizing both the recall and precision of a metasearch, particularly one that is conducted via distributed resources. The following discussion explains the sources of such difficulty. [0005] For simplicity of exposition, the issues will be discussed herein with reference to keyword-based queries of text-based content. As practitioners familiar with the field will recognize, the disclosed principles are easily generalized to queries of text-based content that are not purely keyword-based (such as natural-language queries into parsed documents), as well as to queries of content that is not text-based (such as digital sounds and images). The applicability of the present invention to methods for processing such queries will be readily apparent to those skilled in the art. [0006] To facilitate an understanding of the invention, the following definitions are used in the context of exemplary keyword-based searches that are employed to describe the invention. A “term” is defined to be a word or a phrase. A “query” is a set (mathematically, a bag) of terms that describes what is being sought by the user. A “document” is a pre-existing set of terms. A “collection” is a pre-existing set of documents. A “metacollection” is a pre-existing set of collections. [0007] A ranked search is the procedure of issuing a query against a collection and finding the documents that score highest with respect to that query and that collection. The dependence of each score on the entire collection often stems from the well-known technique of weighting most strongly those search terms that are least common in the collection. For example, the query “high-tech farming” would be likely to select the few documents in a computer collection that contain the term “farming”, and the few documents in an agriculture collection that contain the term “high-tech”. [0008] A metasearch is the procedure of responding to a query against a metacollection by combining results from multiple searches. For the metasearch to be maximally precise, it should find the documents that score highest with respect to the metacollection, not those that score highest with respect to the individual collections in which they reside. For example, in a metasearch over the two aforementioned collections, if a query contains the term “computer,” an incorrect implementation would give undue weight to computer-related documents that appear in the agriculture collection. The practical impacts of this effect are substantial to the extent that a metacollection is used to cull information from diverse collections, each with a different specialty or focus. [0009] A process that executes an individual search is called a search engine. A process that invokes search engines and combines results is known as a metasearch engine. FIG. 1 depicts the general components of a metasearch system. Typically, the user presents a query to a metasearch engine 10. The metasearch engine forwards this query on to multiple search engines 12 a, 12 b . . . 12 n, each of which is associated with a collection 14 a-14 n of information content, e.g. documents 15. Most documents are likely to appear in only one collection. However, some documents can appear in more than one collection, as depicted by the overlap of the sets of documents 15 in collections 14 b and 14 n. In such a case, multiple references to a document can appear in the results of a metasearch which employs both of these collections. A well-designed metasearch engine attempts to remove duplicates whenever possible. [0010] The relationship between search engines and collections need not be one-to-one. For example, as depicted in FIG. 1, two different search engines 12 b and 12 c may both execute a query against the same collection 14 b. In the context of the present invention, this situation is considered to be within the meaning of executing a query on different collections, namely the collection 14 b as processed by the search engine 12 b, and the collection 14 b as processed by the search engine 12 c. In some cases, the two search engines could operate with different sets of heuristics. In such a situation the two search engines might produce different results, e.g., different rankings within the respective documents of the same collection. In the particular situation depicted in FIG. 1, since some documents are common to collections 14 b and 14 n, three references to those documents could be returned to the metasearch engine by search engines 12 b, 12 c and 12 n, respectively. [0011] The metasearch engine 10 and the various search engines 12 execute on computers that communicate with one another via a network. In a fully distributed metasearch, each engine 10, 12 executes on a different machine. In a less distributed system, two or more of these engines may execute on the same machine. For instance, the search engines 12 a and 12 b may execute on the same computer 16, or the metasearch engine 10 and one or more of the search engines 12 may execute on the same computer. Similarly, the various collections 14 may reside in different respective storage systems, or any two or more of them can share a common storage facility. The efficiency with which information is exchanged between the metasearch engine 10 and the various search engines 12 via the network is a significant factor in the overall user experience. [0012] In a system that implements metasearch capability, it is desirable to identify the documents that score highest with respect to the metacollection, i.e. the totality of the collections 14 a-14 n. The more significant components of the system are the search engines, the metasearch engine, and the protocol by which they communicate. When the search engines exist on different machines in a distributed network, it is further desirable for the communication protocol to minimize the amount of latency perceived by the user, as well as the resource burden in terms of bandwidth and processing power. [0013] Numerous metasearch implementations exist in the commercial world and in the academic literature. Because of fundamental differences in approach, these vary significantly in precision. FIG. 2 illustrates a taxonomy of the various implementations for metasearch techniques. Before discussing these implementations, however, one distinctive concept should be noted. Much of the prior art operates by centralized indexing, which is not a form of metasearching. With centralized indexing, the original documents remain in their distributed locations but an index database is stored in a central location. The index is built by “crawling”, i.e. copying each document to the centralized facility to be indexed. Unless the copy of a document is required for future retrieval from the central location, it can be destroyed after it has been indexed. Relative to metasearching, central indexing schemes have three main disadvantages. First, because the indexing process takes time, the index is more difficult to keep up to date. For example, crawling the entire Internet takes weeks. Second, unless a protocol is in place specifically to skip the indexing of unchanged documents, the indexing process wastes processing time at the central index and network bandwidth. Third, the hardware resources required to store the central index and to execute queries against it grow at least linearly with the size of the collection being indexed. Thus, metasearch techniques provide significant practical and commercial advantages. [0014] Turning now to FIG. 2, metasearch techniques can be classified into two broad categories, Boolean searches and ranked searches. The weakest metasearch techniques apply Boolean rules that either accept or reject each document, and do not supply a score. Thus, they cannot prioritize results in the event that the result set is too large for the user to consume. In contrast, ranked metasearch techniques permit such prioritization. [0015] The category of ranked metasearches can be further divided into centralized and decentralized ranking. In centralized ranking implementations, each search engine sends candidate documents to the metasearch engine, which then ranks them as a single, new collection. Some variants of centralized ranking transmit each document to the metasearch engine in its entirety. Others make more economical use of network bandwidth by transmitting only the minimal amount of statistical information about each document that is needed to compute the necessary scores. In many cases, a Boolean search initially conducted by each search engine eliminates from consideration any completely irrelevant documents. [0016] Centralized ranking is either network intensive or extremely imprecise. It is network intensive if each search engine returns all documents, or all documents that satisfy the Boolean pass. It is extremely imprecise if a limit is placed on the number of documents returned by each search engine; without performing any scoring or ranking, a search engine cannot prioritize its result list. [0017] To help overcome the extreme imprecision and high bandwidth utilization described above, decentralized ranking techniques are preferred. Decentralized ranking can be carried out by using either local statistics or global statistics. In metasearch implementations that employ local statistics, each search engine initially returns the results that score best with respect to the given query and the individual collection. These results are subsequently combined and manipulated for presentation to the user. Within this rubric there are many subsidiary variations. [0018] a) Some metasearch implementations do not attempt to re-rank results. Instead, they either group results by search server or interleave them. [0019] b) Others attempt to remove duplicates and re-rank results, applying scoring rules with heuristic measures such as the number of duplications across search servers, rank within each search, and concentration of search terms within the title or summary received from each search server. [0020] c) Still others perform a final, centralized ranking at the metasearch engine, treating the union of results returned from the search engines as a single collection. [0021] Regardless of these variations, these implementations suffer from lack of precision when applied across collections with disparate statistics. The scoring function applied within each collection does not in general match the scoring function applied across the metacollection because the local statistics do not match. Thus, in the example described previously, the relatively few documents from the agriculture collection might be ranked higher than the potentially more relevant documents from the computer collection, due to the limited focus of each search engine. Consequently, decentralized ranking with local statistics is most appropriate when the constituent search engines are not under control of the metasearch provider, and each search engine has access to substantially the same content. Those conditions hold true, for example, when combining multiple search engines on the Internet. [0022] To obtain a correct ranking in a network-efficient manner, decentralized ranking with global statistics is most preferable. In this approach, some portion of the computation is executed by the individual search engines using global statistics (statistics that depend on the entire metacollection). The desirability of such metacollection-level statistics has been recognized in the published literature since 1995. See, for example, C. Viles and J. French, “Dissemination of Collection Wide Information in a Distributed Information Retrieval System,” Technical Report CS-95-02, University of Virginia, Jan. 6, 1995. Particular methods for accomplishing such computations have been refined during the intervening years. [0023] One class of approaches is to precompute all necessary metacollection-level statistics and store them at each search engine, as taught, for example, in U.S. Pat. No. 6,163,782. This approach eliminates request-response delays perceived by the user that would otherwise be incurred during the computation of metacollection-level statistics. However, it is appropriate only if the same metacollection is used for every metasearch. In general, that condition does not hold. With each query, the user might specify a different set of collections to be included in the metacollection. Even if the user does not make such a specification, many metasearch systems perform a database selection process that determines the collections which are most likely to have appropriate results for a given query. Each query might include conditions, such as access rights, that cause different documents to be included within the metacollection. The set of available documents itself might be dynamic, with documents being continuously added, deleted, and edited. Each of these conditions makes it impractical to use pre-computed metacollection statistics. [0024] In a variation of such an approach, only certain metacollection-level statistics, such as document frequencies, are precomputed and stored at each search engine. Such approaches are subject to similar limitations. [0025] Thus, for correctness and practicality it is preferable for at least some of the metacollection-level statistics to be dynamically computed in response to each query. It is the goal of the present invention to provide such correctness and generality. It is a further goal to do so in a manner that minimizes both perceived latency and consumed memory, processing, and network resources. These goals become increasingly important as the scale of the collections, metacollection, and result sets increases. SUMMARY OF THE INVENTION [0026] In accordance with the invention, these objectives are achieved by means of a multi-phase approach in which local and global statistics are exchanged between the search engines and the metasearch engine. In the first phase, the query is transmitted to the search engines from the metasearch engine, and each search engine computes or retrieves previously-computed local statistics for those terms in its associated document collection. In the second phase, each search engine returns its local statistics. A third phase consists of computing metacollection level statistics at the metasearch engine, based upon the information contained in the local statistics. The metacollection level statistics are disseminated to the search engines. In the final phase, the search engines determine scores for the documents in their respective collections pursuant to the metacollection level statistics, and transmit document references to the metasearch engine. The metasearch engine merges the results from the individual search engines, to produce a single ranked results list for the user. [0027] By dynamically computing the local and metacollection statistics at the time a query is presented, the present invention maximizes precision for the collections that are being searched, without compromising recall. In addition, the amount of data that is transmitted over the network is kept to a minimum, thereby providing efficient bandwidth utilization and reduced latency. Furthermore, the topology of the search mechanism readily supports a multi-tier hierarchy of search engines, thereby facilitating the scalability of the metasearch system to any number of document collections and search engines. [0028] Additional features of the invention which contribute to both the efficacy of the search and the efficiency of network communications are described hereinafter with reference to exemplary embodiments depicted in the drawings.
BRIEF DESCRIPTION OF THE DRAWINGS [0029] [0029]FIG. 1 is a general block diagram of the basic components of a typical metasearch system; [0030] [0030]FIG. 2 is an illustration of the topology of various metasearch techniques; [0031] [0031]FIG. 3 is a flow diagram of the four fundamental phases of a metasearch in accordance with the present invention; [0032] [0032]FIG. 4 is a expanded flow diagram of the phases of a metasearch in accordance with the present invention, illustrating additional features that can be incorporated; [0033] [0033]FIG. 5 is a flow chart of the distributed sort and chunking features of an embodiment of the present invention; [0034] [0034]FIG. 6 is a block diagram of the manner in which abstract iterators can be employed in the context of the invention; and [0035] [0035]FIG. 7 is a block diagram of a hierarchical arrangement of search engines.
DETAILED DESCRIPTION [0036] To facilitate an understanding of the invention, a description will first be provided of one example of a methodology that can be employed to score each document that is retrieved in response to a query, for purposes of ranking the relevance of the documents to the terms in the query. In the description which follows, a document can be a file which contains textual terms. Other examples of “documents” that contain searchable content include web pages, images, videos, audio files, etc. In these latter examples, the elements of a query can be any suitable description for the content of the document. For instance, in the case of a video, a query term might be a scene identifier, and in the case of an audio file it might be a particular sequence of musical notes. In a more complex image-retrieval system, the contents of an image might be characterized in terms of wavelet transformations. Information-retrieval techniques, which are well known in the art, call for the scoring of documents based on statistics that are dependent on the query, each document, each collection, and the metacollection. [0037] Collection-level statistics depend only on the query and a single collection. Some commonly employed statistics include: [0038] Collection size (ni): The number of documents or the number of terms in collection i. [0039] Local mean document length (mdli): The mean document length in collection i. [0040] Local document frequency (dfij): The number of documents in collection i that contain term j. [0041] Local collection frequency (cfij): The number of occurrences of the term j in collection i. [0042] Metacollection-level statistics depend on the query and the entire metacollection. These are: [0043] Metacollection size (N): The number of documents or the number of terms in the metacollection. [0044] Mean document length (MDL): The mean document length across the metacollection. [0045] Document frequency (DFj): The number of documents in the metacollection that contain term j. [0046] Inverse document frequency (IDFj): The scarcity of documents containing term j, often equal to log(N/DFj). [0047] Collection frequency (CFj): The number of occurrences of the term j in the metacollection. [0048] Inverse collection frequency (ICFj): The scarcity of term j in the metacollection. [0049] Document-level parameters depend on an individual document and the query. These are: [0050] Document length (dlk): The length of document k. [0051] Term frequency (tfjk): The number of times term j appears in document k. [0052] Other statistics are known as well, and can be employed in addition to, or in place of, those defined above. [0053] In the so-called vector-space representation, each document is represented as a vector (r1k, r2k, . . . ), in which each element (rjk) is computed for term j and document k by a function. An example of such a function which is based on some of the foregoing statistics could take the following form:
[0054] where f( ) is a function whose precise form varies among implementations, and NP is an optional normalization parameter based on document-level statistics. [0055] As another example, ICF can be used in place of IDF in many cases. It can be seen that the vector representation depends on metacollection-level statistics as well as document-level parameters. Many implementations may also normalize the vector to lie on the unit sphere, i.e., have Euclidean length of one. [0056] The query is similarly represented as a vector, computed as if the query were a document in the metacollection. The score of a document is quantified in terms of its proximity to the query in vector space. Proximity is commonly measured as the cosine of the angle between two vectors, which is efficiently computed as a dot product between the two vectors. [0057] While various metasearch implementations may use different techniques for scoring documents, it is widely acknowledged that dependence of the score on metacollection-level statistics (typically IDFj or ICFj) produces a practical level of precision in response to a metasearch across multiple collections. The challenges described previously exist in any metasearch wherein document scores depend on metacollection-level statistics. [0058] In accordance with the general principles of the present invention, a metasearch is carried out in four phases, which comprise two cycles of request and response. These four phases are depicted in the flow diagram of FIG. 3. Referring thereto, the metasearch engine 10 first receives a query containing parameters for a ranked search and disseminates it to each search engine 12, at step 20. In response, in the second phase each search engine computes collection-level, or local, statistics at step 22 and returns those statistics to the metasearch engine. In the third phase, the metasearch engine computes and disseminates metacollection-level, or global, statistics (step 24). Finally, in the fourth phase, each search engine scores each document using the global statistics at step 26, and returns a result to the metasearch engine. The metasearch engine collates results from the search engines and produces a single ranking at step 28. [0059] Thus, in the present invention, at least some of the global statistics are computed after receiving the user's query, and are based upon local statistics determined in accordance with the query. In other words, the document scores are dynamically computed, rather than approximated. In some implementations, it may be feasible to calculate some of the global statistics and disseminate them on a periodic basis, rather than compute them for each query. For instance, if all of the documents in a metacollection have lengths that vary within a small range, it may be preferable to compute MDL once per day, and transmit that statistic at a suitable time that would not impact network traffic. For other global statistics, however, particularly IDF and ICF, the best results are obtained when they are computed dynamically for each query. [0060] The data that is returned by the search engine in phase four comprises a document reference. The document reference can take any of a variety of forms. For example, it could be a full copy of the document itself, an identification of the document, a link to the location of the document, e.g. a URL, a link plus a short descriptor or summary of the document, etc. The returned result can also include the relevancy scores for the documents whose references are being supplied to the metasearch engine. [0061] An exemplary embodiment of this technique is presented hereinafter with reference to one example of the typical scoring methodology previously described. In the first phase, the search parameters transmitted at step 20 comprise a set of terms j1, j2, j3 . . . , that appear in the query presented by the user. In the second phase, each search engine returns the collection size ni, the local mean document length mdli, and, for each term j in the query, the document frequency dfij. [0062] In the third phase, the metasearch engine sums the ni values over i to compute the total collection size N. It computes the mean document MDL as a weighted mean of the local mean document lengths mdli, e.g., MDL=[Σ(ni*mdli)]/N. For each term j in the query, it sums the dfij values over i to compute DFj. From these quantities it computes the vector representation of the query, rq. It disseminates the vector query, N, MDL, and every DFj to each search engine along with the original query. Of particular significance, it is only necessary to disseminate those statistics that are needed for the correct calculation of document scores, namely the statistics for those terms j that appear in the query. Relative to other metasearch techniques that require statistics for every term in the collection, or every term that appears within documents matching the query, the present invention achieves a significant savings in communication overhead. [0063] In the fourth phase, each search engine produces the following parameters for each document k. It computes or fetches a cached value of dlk, and for each term j, the term frequency tfjk. From DFj, tfjk, dlk, and MDL it computes the vector representation of each document, and hence the score of each document against the query and entire metacollection. The statistics that are disseminated enable the same scoring results to be achieved as those which are attainable through a central indexing approach. [0064] In search engines and metasearch engines, it is often desirable to normalize scores, to remove the effects of false differentiators. In the foregoing example, the mean document length MDL is employed as the normalization parameter NP for the computation of the vector representation. Thus, the scores of the documents are normalized across the collections in accordance with the mean document length MDL for the metacollection. When the scores are not normalized in accordance with document length, the rankings could be biased toward longer documents, if the lengths of the documents vary significantly across the collections. Hence, this normalization can be employed to provide more exact results over the entire metacollection. [0065] Other parameters that are based on document-level statistics can also be employed in lieu of, or in addition to, document length as a normalization parameter. One example is tfmax, the number of times the most frequent term in the document appears in that document. Another example is the number of unique terms in a document. Other document-level statistics will be apparent as suitable normalization factors as well. [0066] For the ranking computed in phase four to be mathematically correct, IDF is preferably identical at all search engines. One way to accomplish this objective is to compute IDF from DF at the metasearch engine, to thereby guarantee that it will be identical at all of the search engines. However, to provide greater flexibility and provide the ability to accommodate search engines from different vendors, it may be preferable to compute IDF from DF at the individual search engines, rather than at the metasearch engine. In many installations, where metasearch techniques are employed across search engines of diverse origin, the procedures for computing IDF may vary in some details. For most practical purposes, such minor variations are acceptable within the context of the present invention. Furthermore, by computing IDF at the search engine, the conversion of independent variables into dependent variables occurs at a later stage of the process, so that the original data remains intact and available throughout a greater part of the process. [0067] For similar reasons, it may be preferable to calculate other values at the individual search engines, rather than at the metasearch engine. For instance, since the vector representation of the query, rq, is a dependent variable, like IDF, it is a good candidate for such distributed calculation. [0068] In one embodiment of the invention, the query string that is entered by the user can be parsed at the metasearch engine, and each term in the parsed query is transmitted to the search engines during phase one. In a metasearch, however, practical difficulties can arise when different search engines parse the same query string differently. For example, an English language search engine finds word breaks at spaces, whereas a French language search engine is sensitive to contracted articles. Thus, the query “1'enfant” would be parsed by the English language search engine as one word, whereas the French language search engine would parse it as two words. To accommodate for such differences, in the practice of the invention, query parsing is preferably delayed until phase two, and hence occurs at the individual search engines according to their own parsing conventions. In phase three, each search engine returns collection-level statistics together with the parse results in the form of a character offset and length for each term. [0069] In a simple implementation, each distinct combination of character offset and length could be treated as separate terms. Thus, in the preceding example, the term “1'enfant” as identified by the English language search engine would be regarded as distinct from the terms “1'” and “enfant” as identified by the French language search engine. In a more preferred embodiment, the metasearch engine identifies specific matches between differently parsed terms that are co-located in the query string, and aggregates statistics accordingly. For example, the metacollection-level statistics for “enfant” would include the collection-level statistics for “enfant” from the French search engine and those for “1'enfant” from the English one. Similarly, the metacollection-level statistics for “1'enfant” would include collection-level statistics for “1'enfant” from the English search engine and those for “enfant” from the French one, assuming that “enfant” is less common than “1'”. [0070] The fundamental procedure of the present invention comprises four phases consisting of two request-response pairs. Depending upon the particular implementation, either or both of the request-response pairs might itself comprise plural request-response cycles which are carried out to perform the function of one or more phases of the process, as described hereinafter. In addition, other steps can be included with the fundamental phases to enhance the practicality and value of the metasearch process. Some of these enhancements are set forth below, and depicted in the expanded flow chart of FIG. 4. [0071] As one feature of the invention, phase two may include an additional step 21 of filtering from the collection all documents that do not satisfy a given Boolean condition. The Boolean condition underlying the filter may include arbitrary complex functions that employ non-Boolean operators, as long as the result definitively specifies each document's inclusion or exclusion in the collection to be considered. Examples of such operators include concept matching, usage statistics, database selection, and the like. The Boolean condition can be specified together with the search parameters during phase one, or it may have been established prior to sending the query, in which case it need not be explicitly specified. It may be used to accomplish a variety of practical aims. In the case of a keyword-based query, for example, the Boolean filter can eliminate from consideration any documents with no chance of entering the result set or affecting the collection-level statistics. For example, a Boolean filter can be employed to cull out all documents in a collection that do not contain any of the terms in the query. As another example, the filter might be used to exclude any documents that possess or lack some attribute of exogenous origin, such as having been paid for by the user. [0072] The remaining phases of the process operate on the subset of the collection that survives the Boolean search. Of particular significance is the fact that the Boolean filtering takes place prior to the computation of the statistics that are used to determine relevancy scores for the documents. The collection which remains under consideration after the filtering could generate significantly different local statistics from those which would be generated from the original collection as a whole. For instance, in a search for “water irrigation” a Boolean filter could be used to exclude all documents that do not contain either of the terms “water” or irrigation”. Within the remaining set, it is likely that most of the documents will contain the word “water”, since irrigation normally deals with water. As a result, the term “water” will likely have a very low IDF, whereas its IDF in the full collection, or metacollection, could be much larger. Hence, the dynamic computation of the local statistics at the time that a query is received provides more reliable results than pre-query computation of a fixed set of statistics for a collection, particularly when Boolean filtering is used to modify the collection. [0073] In another aspect of the invention, the third phase can include a further step 25 of assigning a key to each document and sorting results within each collection. The sort criterion can be any suitable value-based key, such as the relevancy score itself, or some other attribute such as alphabetically by author name, or temporally by modification date. The metacollection-level sort performed in the fourth phase is then accomplished via a multi-way merge sort that is itself known in the art. Thus, the system performs a distributed sort, avoiding the need to incur the high network costs associated with central ranking. [0074] In a further extension of this feature of the invention, network traffic generated by the merge sort is minimized by “chunking” the result set, i.e., by dividing it into subsets of fixed size L, and passing those subsets only as needed (step 27). Numerous web-based search engines employ a form of chunking at the user-interface level, by displaying results to the user in groups of ten or twenty at a time. The present invention employs chunking at the level of data transfer from each search engine to the metasearch engine in phase four. For example, in response to a user-interface request for the first ten documents, the metasearch engine can request only ten of the sorted document references from each search engine at a time (step 29). [0075] This chunking mechanism avoids undue communication between the search engines and the metasearch engine. Referring to FIG. 5, in response to the user's query, the metasearch engine requests the K highest-ranked document references, e.g. the first ten in the sorted order, from each search engine (step 30), and stores the references in a cache memory. The documents from all of the search engines are then merged in sorted order, in accordance with their relevancy rankings (step 32), and the top M merged documents are returned to the requesting entity, e.g. displayed to the user, at step 34. When the user requests the next group of N documents (step 35), the metasearch engine retrieves N documents one by one from its cache (step 36). For each document that is retrieved, the metasearch engine determines if that document is the lowest-ranked document that has been returned by one of the search engines (step 37). If so, the next ranked group of K documents is requested from the corresponding search engine at step 38, and added to the cache. Once all of the necessary documents are stored in the cache, the highest-ranked N document references that have not yet been displayed are presented to the user, at step 39. [0076] As an illustrative example, if K=M=N=5, when the first five document references from each of three search engines are merged and sorted, the documents from Engine A may have rankings of 1, 3, 4, 6 and 8, those of Engine B may be ranked 2, 7, 10, 13 and 15, while those from Engine C are ranked 5, 9, 11, 12 and 14. In response to the initial query, ranked documents 1-5 are displayed to the user. In response to a request for the next five documents, the metasearch engine determines at step 36 that all of the remaining documents from Engine A, namely the documents that are ranked 6 and 8, are needed to fulfill the request. In this case, the metasearch engine requests the next five documents from Engine A, to account for the fact that some or all of these additional documents may have a score which is higher than that of cached document 9 from Engine C and/or document 10 from Engine B. However, no additional documents are requested from Engines B or C, since they each contributed cached documents that are not needed to fulfill the user's current request (ranked documents 11-15). Thus, network traffic is minimized by utilizing the distributed sort technique in combination with the chunking of documents, so that transmissions to the metasearch engine only occur as needed. [0077] In the foregoing example, the number of documents that are presented to the user is equal to the chunk size. However, this need not be the case. Rather, it is possible for the number of documents M that is initially presented to the user to be greater or less than the number of documents K that are sent in each chunk. Similarly, the number of documents N that are displayed to the user in response to a request for additional documents could be different from either of the values for M and K. In such a case, however, the foregoing technique can still be utilized to determine when additional chunks of document references are required from each search engine, and thereby minimize network bandwidth utilization. [0078] To accomplish the merge sort with minimal code complexity and maximum implementation flexibility, in accordance with another variant of the invention the protocol between the metasearch engine and the search engine can employ an abstract iterator together with a value-based sort key. An abstract iterator is well known to software engineers as a uniform interface to a variety of dissimilar data structures such as the array, linked list, and doubly linked list. Such data structures differ in the operations they support. For example, an array supports direct access to the k'th element, whereas the other two do not. An abstract iterator provides the smallest set of common operators, such as “move to first element”, “move to next element”, and “test for last element”. Thus, an abstract iterator permits the implementation of a data structure to be changed without affecting the code that uses the data structure. [0079] Referring to FIG. 6, abstract iterators are employed in the present invention at three locations, and each may be associated with a cache in memory or on disk. The iterators at the three locations respectively comprise a metasearch iterator 40, remote search iterators 42, and local search iterators 44. The two fundamental operators in each such iterator are “initialize” and “return next K elements”, where K is a whole number. The behavior of each iterator is defined by its response to these two operators. For clarity of exposition, termination conditions are not described, as they are readily understood by the skilled software engineer. [0080] The metasearch iterator 40 performs the multi-way merge sort. It contains a cache having one memory cell associated with each remote search iterator. Upon initialization, it fills each cell in its cache with the highest ranking document reference from the associated remote search iterator. When requested to return the next element, it returns the highest ranking document reference in its cache and replaces the contents of the vacated cell with the next highest ranking document reference from the associated remote search iterator. When requested to return the next K elements, it returns the next element K times. [0081] The remote search iterator 42 is designed according to a tradeoff between memory consumption at the metasearch engine, the number of request-response cycles invoked between metasearch engine and search engine, and the total network bandwidth consumed. If it contains no cache, it simply passes all requests directly to its associated local search iterator. If it does contain a cache, the cache may be of fixed or unlimited size. Upon initialization, it fills its cache with the highest-ranking document references from its associated local search iterator. When requested to return the next element, it returns the highest ranking document reference in its cache. If the cache is empty, it first fills its cache with the next highest ranking document references from its associated local search iterator. When requested to return the next K elements, it performs the corresponding logic K times, but using only one request via the network. [0082] The local search iterator 44 is designed according to a tradeoff between memory consumption and processing burden at the search engine. If it contains a cache, then the cache may be of fixed or unlimited size. Upon initialization it scores and sorts all documents in the collection, subject to any Boolean filtering; then it fills its cache with the highest ranking document references from its associated collection. When requested to return the next K elements, it serves the responses from its cache. If the cache is exhausted, or if the iterator is designed without a cache, then the local search iterator reinitializes and discards as many of the highest ranking document references as it has already returned. [0083] In a preferred embodiment of the invention, the local search iterator contains a cache of unlimited size. The remote iterator contains a cache of fixed size, which corresponds to the chunk size, i.e., a fixed number of document references fetched upon each request. [0084] The use of value-based sort keys provides further benefits in the context of statelessness. In this further aspect of the invention, each search engine is stateless but cached. From the foregoing description it can be seen that each search engine responds to multiple requests in the course of servicing a single query. In particular, the four fundamental phases of operation are divided into two cycles of response and request, and the second cycle might itself involve multiple request-response cycles if the local sorting and chunking techniques are employed. The response to each request depends on results from previous requests. [0085] Statelessness refers to the capability of the search engine to respond correctly to each request even if it has no memory of previous requests. The benefits of statelessness are known in the field of Internet protocols, for example. They include reduced exposure to memory overflows, resource interchangeability for purposes of scaling and load balancing, and greatly reduced complexity in implementing hierarchical topologies. Caching refers to the use of memory to avoid recomputations whenever memory capacity allows. The present invention accomplishes these goals by means of value-based sort keys in combination with collection-level caches. The cache stores the original query, the list of Boolean results computed in phase one, the metacollection-level statistics disseminated in phase two, and the scores and sort order computed in phase three. [0086] As an illustrative example, the metasearch engine can increment an iterator, resulting in an indication that it requires more results from a particular search engine. Upon detecting this condition, it sends the metacollection-level statistics to that search engine together with the current value-based sort key. If the search engine finds no cache corresponding to the given query, it re-executes the query and sorts the results to refill the cache. It seeks to the correct position in the cache using the value-based sort key and returns the next chunk of results. The term “value-based” implies that the sort key contains only data computed from the query and document, such as its score or a representation of its metadata. Thus, the seek operation works correctly even if documents are added to or removed from the collection. [0087] The protocol that is employed in the context of the present invention enables a metasearch engine to be treated as a search engine within a larger metasearch, in accordance with another aspect of the invention. More particularly, the metacollection-level statistics N, MDL, and DFj that are generated in a smaller metasearch can form intermediate level statistics that are treated as the collection-level statistics ni, mdli, and dfij in the context of a larger metasearch. In other words, whether a particular search engine is delivering local statistics for a single collection or global statistics for a subsidiary metasearch is inconsequential to the higher-level search engine that is receiving those statistics. By employing this concept in a recursive manner, engines can be arranged in a hierarchy, as illustrated in FIG. 7, so as to permit a query to incorporate the metasearch engine, its neighbors, the neighbors of its neighbors, and so forth. [0088] Referring to the figure, local search engines 12 perform searches on their respective collections 14, and report local statistics ni, mdli and dfi to associated intermediate engines 50 during phase two. These intermediate engines process the local statistics in the same manner as the metasearch engine to produce intermediate statistics, e.g. semi-global values. These intermediate statistics are then forwarded to a higher level engine, in this case the metasearch engine 10, which processes them to compute the global statistics. During phase three, these global statistics are transmitted to the intermediate engines 40, which in turn forward them to the local search engines 12. The local search engines utilize the global statistics to score the documents, and report the scores to the intermediate engines 40 during phase four. The intermediate engines merge the scores from their associated search engines, and forward them to the metasearch engine 10, which performs the final merge and display to the user. [0089] This ability to arrange the search engines among multiple tiers us particularly advantageous in the case of geographically distributed collections. When the root node of a hierarchy is separated from a leaf node by multiple network links, the properties of chunked sorting and statelessness become especially valuable in reducing latency, memory overhead, and overall code complexity. More particularly, the ranking of documents and transmission of partial results, utilizing chunking, can be carried out at both the local search engines and the intermediate engines, to thereby minimize network traffic. Each intermediate engine merges the lists of documents that it receives from its associated search engines, and then sends the top-ranked chunks of the merged list to the metasearch engine as necessary. [0090] From the foregoing, therefore, it can be seen that the present invention provides a metasearch technique in which local and global statistics are dynamically computed in response to a received query, through multiple request-response cycles between the metasearch engine and the individual search engines. Through this technique, precision and recall are both maximized, while at the same time minimizing network traffic, and thereby reducing latency. Furthermore, the manner in which local and global statistics are computed and calculated enables the architecture of the metasearch system to be implemented in any desirable number of hierarchical tiers, thereby providing the ability to scale the system to accommodate any number and configuration of document collections. [0091] It will be appreciated by those of ordinary skill in the art that the present invention can be implemented in other forms without departing from spirit or essential characteristics thereof. For instance, the invention is not limited to searching over text documents. The techniques described herein apply to any kind of ranked search that uses ranking criteria that depend on metacollection-level statistics. [0092] The presently disclosed embodiments are therefore considered in all respects to be illustrative and not restrictive. The scope of the invention is indicated by the appended claims rather than the foregoing description, and all changes that come within the meaning and range of equivalents thereof are intended to be embraced therein. Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS5265244 *Jun 22, 1990Nov 23, 1993International Business Machines CorporationMethod and system for facilitating processing of statistical inquires on stored data accessible through a data access structureUS5642502 *Dec 6, 1994Jun 24, 1997University Of Central FloridaMethod and system for searching for relevant documents from a text database collection, using statistical ranking, relevancy feedback and small pieces of textUS5806061 *May 20, 1997Sep 8, 1998Hewlett-Packard CompanyMethod for cost-based optimization over multimeida repositoriesUS6029195 *Dec 5, 1997Feb 22, 2000Herz; Frederick S. M.System for customized electronic identification of desirable objectsUS6070158 *Nov 13, 1997May 30, 2000Infoseek CorporationReal-time document collection search engine with phrase indexingUS6078924 *Jan 30, 1998Jun 20, 2000Aeneid CorporationMethod and apparatus for performing data collection, interpretation and analysis, in an information platformUS6163782 *May 14, 1998Dec 19, 2000At&T Corp.Efficient and effective distributed information managementUS6212517 *Jun 30, 1998Apr 3, 2001Matsushita Electric Industrial Co., Ltd.Keyword extracting system and text retrieval system using the sameUS6553310 *Nov 14, 2000Apr 22, 2003Hewlett-Packard CompanyMethod of and apparatus for topologically based retrieval of information* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS7219090 *Apr 25, 2003May 15, 2007Overture Services, Inc.Method and system for blending search engine results from disparate sources into one search resultUS7257577 *May 7, 2004Aug 14, 2007International Business Machines CorporationSystem, method and service for ranking search results using a modular scoring systemUS7281005Oct 20, 2003Oct 9, 2007Telenor AsaBackward and forward non-normalized link weight analysis method, system, and computer program productUS7412494 *Feb 27, 2004Aug 12, 2008Sap AgMerging partial query results into a single resultUS7424469 *Jan 7, 2004Sep 9, 2008Microsoft CorporationSystem and method for blending the results of a classifier and a search engineUS7469248 *May 17, 2005Dec 23, 2008International Business Machines CorporationCommon interface to access catalog information from heterogeneous databasesUS7493320Aug 16, 2004Feb 17, 2009Telenor AsaMethod, system, and computer program product for ranking of documents using link analysis, with remedies for sinksUS7519575 *Aug 31, 2001Apr 14, 2009Novell, Inc.Method and apparatus for presenting, searching, and viewing directoriesUS7562069Dec 29, 2004Jul 14, 2009Aol LlcQuery disambiguationUS7565362 *Jul 1, 2005Jul 21, 2009Microsoft CorporationApplication programming interface for text mining and searchUS7571157Dec 29, 2004Aug 4, 2009Aol LlcFiltering search resultsUS7617192Mar 9, 2006Nov 10, 2009Medio Systems, Inc.Method and system for capability content search with mobile computing devicesUS7664738 *Dec 7, 2005Feb 16, 2010Canon Kabushiki KaishaSearch system, information processing apparatus, control method therefor, and programUS7693834 *Dec 6, 2004Apr 6, 2010Snap Technologies, Inc.Search engine that dynamically generates search listingsUS7765219 *Feb 24, 2005Jul 27, 2010Microsoft CorporationSort digits as number collation in serverUS7801911 *Jun 11, 2004Sep 21, 2010Seisint, Inc.System and method for using activity identifications in a database systemUS7818314 *Dec 29, 2004Oct 19, 2010Aol Inc.Search fusionUS7853589 *Apr 30, 2007Dec 14, 2010Microsoft CorporationWeb spam page classification using query-dependent dataUS7873650Jun 11, 2004Jan 18, 2011Seisint, Inc.System and method for distributing data in a parallel processing systemUS8005813Sep 12, 2007Aug 23, 2011Aol Inc.Domain expert searchUS8051094 *Oct 12, 2008Nov 1, 2011International Business Machines CorporationCommon interface to access catalog information from heterogeneous databasesUS8117215 *Sep 24, 2010Feb 14, 2012Hewlett-Packard Development Company, L.P.Distributing content indicesUS8135737Mar 24, 2008Mar 13, 2012Aol Inc.Query routingUS8266234Jun 11, 2004Sep 11, 2012Seisint, Inc.System and method for enhancing system reliability using multiple channels and multicastUS8306964 *Jul 20, 2010Nov 6, 2012Microsoft CorporationExtraction of rich search information from index servers via an alternative asynchronous data pathUS8341147 *May 11, 2011Dec 25, 2012Google Inc.Blending mobile search resultsUS8370332Jan 18, 2011Feb 5, 2013Google Inc.Blending mobile search resultsUS8521713Jul 11, 2011Aug 27, 2013Microsoft CorporationDomain expert searchUS8572100 *Dec 15, 2004Oct 29, 2013Nigel HamiltonMethod and system for recording search trails across one or more search engines in a communications networkUS8768908Apr 17, 2009Jul 1, 2014Facebook, Inc.Query disambiguationUS8793246Mar 8, 2013Jul 29, 2014Fmr LlcIdentifying ranking scores for domains of interestUS8886629Apr 26, 2004Nov 11, 2014Mark A. BluhmDistributed search methods, architectures, systems, and softwareUS9058395Apr 23, 2012Jun 16, 2015Microsoft Technology Licensing, LlcResolving queries based on automatic determination of requestor geographic locationUS9183250Sep 14, 2012Nov 10, 2015Facebook, Inc.Query disambiguationUS9189554 *May 4, 2015Nov 17, 2015Google Inc.Providing images of named resources in response to a search queryUS9213702 *Dec 13, 2013Dec 15, 2015National Cheng Kung UniversityMethod and system for recommending research information newsUS9292509 *Aug 8, 2014Mar 22, 2016Google Inc.Supplementing search results with information of interestUS9405808 *Feb 28, 2012Aug 2, 2016Google Inc.System and method for analyzing data recordsUS9411827Oct 15, 2015Aug 9, 2016Google Inc.Providing images of named resources in response to a search queryUS20040143644 *Apr 1, 2003Jul 22, 2004Nec Laboratories America, Inc.Meta-search engine architectureUS20040215607 *Apr 25, 2003Oct 28, 2004Travis Robert L.Method and system fo blending search engine results from disparate sources into one search resultUS20050086260 *Oct 20, 2003Apr 21, 2005Telenor AsaBackward and forward non-normalized link weight analysis method, system, and computer program productUS20050114306 *Nov 20, 2003May 26, 2005International Business Machines CorporationIntegrated searching of multiple search sourcesUS20050131884 *Dec 6, 2004Jun 16, 2005William GrossSearch engine that dynamically generates search listingsUS20050149504 *Jan 7, 2004Jul 7, 2005Microsoft CorporationSystem and method for blending the results of a classifier and a search engineUS20050193088 *Feb 27, 2004Sep 1, 2005Jens-Peter DittrichMerging partial query results into a single resultUS20050262050 *May 7, 2004Nov 24, 2005International Business Machines CorporationSystem, method and service for ranking search results using a modular scoring systemUS20060101037 *Jul 1, 2005May 11, 2006Microsoft CorporationApplication programming interface for text mining and searchUS20060122986 *Dec 7, 2005Jun 8, 2006Canon Kabushiki KaishaSearch system, information processing apparatus, control method therefor, and programUS20060143159 *Dec 29, 2004Jun 29, 2006Chowdhury Abdur RFiltering search resultsUS20060173817 *Dec 29, 2004Aug 3, 2006Chowdhury Abdur RSearch fusionUS20060190452 *Feb 24, 2005Aug 24, 2006Microsoft CorporationSort digits as number collation in serverUS20060242017 *Mar 9, 2006Oct 26, 2006Medio Systems, Inc.Method and system of bidding for advertisement placement on computing devicesUS20060248062 *Mar 9, 2006Nov 2, 2006Medio Systems, Inc.Method and system for content search with mobile computing devicesUS20060248081 *Apr 17, 2006Nov 2, 2006Francis LamyColor selection method and systemUS20060265385 *May 17, 2005Nov 23, 2006International Business Machines CorporationCommon interface to access catalog information from heterogeneous databasesUS20060287980 *Jun 21, 2005Dec 21, 2006Microsoft CorporationIntelligent search results blendingUS20070022096 *Jul 22, 2005Jan 25, 2007Poogee Software Ltd.Method and system for searching a plurality of web sitesUS20070106671 *Mar 16, 2006May 10, 2007Fujitsu LimitedComputer-readable recording medium storing data collection program and data collection apparatusUS20080059456 *Sep 12, 2007Mar 6, 2008Aol Llc, A Delaware Limited Liability Company (Formerly Known As America Online, Inc.)Domain Expert SearchUS20080172368 *Mar 24, 2008Jul 17, 2008Aol LlcQuery routingUS20080270376 *Apr 30, 2007Oct 30, 2008Microsoft CorporationWeb spam page classification using query-dependent dataUS20090030876 *Jan 23, 2004Jan 29, 2009Nigel HamiltonMethod and system for recording search trails across one or more search engines in a communications networkUS20090037391 *Oct 12, 2008Feb 5, 2009International Business Machines CorporationCommon Interface to Access Catalog Information from Heterogeneous DatabasesUS20090222444 *Apr 17, 2009Sep 3, 2009Aol LlcQuery disambiguationUS20090265391 *Apr 16, 2009Oct 22, 2009Hong Fu Jin Precision Industry (Shenzhen) Co., Ltd.Apparatus and method for managing network storageUS20110016128 *Sep 24, 2010Jan 20, 2011Forman George HDistributing content indicesUS20110119260 *Jan 18, 2011May 19, 2011Google Inc.Blending mobile search resultsUS20110213772 *May 11, 2011Sep 1, 2011Google Inc.Blending Mobile Search ResultsUS20120023093 *Jul 20, 2010Jan 26, 2012Microsoft CorporationExtraction of rich search information from index servers via an alternative asynchronous data pathUS20120215787 *Feb 28, 2012Aug 23, 2012Pike Robert CSystem and Method for Analyzing Data RecordsUS20130110566 *Jul 12, 2012May 2, 2013Luís Miguel SOUSA SOBRALEvaluation tool and processUS20150169563 *Dec 13, 2013Jun 18, 2015National Cheng Kung UniversityMethod and system for recommending research information newsUS20150169564 *Aug 8, 2014Jun 18, 2015Google Inc.Supplementing search results with information of interestCN103902720A *Apr 10, 2014Jul 2, 2014北京博雅立方科技有限公司Method and device for acquiring expansion words of keywordsWO2004097570A3 *Apr 23, 2004Jan 13, 2005Overture Services IncMethod and system for blending search engine results from disparate sources into one search resultWO2004097685A2 *Apr 26, 2004Nov 11, 2004Thomson Global ResourcesDistributed search methods, architectures, systems, and softwareWO2004097685A3 *Apr 26, 2004Feb 10, 2005Thomson CorpDistributed search methods, architectures, systems, and softwareWO2006096838A1 *Mar 9, 2006Sep 14, 2006Medio Systems, Inc.Method and system for content search with mobile computing devices* Cited by examinerClassifications U.S. Classification1/1, 707/E17.108, 707/999.003International ClassificationG06F17/30Cooperative ClassificationY10S707/99933, G06F17/30864European ClassificationG06F17/30W1Legal EventsDateCodeEventDescriptionOct 15, 2001ASAssignmentOwner name: NEXTPAGE, INC., UTAHFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:BARNETT, RUSSELL CLARK;REEL/FRAME:012262/0534Effective date: 20010731Oct 7, 2004ASAssignmentOwner name: FAST SEARCH & TRANSFER ASA, NORWAYFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:NEXTPAGE, INC.;REEL/FRAME:015224/0955Effective date: 20040903Mar 31, 2008REMIMaintenance fee reminder mailedApr 18, 2008SULPSurcharge for late paymentApr 18, 2008FPAYFee paymentYear of fee payment: 4Dec 11, 2009ASAssignmentOwner name: FAST SEARCH & TRANSFER AS, NORWAYFree format text: CHANGE OF NAME;ASSIGNOR:FAST SEARCH & TRANSFER ASA;REEL/FRAME:023639/0125Effective date: 20080625Owner name: FAST SEARCH & TRANSFER AS,NORWAYFree format text: CHANGE OF NAME;ASSIGNOR:FAST SEARCH & TRANSFER ASA;REEL/FRAME:023639/0125Effective date: 20080625Jul 8, 2010ASAssignmentOwner name: MICROSOFT INTERNATIONAL HOLDINGS, B.V., NETHERLANDFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:FAST SEARCH & TRANSFER AS;REEL/FRAME:024651/0114Effective date: 20100706Aug 25, 2010ASAssignmentOwner name: MICROSOFT INTERNATIONAL HOLDINGS B.V., NETHERLANDSFree format text: CORRECTIVE ASSIGNMENT TO CORRECT THE ASSIGNEE NAME TO REMOVE THE COMMA PREVIOUSLY RECORDED ON REEL024651 FRAME 0114. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT;ASSIGNOR:FAST SEARCH & TRANSFER AS;REEL/FRAME:024879/0512Effective date: 20100706Sep 22, 2011FPAYFee paymentYear of fee payment: 8Mar 9, 2016FPAYFee paymentYear of fee payment: 12RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services

value: This website is a search engine provided by Google. Handling over 3.5 billion searches per day, it has a 92% share of the global search engine market.


text:
Cheap flights from Faroe Islands to Antalya [FAE - ANK] - TripAdvisor
Cheap flights from Faroe Islands (FAE) to Antalya Europe Turkey Turkish Mediterranean Coast Antalya Province Antalya Antalya Flights
Cheap flights from Faroe Islands to AntalyaRound TripOne-wayMulti-city 08/11/201708/18/2017 08/11/2017 08/11/2017 Economy Premium Economy Business Class First Class Prefer nonstop 1 Person Adults (18-64) -1+Seniors (65+) -0+Children (0-17) -0+*Specify the age of each child at the time of travel. Age ? Age ? < 11234567891011121314151617Child 1 Age ? Age ? < 11234567891011121314151617Child 2 Age ? Age ? < 11234567891011121314151617Child 3 Age ? Age ? < 11234567891011121314151617Child 4 Age ? Age ? < 11234567891011121314151617Child 5 Close More OptionsEconomy Premium Economy Business Class First Class Prefer nonstop Include nearby airports My dates are flexibleLESSGet an alert when prices drop. Get an alert when Faroe Islands to Ankara prices drop. Search Flights Browse Airline Reviews
About TripAdvisor Flights Your one-stop shop for finding the best flights from Faroe Islands to Antalya. Simply tell us where and when you want to travel and we'll do all the legwork for you. Featuring the most powerful shopping tools on the web, we search the largest online travel websites, established airfare discounters, plus the world's leading airlines and low-cost carriers to bring back thousands of flight options. 1 Traveler
Travel information for Faroe Islands to Antalya
Faroe Islands is 2253 miles from Antalya
Copenhagen, Denmark - Copenhagen Airport is the most popular connection for one stop flights between Faroe Islands and Antalya
2,025 Reviews best entertainment crew ❤
Cheap flights from Guayaquil to Faroe Islands
Cheap flights from Prague to Faroe Islands

type: global

value: This website is an American online travel company that operates a website and mobile app with user-generated content and a comparison shopping website.


text:
Words that end in ercain | Words ending in ercain
http://www.thefreedictionary.com/words-that-end-in-ercain
Dictionary, Encyclopedia and Thesaurus - The Free Dictionary 10,535,834,457 visitors served
Words that end in ercain
Found 1 words that end in ercain. Browse our Scrabble Word Finder, Words With Friends cheat dictionary, and WordHub word solver to find words that end with ercain. Or use our Unscramble word solver to find your best possible play! Related: Words containing ercain
7-letter words that end in ercainSee also
7-letter words that end in ercain

value: This website is an American online dictionary and encyclopedia that aggregates information from various sources.


text:
Learning Systems, Software & Books (132)
Free store pickupas soon as 5/30with •Free store pickupas soon as 5/30with LeapFrog LeapReader 3D Book Disney Pixar Monsters University (w…
Free store pickupas soon as todaywith •Free store pickupas soon as 5/30with Teaches vocabulary and reading skillsMakes learning to read exciting and fun
Free store pickupas soon as todaywith •Free store pickupas soon as 5/30with Items 65-

value: This website is an American multinational retail corporation that operates a chain of hypermarkets , discount department stores, and grocery stores from the United States, headquartered in Bentonville, Arkansas.


text:
Eyes on the prize. : Vol. 3, Mississippi : is this America? (1962-1964). Bridge to freedom (1965) America's civil rights movement (vis-dvd, 2006) [WorldCat.org]
<http://www.worldcat.org/oclc/75386809>library:oclcnum"75386809"library:placeOfPublication<http://id.loc.gov/vocabulary/countries/vau>rdf:typeschema:Countrylibrary:placeOfPublicationrdf:typeschema:Placeschema:name"Alexandria, Va."owl:sameAs<info:oclcnum/75386809>rdf:typej.1:DVDrdf:typej.1:Videordfs:seeAlso<http://www.worldcat.org/title/-/oclc/75386809>rdf:typej.0:InformationResourcerdf:typej.0:ContentTypeGenericResourceschema:about<http://www.worldcat.org/oclc/75386809>void:inDataset<http://purl.oclc.org/dataset/WorldCat>schema:aboutrdf:typeschema:Intangibleschema:name"African Americans--History--20th century."schema:sameAs<http://id.loc.gov/authorities/subjects/sh85001955>schema:about<http://id.worldcat.org/fast/799575>rdf:typeschema:Intangibleschema:name"African Americans--Civil rights"schema:aboutrdf:typeschema:Intangibleschema:name"Civil rights--United States."schema:sameAs<http://id.loc.gov/authorities/subjects/sh85026377>schema:aboutrdf:typeschema:Placeschema:name"United States"schema:about<http://id.worldcat.org/fast/799558>rdf:typeschema:Intangibleschema:name"African Americans"schema:about<http://id.worldcat.org/fast/862704>rdf:typeschema:Intangibleschema:name"Civil rights demonstrations"schema:aboutrdf:typeschema:Intangibleschema:name"African Americans--Suffrage--History--20th century."schema:sameAs<http://id.loc.gov/authorities/subjects/sh85001993>schema:aboutrdf:typeschema:Intangibleschema:name"Segregation--United States--History."schema:sameAs<http://id.loc.gov/authorities/subjects/sh00009936>schema:aboutrdf:typeschema:Intangibleschema:name"Civil rights demonstrations--United States--History--20th century."schema:sameAs<http://id.loc.gov/authorities/subjects/sh91003251>schema:about<http://id.worldcat.org/fast/799713>rdf:typeschema:Intangibleschema:name"African Americans--Suffrage"schema:about<http://dewey.info/class/323.1196/a14/>rdf:typeschema:Intangibleschema:about<http://dewey.info/class/323.1196073/e22/>rdf:typeschema:Intangibleschema:aboutrdf:typeschema:Intangibleschema:name"African Americans--Civil rights--History--20th century."schema:sameAs<http://id.loc.gov/authorities/subjects/sh2007100199>schema:about<http://id.worldcat.org/fast/862627>rdf:typeschema:Intangibleschema:name"Civil rights"schema:about<http://id.worldcat.org/fast/1111205>rdf:typeschema:Intangibleschema:name"Segregation"schema:aboutrdf:typeschema:Placeschema:name"United States"schema:sameAs<http://id.worldcat.org/fast/1204155>schema:bookEdition"Full screen."schema:contentRating"MPAA rating: PG."schema:contributor<http://viaf.org/viaf/267382702>rdf:typeschema:Organizationschema:name"PBS Video."schema:sameAs<http://id.loc.gov/authorities/names/n81062763>schema:contributor<http://viaf.org/viaf/154781329>rdf:typeschema:Organizationschema:name"Blackside, Inc."schema:sameAs<http://id.loc.gov/authorities/names/n81095470>schema:contributor<http://viaf.org/viaf/119072424>rdf:typeschema:Personschema:name"Bond, Julian, 1940-"schema:sameAs<http://id.loc.gov/authorities/names/n84011307>schema:contributor<http://viaf.org/viaf/110971828>rdf:typeschema:Personschema:name"Hampton, Henry, 1940-1998."schema:sameAs<http://id.loc.gov/authorities/names/n88292480>schema:datePublished"2006"schema:description"Bridge to freedom (1965) : When civil rights protesters marching from Selma to Montgomery, Alabama were assaulted by police, national outrage over the brutality led to President Johnson providing the protection of federal troops, and ultimately to the Voting Rights Act of 1965."schema:description"Mississippi : is this America? (1962-1964) : Focuses on the right to vote. Tells how the black citizens who had been denied the right to vote stepped forward and demanded a place in the political process. Medgar Evers, Michael Schwerner, Andrew Goodman, James Chaney, and others, died trying to help them. Shows the formation of the Mississippi Freedom Democratic Party to challenge the 1964 Democratic Party Convention."schema:exampleOfWork<http://worldcat.org/entity/work/id/61441068>schema:genre"History"schema:inLanguage"en"schema:name"Eyes on the prize. America's civil rights movement"schema:publisherrdf:typeschema:Organizationschema:name"PBS Video"schema:workExample<http://www.worldcat.org/isbn/9780793692576>rdf:typeschema:ProductModelschema:description"v. 3"schema:exampleOfWork<http://www.worldcat.org/oclc/75386809>schema:isbn"9780793692576"schema:sameAs<urn:isbn:9780793692576>schema:workExample<http://www.worldcat.org/isbn/9780793692620>rdf:typeschema:ProductModelschema:description"set"schema:exampleOfWork<http://www.worldcat.org/oclc/75386809>schema:isbn"9780793692620"schema:sameAs<urn:isbn:9780793692620>schema:workExample<http://www.worldcat.org/isbn/0793692571>rdf:typeschema:ProductModelschema:description"v. 3"schema:exampleOfWork<http://www.worldcat.org/oclc/75386809>schema:isbn"0793692571"schema:sameAs<urn:isbn:0793692571>schema:workExample<http://www.worldcat.org/isbn/0793692628>rdf:typeschema:ProductModelschema:description"set"schema:exampleOfWork<http://www.worldcat.org/oclc/75386809>schema:isbn"0793692628"schema:sameAs<urn:isbn:0793692628>Content-negotiable representationsTurtle (text/turtle)JSON-LD (application/ld+json)RDF/XML (application/rdf+xml)N-TRIPLES (text/plain)HTML+RDFa (text/html)

value: This website is a union catalog that itemizes the collections of 15,637 libraries in 107 countries that participate in the OCLC global cooperative. It is operated by OCLC, Inc.


text:
Cleaning Services - Maids-n-heaven, Llc. | Groupon
Two cleaning professionals for one hour’s worth of cleaning service
Was rather late to the appointment, but we got three maids for the price of two. Totally worth it.
Shannon S. · 1 reviews HELPFUL REVIEWER
Very professional, did a fantastic job, will definitely use them again!
Team was friendly and wow my house looks amazing.
A Chat with Maids-N-Heaven
We serve all our customers according to their needs. Our business offers many other services to help take care of the household needs that most people just don’t have the time for.
We know that balancing life is difficult nowadays, and we want to help you make time for what matters most.
There’s nothing better than a homeowner walking into a freshly cleaned room and being satisfied with the service we provided!
“Wow! Thank you so much for the amazing job you both did. We are so pleased with how clean our home is. I don’t think it was even near this great looking when we first moved in. Thank you, thank you, thank you!”
Promotional value expires 120 days after purchase. Amount paid never expires. Appointment required, 48 hour advance notice required. Appointment required. Limit 1 per person, may buy 1 additional as a gift. Limit 1 per household. All goods or services must be used by the same person. Valid only within 20 miles of zip code 55304. May be repurchased every 30 days. Merchant is solely responsible to purchasers for the care and quality of the advertised goods and services.
About Maids-n-heaven, Llc.

value: This website is an American global e-commerce marketplace connecting subscribers with local merchants by offering activities, travel, goods and services in 15 countries. Based in Chicago, Groupon was launched there in November 2008, launching soon after in Boston, New York City and Toronto.


text:
Devtayo Ki Saza Ka Haqdar 13-04-12EditorialStories in Juraat by Aftab Memon
P. 1Devtayo Ki Saza Ka Haqdar 13-04-12EditorialStories in Juraat by Aftab MemonDevtayo Ki Saza Ka Haqdar 13-04-12EditorialStories in Juraat by Aftab MemonRatings: 0|Views: 87|Likes: 1Published by Aftab MemonDevtayo Ki Saza Ka Haqdar 13-04-12Devtayo Ki Saza Ka Haqdar 13-04-12More info:Published by: Aftab Memon on Jun 27, 2012Copyright:Attribution Non-commercialAvailability:Read on Scribd mobile: iPhone, iPad and Android.Free download as PDF, TXT or read online for free from ScribdFlag for inappropriate content|Add to collectionSee MoreSee lesshttp://www.scribd.com/doc/98408896/Devtayo-Ki-Saza-Ka-Haqdar-13-04-12EditorialStories-in-Juraat-by-Aftab-Memon06/27/2012pdftextoriginal Activity (0)FiltersAdd to collectionReviewAdd noteLikeEmbedShowingAllMost RecentReviewsAll NotesLikesYou've already reviewed this. Edit your review.Rating 0/5Post notePost reviewPost replyPost note and likeNo activity yetLoad more
Adha Sach 21-04-12EditorialStories in Juraat by Aftab Memon
Tipu Sultan -Habib Jalib04!05!12EditorialStories
Hawa Ki Beti 07-04-12EditorialStoriesJuraat
Looming Disaster Article by Aftab Memon Business Recorder...
Rekodiq ,Soney Ki Qaan020612
Juraat Editorial 030612
Zabta Faujdari Ke Magistrate (2) 04-06-12EditorialStories
Zabta Faujdari Ke Magistrate 07-06-12EditorialStories
Article in Jurat "Nou Arab Bhokhey" 060612 Editorial Stor...
Her Pal Saleb Tay
Neel Nadee Kinary

value: This website is an American e-book and audiobook subscription service that includes one million titles.


text:
Book Hotel Vier Jahreszeiten Zingst, Zingst, Germany - Hotels.comEnglish (United States)Book online or call 800-246-8357This call is free. 24 hours a day; 7 days a week.HotelsHotel DealsPackages & FlightsGroupsGift CardsHelpWebsite feedbackSign in & AccountSign inCreate an accountYour bookingsTrip PlannerReview a hotelHotels.com® RewardsYour bookingsJump toOverviewRoom choicesMapReviewsHotel informationLowest price: $89Check availability HotelsGermany HotelsZingst HotelsHotel Vier Jahreszeiten ZingstAll hotels in Zingst, Germany1 room, 2 adultsDestination, hotel, landmark or addressCheck inCheck out Rooms123456789+Room 1:Adults12345678Aged 18+Children01230-17Age at check in:Child 1:-?-<11234567891011121314151617SearchYou can collect Hotels.com® Rewards nights hereHotel Vier Jahreszeiten Zingst, Zingst4.5 starsHotelstars Union assigns an official star rating for properties in Germany. This property is rated 4 star Superior and is displayed on this page as 4.5 stars. Boddenweg 2, Zingst, MV, 18374, Germany, 800-491-6126Lowest price$89available on 04/27/17Price may be available on other datesPrice GuaranteePrice Guarantee on hotel bookings. If you find a better price on exactly the same stay, we’ll either match it or give you a coupon. Click below for details.Jump to:OverviewRoom choicesMapReviewsHotel informationInterior EntranceInterior EntranceInterior EntranceInterior EntranceLobbyReceptionReceptionComfort Double Room - GuestroomComfort Double Room - GuestroomComfort Double Room - GuestroomJunior Suite - GuestroomMaisonette - GuestroomJunior Suite - GuestroomMaisonette - GuestroomJunior Suite - Living AreaJunior Suite - Living AreaJunior Suite - BalconyDeep Soaking BathtubDeep Soaking BathtubBathroom SinkIndoor PoolIndoor PoolFitness StudioSpaSpaSpaSpaSaunaSaunaSaunaSaunaSaunaSteam RoomSteam RoomTreatment RoomTreatment RoomTreatment RoomDiningDiningDiningRestaurantRestaurantRestaurantRestaurantBuffetBuffetBuffetFood and DrinkFood and DrinkFood and DrinkFood and DrinkHotel BarFireplaceProperty GroundsHotel FrontHotel FrontHotel FrontHotel Front - Evening/NightHotel Front - Evening/NightGardenOutdoor DiningExteriorExteriorExteriorBalcony View[1/66]Flag this image1 - Hotel Vier Jahreszeiten Zingst, Zingst2 - Hotel Vier Jahreszeiten Zingst, Zingst, Interior Entrance3 - Hotel Vier Jahreszeiten Zingst, Zingst, Interior Entrance4 - Hotel Vier Jahreszeiten Zingst, Zingst, Interior Entrance5 - Hotel Vier Jahreszeiten Zingst, Zingst, Interior Entrance6 - Hotel Vier Jahreszeiten Zingst, Zingst, Lobby7 - Hotel Vier Jahreszeiten Zingst, Zingst, Reception8 - Hotel Vier Jahreszeiten Zingst, Zingst, Reception9 - Hotel Vier Jahreszeiten Zingst, Zingst, Comfort Double Room, Guestroom10 - Hotel Vier Jahreszeiten Zingst, Zingst, Comfort Double Room, Guestroom11 - Hotel Vier Jahreszeiten Zingst, Zingst, Comfort Double Room, Guestroom12 - Hotel Vier Jahreszeiten Zingst, Zingst, Junior Suite, Guestroom13 - Hotel Vier Jahreszeiten Zingst, Zingst, Maisonette, Guestroom14 - Hotel Vier Jahreszeiten Zingst, Zingst, Junior Suite, Guestroom15 - Hotel Vier Jahreszeiten Zingst, Zingst, Maisonette, Guestroom16 - Hotel Vier Jahreszeiten Zingst, Zingst, Junior Suite, Living Area17 - Hotel Vier Jahreszeiten Zingst, Zingst, Junior Suite, Living Area18 - Hotel Vier Jahreszeiten Zingst, Zingst, Junior Suite, Balcony19 - Hotel Vier Jahreszeiten Zingst, Zingst, Deep Soaking Bathtub20 - Hotel Vier Jahreszeiten Zingst, Zingst, Deep Soaking Bathtub21 - Hotel Vier Jahreszeiten Zingst, Zingst, Bathroom Sink22 - Hotel Vier Jahreszeiten Zingst, Zingst, Indoor Pool23 - Hotel Vier Jahreszeiten Zingst, Zingst, Indoor Pool24 - Hotel Vier Jahreszeiten Zingst, Zingst, Fitness Studio25 - Hotel Vier Jahreszeiten Zingst, Zingst, Spa26 - Hotel Vier Jahreszeiten Zingst, Zingst, Spa27 - Hotel Vier Jahreszeiten Zingst, Zingst, Spa28 - Hotel Vier Jahreszeiten Zingst, Zingst, Spa29 - Hotel Vier Jahreszeiten Zingst, Zingst, Sauna30 - Hotel Vier Jahreszeiten Zingst, Zingst, Sauna31 - Hotel Vier Jahreszeiten Zingst, Zingst, Sauna32 - Hotel Vier Jahreszeiten Zingst, Zingst, Sauna33 - Hotel Vier Jahreszeiten Zingst, Zingst, Sauna34 - Hotel Vier Jahreszeiten Zingst, Zingst, Steam Room35 - Hotel Vier Jahreszeiten Zingst, Zingst, Steam Room36 - Hotel Vier Jahreszeiten Zingst, Zingst, Treatment Room37 - Hotel Vier Jahreszeiten Zingst, Zingst, Treatment Room38 - Hotel Vier Jahreszeiten Zingst, Zingst, Treatment Room39 - Hotel Vier Jahreszeiten Zingst, Zingst, Dining40 - Hotel Vier Jahreszeiten Zingst, Zingst, Dining41 - Hotel Vier Jahreszeiten Zingst, Zingst, Dining42 - Hotel Vier Jahreszeiten Zingst, Zingst, Restaurant43 - Hotel Vier Jahreszeiten Zingst, Zingst, Restaurant44 - Hotel Vier Jahreszeiten Zingst, Zingst, Restaurant45 - Hotel Vier Jahreszeiten Zingst, Zingst, Restaurant46 - Hotel Vier Jahreszeiten Zingst, Zingst, Buffet47 - Hotel Vier Jahreszeiten Zingst, Zingst, Buffet48 - Hotel Vier Jahreszeiten Zingst, Zingst, Buffet49 - Hotel Vier Jahreszeiten Zingst, Zingst, Food and Drink50 - Hotel Vier Jahreszeiten Zingst, Zingst, Food and Drink51 - Hotel Vier Jahreszeiten Zingst, Zingst, Food and Drink52 - Hotel Vier Jahreszeiten Zingst, Zingst, Food and Drink53 - Hotel Vier Jahreszeiten Zingst, Zingst, Hotel Bar54 - Hotel Vier Jahreszeiten Zingst, Zingst, Fireplace55 - Hotel Vier Jahreszeiten Zingst, Zingst, Property Grounds56 - Hotel Vier Jahreszeiten Zingst, Zingst, Hotel Front57 - Hotel Vier Jahreszeiten Zingst, Zingst, Hotel Front58 - Hotel Vier Jahreszeiten Zingst, Zingst, Hotel Front59 - Hotel Vier Jahreszeiten Zingst, Zingst, Hotel Front - Evening/Night60 - Hotel Vier Jahreszeiten Zingst, Zingst, Hotel Front - Evening/Night61 - Hotel Vier Jahreszeiten Zingst, Zingst, Garden62 - Hotel Vier Jahreszeiten Zingst, Zingst, Outdoor Dining63 - Hotel Vier Jahreszeiten Zingst, Zingst, Exterior64 - Hotel Vier Jahreszeiten Zingst, Zingst, Exterior65 - Hotel Vier Jahreszeiten Zingst, Zingst, Exterior66 - Hotel Vier Jahreszeiten Zingst, Zingst, Balcony ViewLakefront hotel in Darss with spa, indoor pool Free buffet breakfastMain amenities95 guestroomsFull-service spaIndoor poolBar/loungeHealth clubSelf parking24-hour business centerTerrace24-hour front deskCoffee/tea in a common areaDaily housekeepingGardenWhat’s aroundIn DarssZingst Beach (1.1 mi / 1.8 km)Tauchgondel Zingst (1.4 mi / 2.2 km)Experimentarium Zingst (1.5 mi / 2.5 km)Darss Museum (8.2 mi / 13.3 km)Vineta-Museum (8.5 mi / 13.7 km)See mapExcellent4.0 / 5RoomRoom is all rightLocationGreat locationWellness AreaGreat wellness & sports facilitiesBreakfastTasty breakfast109See all 109 Hotels.com reviewsTripAdvisor Traveller Rating: 3.5From 93 reviewsTripAdvisor Traveller RatingEmailSaveShareHotels.com® RewardsBook this hotel and collect nights after your stayHotel Vier Jahreszeiten Zingst, ZingstHotel Info: 866-539-8117 from $89Destination, hotel, landmark or addressCheck inCheck out Rooms123456789+Room 1:Adults12345678Aged 18+Children01230-17Age at check in:Child 1:-?-<11234567891011121314151617Check availability Comfort Double RoomDeluxe Double Room, Garden ViewJunior SuiteMaisonetteSingle RoomCheck availability More great choicesSee all hotels in ZingstList viewMap viewSee all hotels in ZingstAt a glanceKey factsHotel sizeThis hotel has 95 roomsThis hotel is arranged over 2 floorsArriving/leavingCheck-in time starts at 3 PMCheck-out time is 11 AMExpress check-in/outRequired at check inCredit card or cash deposit required
Government-issued photo ID requiredTravelling with othersPetsPets allowed * Restrictions apply * TransportationParkingSelf parking *See mapAlso known asHotel Vier Jahreszeiten ZingstVier Jahreszeiten ZingstPoliciesPet-friendly rooms can be requested by contacting the property at the number on the booking confirmation. Mandatory feesYou’ll be asked to pay the following charges at check in or check out:A tax is imposed by the city: EUR 2.80 per person, per nightOptional extrasSelf parking costs EUR 8 per day with in/out privilegesRollaway beds are available for EUR 44 per nightPets are allowed for an extra charge of EUR 15 per pet, per dayNearby Four Star Zingst hotelsFerienhäuser Zingster Perlen & TraumZeit5 starsNo guest ratings yetHotel Meerlust4.5 starsOutstanding4.6 / 5From $167Dorint Strandresort & Spa Ostseebad Wustrow4.5 starsExcellent4.3 / 5From $125$113Romantik Hotel Scheelehof4.5 starsOutstanding4.6 / 5From $131See more Four Star Zingst hotelsIn the hotelFood and drinkFree buffet breakfastBar/lounge Coffee shop/café Room service (during limited hours) Coffee/tea in a common area Things to doIndoor poolHealth clubFull-service spaSpa treatment room(s)Steam roomSaunaArcade/game roomBilliards or pool tableWorking away24-hour business centerOne meeting roomComputer stationServices24-hour front deskDry cleaning/laundry serviceMultilingual staffFacilitiesYear Built 1974Elevator/liftDesignated smoking areasGardenTerraceLibraryTelevision in common areasIn the roomHome comfortsMinibarBathrobesSleep wellHypo-allergenic bedding availableBlackout drapes/curtainsSoundproofed roomsPremium beddingFreshen upPrivate bathroomShower onlyFree toiletriesHair dryerBe entertainedTV Satellite TV channels Stay connectedDeskFree newspaperMoreDaily housekeepingIn-room safeTop Zingst hotelsStrandhotel Deichgraf4 starsOutstanding4.7 / 5From $141Strandhotel Fischland4.5 starsOutstanding4.6 / 5From $218Hotel Kontorhaus3 starsExcellent4.5 / 5From $79Dünenmeer Ferienwohnungen & -Häuser4.5 starsExcellent4.5 / 5From $189Recently reviewed hotels in ZingstHotel Hiddenseer3 starsExcellent4.3 / 5From $62"Overall, this was a really nice, no frills hotel. The hotel staff was very friendly, and everything was clean. There were a couple very minor negative points that some people…"Jan 24, 2017Schweriner Hof3 starsGood3.7 / 5From $53"The location is great.
Great breakfast."Aug 21, 2016Altstadt Hotel Zur Post Stralsund3 starsGood3.8 / 5From $51"Staff was extremely pleasant and helpful with travel directions. Avoid the small cafe and opt for the E12 hotel breakfast."Jun 30, 2016Hotel Am Jungfernstieg3 starsExcellent4.3 / 5From $67$60Nearby hotelsHotel Restaurant Marks3 starsGood3.7 / 5From $72Ferienhaus Ostseebrise5 starsNo guest ratings yetFerienhaus Ostseeperle5 starsNo guest ratings yetHotel Inselparadies4 starsNo guest ratings yetAlso popular with travelers from the USASee all hotels in ZingstList viewMap viewSee all hotels in ZingstSpecial featuresSpaThe onsite spa has massage/treatment rooms. Services include massages, facials, and body treatments. The spa is equipped with Turkish bath/hammam. A variety of treatment therapies are provided, including Ayurvedic. RecreationOn SiteHealth clubSaunaSteam roomBicycle rentals on siteMiniature golf on sitePersonal motorized watercraft on siteVolleyball on siteNearbyHiking/biking trails nearbyMountain biking nearbySailing nearbySurfing/boogie boarding nearbyWindsurfing nearbyHotel Vier Jahreszeiten Zingst, Zingst’s small printAlso known asHotel Vier Jahreszeiten ZingstVier Jahreszeiten ZingstPoliciesPet-friendly rooms can be requested by contacting the property at the number on the booking confirmation. Mandatory feesYou’ll be asked to pay the following charges at check in or check out:A tax is imposed by the city: EUR 2.80 per person, per nightOptional extrasSelf parking costs EUR 8 per day with in/out privilegesRollaway beds are available for EUR 44 per nightPets are allowed for an extra charge of EUR 15 per pet, per dayWe have included all charges provided to us by this hotel. However, charges can vary, for example, based on length of stay or the room you book.Hotel Vier Jahreszeiten Zingst, ZingstIs the description of this hotel not correct? Tell usChoose one of the following to unlock Secret Prices and pay less on select hotels.EmailSign up for our latest offersHotels.com appDownload the app and book on the goHotels.com® RewardsJoin now! Collect 10 nights, get 1 free*Top DestinationsHotels in New York, New YorkHotels in Las Vegas, NevadaHotels in Chicago, IllinoisHotels in San Francisco, CaliforniaHotels in Washington, District of ColumbiaHotels in Boston, MassachusettsHotels in San Diego, CaliforniaHotels in Orlando, FloridaHotels in London, United KingdomHotels in New Orleans, LouisianaHotels in Los Angeles, CaliforniaHotels in San Antonio, TexasHotels in Paris, FranceHotels in Seattle, WashingtonHotels in Atlanta, GeorgiaHotels in Philadelphia, PennsylvaniaHotels in Austin, TexasHotels in Atlantic City, New JerseyHotels in Rome, ItalyHotels in Myrtle Beach, South CarolinaHotels in Dallas, TexasHotels in Houston, TexasHotels in Denver, ColoradoHotels in Miami, FloridaSupport & FAQsYour bookingsFAQsContact usWebsite feedbackReview a hotelFor Suppliers, Affiliates and the MediaAffiliate with usPrivate LabelPromote with UsTravel AgentsPress OfficeUser Terms and Privacy PolicyTerms & ConditionsPrivacy PolicyCookie PolicyAbout our adsAbout UsAdd your hotelJobsTravel GuidesTop 50 CitiesAll countriesAll hotelsSite index© 2017 Hotels.com, L.P. All rights reserved.Hotels.com and the Hotels.com logo are trademarks or registered trademarks of Hotels.com, LP in the U.S. and/or other countries. All other trademarks are property of their respective owners.* Learn more about Hotels.com® RewardsABOUT SSL CERTIFICATES

value: This website is a website for booking hotel rooms online and by telephone. The company has 85 websites in 34 languages, and lists over 325,000 hotels in approximately 19,000 locations.


text:
Don't litter - spay and neuter your pets!Support Our Troops!Please click AVATAR for Christmas dangers to pets. Wishing you, your loved ones and pets a SAFE and very Merry Christmas. My bio - below the more important stuff. ⇓New Memorial:Kalahari The Giraffe Dec 9, 2014Upcoming B/Ds and A/Ds:GGG-Uncle B/D Dec 25thGG-Aunt A/D Dec 26thVeteransPFC John F Landry Jr B/D Dec 25thSgt Lauren M Ridge B/D Dec 25thJoseph J Altmann A/D Dec 25thLt Schlicht Billy Code Talker B/D Dec 26thJames E Creech B/D Dec 26thLt Aris M Ehardt B/D Dec 26thNorman S Olsen Jr B/D Dec 27thJames B Pierce A/D Dec 27thMy January Fur Angels:Missy B/D Jan 1stPuglena A/D Jan 15thCritters Needing Flowers:Mollie The DogMonty The DogRocko The DogCherry Street PetsIf you have time, please leave a little love for my Sponsored Critters. They would so love it and I do appreciate your visits.♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥I'm a feral cat caregiver, an animal lover and a keen reader from Louisiana. I have a deep patriotic love for America, am a devout Roman Catholic, and have a fond addiction to strong, black coffee and dark chocolate. My nickname is Suse; sniksnak is a name coined for my cats' treats (snicksnack was too long for my first internet provider's character fields, so I removed the silent Cs; hence, sniksnak). My beloved late husband and soul mate (Craig Paul Bachman) and I are owned by numerous cats and dogs who entered our lives, either by our rescue or our personal adoption through the non-profit cat sanctuary we owned, Pawprints and Purrs, Inc. Shortly after his loss, I dissolved our organization but still have at our home twenty-three cats and four dogs who are not adoptable due to various ailments (diabetes, IBD, hyperthyroidism, etc.), or as in the case of the majority of the cats, are unsociable due to being trapped as adult ferals.Craig long marveled at my love for cemeteries - the older, the better. A taphophile I am - taphophilia is a passion for and enjoyment of cemeteries - I love walking through them delighting in the solitude and peacefulness as I read markers and headstones.My heart holds a very special spot for veterans, members of law enforcement, children, and animals. Support our troops, back the badge, and report child and animal neglect and abuse. Sidney Sheldon, an American writer, stated my own thoughts, but ever so eloquently: "My heroes are those who risk their lives every day to protect our world and make it a better place - police, firefighters and members of our armed forces."I believe every memorial should have a virtual flower. When I see one without, I add one; it's an honor to leave my respects. That person was once loved and cherished by someone, somewhere.I visit every person who visits my memorials as I have time. I deeply appreciate each and every visit. ❤♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ Contact:
301,538 Virtual Flowers

value: This website is a website that allows the public to search and add to an online database of cemetery records. It is owned by Ancestry.com.


text:
Www.texasguntrader. | eBay
Refine your search for Www.texasguntrader.
0 results for Www.texasguntrader.
Save Www.texasguntrader. to get e-mail alerts and updates on your eBay Feed.
Unfollow Www.texasguntrader. to stop getting updates on your eBay Feed.
Www.texasguntrader.:

value: This website is an American multinational e-commerce corporation based in San Jose, California, that facilitates consumer-to-consumer and business-to-consumer sales through its website.


text:
Booking.com: Hotels in Amorebieta-Etxano. Book your hotel now!
Amorebieta-Etxano – Show on map (0.4 miles from map center )
Amorebieta-Etxano – Show on map (0.5 miles from map center )
Amorebieta-Etxano – Show on map (0.7 miles from map center )
Amorebieta-Etxano – Show on map (1.5 miles from map center )
Amorebieta-Etxano – Show on map (2 miles from map center )
Galdakao – Show on map (3.7 miles from map center )
Agroturismo Iberreko Errota Opens in new window
Muxika – Show on map (4 miles from map center )
Located in Muxika, Agroturismo Iberreko Errota provides accommodations with free WiFi and a garden. Guests at the farm stay can enjoy a continental breakfast. Agroturismo Iberreko Errota has a...
Muxika – Show on map (4.2 miles from map center )
Chalet Caserio Otalora. S.XVIII Opens in new window
Orózqueta – Show on map (4.3 miles from map center )
Caserio Otalora. S.XVIII is located in Orózqueta. This chalet provides an outdoor pool and complimentary WiFi. Offering 8 bedrooms and 2 bathrooms, this chalet comes with a flat-screen TV.
Aldori Landetxea Opens in new window
Muxika – Show on map (4.6 miles from map center )
Guyuria – Show on map (4.8 miles from map center )
Located in Guyuria, Apartamento y Loft Durango provides accommodations with free WiFi and access to a garden with a terrace.
Durango – Show on map (4.9 miles from map center )
Esquerica – Show on map (5.1 miles from map center )
Larrabetzu – Show on map (5.5 miles from map center )
843040,758330,843260,661987|1,845720,827210,833800|4,835470|7,845780,847680|1,807880,845960,845640,845780|1,851370|1,837170,852760,848910,661987,840830,835470,851380|1,832360|1,843950,845220,829950,832360,847680,847580,842400,848490,850930,847350,837440,789810,847680|2,838080,844420,852970|1,835220,833800,846600,851400|1,850020

value: This website is a Dutch online travel agency for lodging reservations & other travel products, and a subsidiary of Booking Holdings. It is headquartered in Amsterdam.The website has over 28 million listings.