Abstract:
Methods, systems, and machine-readable media are disclosed for searching a corpus of information by utilizing a Bloom filter for caching query results. According to one aspect of the present invention, a method of caching information from a corpus of information can include populating one or more Bloom filters with a plurality of bits representative of information in the corpus of information. A search request can be received identifying requested information from the corpus of information. One or more bits in the filter(s) associated with the requested information can be checked and the requested information can be retrieved from the corpus of information based on results of said checking. Furthermore, the filter(s) can be used to determine which information to make available to a particular user in a system where certain information is associated with or access is limited to certain users or groups of users.
Abstract:
In a method of invoking mutual anonymity, electing to become a head of a return path in response to receiving a request for information. The information is received at the head of the return path. The information is then forwarded to a peer that transmitted the request.
Abstract:
The present invention is directed towards systems and methods for using community annotations to content items as anchortext for search and index purposes. The method according to one embodiment comprises generating one or more items of personalized information by a user for storage in a user profile, the one or more items of personalized information associated with one or more content items, the one or more content items and the one or more items of personalized information comprising one or more words. One or more items of personalized information is selected from a given user profile. The method further comprises indexing the one or more words in the one or more content items and the one or more words in the selected personalized information into an index, identifying one or more content items responsive to on or more query words in a query of the index and returning the identified content items as a result set to the user.
Abstract:
In a method of improving querying, a plurality of items of information are transformed into a plurality of vectors, where each item of information of the plurality of items of information is mapped to a respective vector of said plurality of vectors. A plurality of vectors is associated with a subset of nodes selected from a plurality of nodes. Each vector associated with a respective node of said plurality of nodes is based on a similarity between each vector of said plurality of vectors.
Abstract:
Location information for a node in a network is determined. A first distance from the node to at least one global landmark node is determined and a second distance from the node to at least one local landmark node proximally located to the node is determined. Location information for the node based on the first distance and the second distance is generated.
Abstract:
A peer-to-peer system includes a destination node operable to receive a query. The destination node receives samples from a first set of nodes proximally located to the destination node in an overlay network for the peer-to-peer system. The samples are associated with information stored at the proximally located nodes. The destination node is operable to identify, based on the samples received from the first set of nodes, a first node of the first set of nodes likely storing information associated with objects stored in the peer-to-peer system that are relevant to the query.
Abstract:
Techniques are described for identifying one or more “interest twins” of a user. An interest twin of a user in another user that has demonstrated interests in items that are the same as or similar to the items in which the user has demonstrated an interest. Various techniques are described for reducing the overhead in interest twin determination operations. Once the interest twins for a user have been identified, the knowledge of the interest twins may be used in a variety of ways to enhance to experience of the user. For example, a mechanism may be provided which allows the user to see a list of items in which the user's interest twins have indicated an interest.
Abstract:
A method and a computer-readable medium are provided which perform screen scraping via grammar induction. The computer-readable medium stores instructions of the method, the instructions directing a computer processor to intercept display information transmitted to a computer-implemented display device representing information stored in a data source; induce a grammar via statistical analysis of the intercepted display information; provide the grammar to a parser-generator to generate a parser corresponding to the induced grammar; and perform screen scraping using the generated parser.
Abstract:
Location information for a node in a network is determined. A first distance from the node to at least one global landmark node is determined and a second distance from the node to at least one local landmark node proximally located to the node is determined. Location information for the node based on the first distance and the second distance is generated.
Abstract:
Embodiments of the present invention provide systems and methods for ranking a result set. The method according to one embodiment comprises selecting an item from the result set, selecting a user profile from one or more user profiles and selecting one or more items of personalized information from the selected user profile. A rank is calculated for the item on the basis of the selected one or more items of personalized information and the selected item in the result set is ranked in accordance with the calculated rank.