INDEX DATA STRUCTURE FOR A PEER-TO-PEER NETWORK
First Claim
Patent Images
1. An index data structure for one or more data objects, the index data structure comprising:
- a) a plurality of index keys for uniquely identifying potential context nodes in a data object, each index key being associated with one or more potential context nodes, the index key having a label that provides semantic content to a user; and
b) one or more routing tables associated with each index key, the one or more routing tables comprising at least 5 path references selected from a preceding peer-to-peer graph, a following peer-to-peer graph, an ancestor peer-to-peer graph, and descendent peer-to-peer graph, wherein the index data structure is stored on a digital storage medium.
0 Assignments
0 Petitions
Accused Products
Abstract
An index data structure comprises a plurality of index keys for uniquely identifying potential data object context nodes. Each index key is, in turn, associated with one or more potential context nodes. Moreover, the index key has a label that provides semantic content to a user. The index data structure further comprises one or more routing tables associated with each index key that generally include a plurality of path references.
117 Citations
21 Claims
-
1. An index data structure for one or more data objects, the index data structure comprising:
-
a) a plurality of index keys for uniquely identifying potential context nodes in a data object, each index key being associated with one or more potential context nodes, the index key having a label that provides semantic content to a user; and b) one or more routing tables associated with each index key, the one or more routing tables comprising at least 5 path references selected from a preceding peer-to-peer graph, a following peer-to-peer graph, an ancestor peer-to-peer graph, and descendent peer-to-peer graph, wherein the index data structure is stored on a digital storage medium. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 21)
-
-
11. A method of creating an index data structure for a peer-to-peer network having one or more nodes, the method comprising:
-
a) exchanging one or more messages between two or more different nodes that provides routing information regarding the overlay structure as known to each node originating a message; b) incorporating received routing information into a routing table; c) storing the index key and the associated set of index attributes on a digital storage medium. - View Dependent Claims (12, 13, 14)
-
-
15-20. -20. (canceled)
Specification