# US 2004/0205242 A1 · Querying a peer-to-peer network

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2004/0205242 A1
- Document ID: US20040205242A1
- Status: Published application
- Kind: A1
- Application number: 10/385,667
- Filed: 2003-03-12
- Published: 2004-10-14
- Earliest claimed: 2003-03-12
- Inventors: Zhichen Xu; Mallik Mahalingam; Chunqiang Tang
- Web page: https://patentgrep.com/patent/US20040205242A1

## CPC

- H04L 67/104: Peer-to-peer [P2P] networks
- H04L 69/329: in the application layer [OSI layer 7]
- H04L 67/1065: {Discovery involving distributed pre-established resource-based relationships among peers, e.g. based on distributed hash tables [DHT] (pre-configuration of logical or physical connections H04L67/1053)}
- H04L 67/1074: for supporting data block transmission mechanisms (file transfer H04L67/06)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

In a peer-to-peer network information is received. A vector is generated from the information. The vector includes at least one element associated with the information. At least some of the vector and an address index for the received information are published to at least one node in the peer-to-peer network.

## Claims

### Claim 1

A method of placing information in a peer-to-peer network, said method comprising:
receiving information;
generating a vector for the information, the vector including at least one element associated with the information; and
publishing at least some of the vector and an address index for the information to at least one node in the peer-to-peer network.

### Claim 2 (depends on 1)

The method of claim 1, wherein the peer-to-peer network comprises an overlay network and the step of publishing further comprises:
hashing the at least one element using a hash function to identify a point in the overlay network; and
publishing the address index and the at least some of the vector to the identified point.

### Claim 3 (depends on 2)

The method of claim 2, wherein the at least one element of the vector comprises multiple elements, and the method further comprises dividing the multiple elements into a first group and a second group.

### Claim 4 (depends on 3)

The method of claim 3, wherein the step of publishing comprises publishing the address index and the entire vector for the first group and publishing the address index and a compressed vector for the second group.

### Claim 5 (depends on 4)

The method of claim 4, wherein the compressed vector comprises one of the vector compressed using a compression algorithm and a portion of the vector.

### Claim 6 (depends on 3)

The method of claim 3, wherein the step of dividing the multiple elements comprises dynamically dividing the multiple elements based on the popularity of the received information.

### Claim 7 (depends on 6)

The method of claim 6, wherein the step of dynamically dividing the multiple elements comprises:
determining a number of hits for an element of the multiple elements;
determining whether the number of hits exceeds a threshold;
assigning the element to the first group if the number of hits exceeds the threshold; and
assigning the element to the second group if the number of hits is less than the threshold.

### Claim 8 (depends on 7)

The method of claim 7, wherein the step of dynamically dividing the multiple elements comprises:
determining whether the element of the multiple elements has had a hit within a period of time;
assigning the element to the first group if the element had a hit in the period of time; and
assigning the element to the second group if the element did not have a hit in the period of time.

### Claim 9 (depends on 1)

The method of claim 1, wherein the step of generating a vector comprises generating the vector using a vector space modeling algorithm.

### Claim 10

A method of querying a peer-to-peer network, the method comprising:
receiving a query including a request for information;
converting the query into a vector including at least one element associated with the query; and
searching for the requested information among a plurality of nodes in the peer-to-peer network using the vector.

### Claim 11 (depends on 10)

The method of claim 10, wherein the step of searching for the requested information comprises:
receiving said query at a node of the plurality of nodes;
comparing the at least one element of the vector with a respective index stored on the node; and
transmitting candidate information from the node based on said candidate information matching said at least one element of the vector.

### Claim 12 (depends on 11)

The method of claim 11, further comprising:
retrieving said candidate information from said respective index based on said at least one element of said vector matching an item of said respective index; and
filtering said candidate information based on vector space modeling.

### Claim 13 (depends on 12)

The method of claim 12, further comprising:
receiving a set of candidate information matching said at least one element from a subset of nodes of said plurality of nodes, said set of candidate information being included in indices of the subset of nodes; and
filtering said set of candidate information based on said vector.

### Claim 14 (depends on 10)

The method according to claim 10, wherein said conversion of said query for said requested information is based on vector-spaced modeling.

### Claim 15 (depends on 10)

The method according to claim 10, wherein searching for the requested information comprises:
hashing the at least one element of said query with a hash function; and
routing said hashed at least one element to a selected point in an overlay network of the peer-to-peer network.

### Claim 16

An apparatus in a peer-to-peer network comprising:
means for receiving information;
means for generating a vector for the information, the vector including at least one element associated with the information; and
means for publishing at least some of the vector and an address index for the information to at least one node in the peer-to-peer network.

### Claim 17 (depends on 16)

The apparatus of claim 16, wherein the peer-to-peer network comprises an overlay network and the apparatus comprises:
hashing means for hashing the at least one element using a hash function to identify a point in the overlay network for publishing the at least some of the vector to the at least one node associated with the identified point in the overlay network.

### Claim 18 (depends on 16)

The apparatus of claim 16, wherein the at least one element of the vector comprises multiple elements, the apparatus further comprising:
dynamically dividing means for assigning each of the multiple elements into one of a first group and a second group based on a popularity of the received information.

### Claim 19 (depends on 18)

The apparatus of claim 18, wherein the publishing means comprises means for publishing the entire vector for the first group of elements and means for publishing a compressed vector for the second group of elements.

### Claim 20

An apparatus in a peer-to-peer network comprising:
means for receiving a query including a request for information;
means for converting the query into a vector including at least one element associated with the query; and
means for searching for the requested information among a plurality of nodes in the peer-to-peer network using the vector.

### Claim 21 (depends on 20)

The apparatus of claim 20, further comprising:
means for receiving said query at a node of the plurality of nodes;
means for comparing the at least one element of the vector with a respective index stored on the node; and
means for transmitting candidate information from the node based on said candidate information matching said at least one element of the vector.

### Claim 22 (depends on 21)

The apparatus of claim 21, further comprising:
means for retrieving said candidate information from said respective index based on said at least one element of said vector matching an item of said respective index; and
means for filtering said candidate information based on vector space modeling.

### Claim 23

A system comprising:
a plurality of peers in a peer-to-peer network;
an overlay network implemented by said plurality of peers, wherein said overlay network is configured to be divided into zones, each zone owned by a respective peer of said plurality of peers;
a plurality of indices, each index of said plurality of indices based on a term of information, wherein each index of said plurality of indices is configured to be associated with a respective peer of said plurality of peers; and
a query module stored and executed by each peer of said plurality of peers, wherein said query module is configured to hash at least one element of a vectorized query to a selected point in said overlay network and receive candidate information from a respective index stored at a selected peer that owns the respective zone where said selected point falls.

### Claim 24 (depends on 23)

The system according to claim 23, wherein said query module is further configured to receive a set of candidate information from a subset of nodes of said plurality of peers, said subset of nodes having indices matching said at least one element of said vectorized query and to filter said set of candidate information based on said vectorized query.

### Claim 25 (depends on 23)

The system according to claim 23, wherein said hash function is configured to map strings to a respective point in said overlay network.

### Claim 26 (depends on 23)

The system according to claim 23, further comprising an index module stored and executed by each peer of said plurality of peers, wherein said index module is configured to receive an item of information and convert said item of information into a term vector based on an ordering of an occurrence of weighted terms in said item of information.

### Claim 27 (depends on 26)

The system according to claim 26, wherein said index module is further configured to apply a hash function to said term vector to create a hashed point.

### Claim 28 (depends on 27)

The system according to claim 27, wherein said index module is further configured to create a key pair comprised of said hashed point and an address index.

### Claim 29 (depends on 28)

The system according to claim 28, wherein said address index comprises of one of said item of information and a pointer to said item of information.

### Claim 30 (depends on 28)

The system according to claim 28, further comprising a routing module stored and executed by each peer of said plurality of peers, wherein said routing module configured to route said key pair within said overlay network based on said hashed point.
