INDEX DATA STRUCTURE FOR A PEER-TO-PEER NETWORK

• US 20100131564A1
• Filed: 01/28/2010
• Published: 05/27/2010
• Est. Priority Date: 11/14/2005
• Status: Active Grant

• Current Assignee: Primo M. Pettovello
• Original Assignee: Primo M. Pettovello
• Inventors: Pettovello, Primo M.
• Granted Patent: US 8,166,074 B2
• Time in Patent Office: Days
• US Class Current: 707/794
• CPC Class Codes: G06F 16/134 Distributed indices
• CPC Class Codes: G06F 16/1837 Management specially adapted to peer-to-peer storage networks topology management mechanisms of peer-to-peer networks H04L67/1042
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching

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.

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.

2. The index data structure of claim 1 wherein the semantic content is a path to the node associated with the index key.

3. The index data structure of claim 1 wherein the label comprises a qname.

4. The index data structure of claim 1 wherein a single node is associated with one or more semantic paths.

5. The index data structure of claim 1 wherein the one or more routing tables comprising at least 10 path references.

6. The index data structure of claim 1 wherein the one or more routing tables comprises:

at least 2 path references selected from the preceding peer-to-peer graph;

at least 2 path references selected from the following peer-to-peer graph;

at least 2 path references selected from the ancestor peer-to-peer graph; and

at least 2 path references selected from the descendent peer-to-peer graph.

7. The index data structure of claim 1 wherein at least one of the following provisions are present:

at least 2 path references are selected from the preceding peer-to-peer graph;

at least 2 path references are selected from the following peer-to-peer graph;

at least 2 path references are selected from the ancestor peer-to-peer graph; and

at least 2 path references are selected from the descendent peer-to-peer graph.

8. The index data structure of claim 1 wherein the data object is an object selected from the group consisting of a peer-to-peer network, an XML document, RDF files, music files, movie files, multimedia files, a collection of XML documents, a collection of distributed computers, a distributed service, a collection of distributed services, hierarchical file systems, tree data structures, XML file system, relational database tables, multidimensional tables, computer graphics geometry space, polygon space, and combinations thereof.

9. The index data structure of claim 1 wherein the data object is a peer-to-peer network.

10. The index data structure of claim 1 wherein the index data structure is accessible to a computer system.

21. The method of claim 1 wherein at least one of the following provisions are present:

at least 2 path references are selected from the preceding peer-to-peer graph;

at least 2 path references are selected from the following peer-to-peer graph;

at least 2 path references are selected from the ancestor peer-to-peer graph; and

at least 2 path references are selected from the descendent peer-to-peer graph.

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.

12. The method of claim 11 further comprising arranging the routing information in a declarative order.

13. The method of claim 11 further comprising arranging the routing information in a semantic order

14. The method of claim 11 further comprising arranging the routing information in a lexicographical order

15-20. -20. (canceled)