FAST QUERYING OF SOCIAL NETWORK DATA
First Claim
1. A method for processing data, comprising:
- obtaining a graph of a social network, wherein the graph comprises;
a set of nodes representing users in the social network; and
a set of edges representing relationships between pairs of the users;
storing, on a single computer system, a static representation of the graph, wherein the static representation comprises;
a first set of fixed-size blocks representing the nodes and the edges; and
a first index that maps a set of identifiers for the nodes and the edges to offsets of the first set of fixed-size blocks; and
using the static representation of the graph to process, by the single computer system, one or more queries of the graph.
2 Assignments
0 Petitions
Accused Products
Abstract
The disclosed embodiments provide a system for processing data. During operation, the system obtains a graph of a social network, wherein the graph includes a set of nodes representing users in the social network and a set of edges representing relationships between pairs of the users. Next, the system stores, on a single computer system, a static representation of the graph, wherein the static representation includes a first set of fixed-size blocks representing the nodes and the edges and a first index that maps a set of identifiers for the nodes and the edges to offsets of the first set of fixed-size blocks. The system then uses the static representation of the graph to process, by the single computer system, one or more queries of the graph.
-
Citations
20 Claims
-
1. A method for processing data, comprising:
-
obtaining a graph of a social network, wherein the graph comprises; a set of nodes representing users in the social network; and a set of edges representing relationships between pairs of the users; storing, on a single computer system, a static representation of the graph, wherein the static representation comprises; a first set of fixed-size blocks representing the nodes and the edges; and a first index that maps a set of identifiers for the nodes and the edges to offsets of the first set of fixed-size blocks; and using the static representation of the graph to process, by the single computer system, one or more queries of the graph. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
-
12. An apparatus, comprising:
-
one or more processors; and memory storing instructions that, when executed by the one or more processors, cause the apparatus to; obtain a graph of a social network, wherein the graph comprises; a set of nodes representing users in the social network; and a set of edges representing relationships between pairs of the users; store a static representation of the graph, wherein the static representation comprises; a first set of fixed-size blocks representing the nodes and the edges; and a first index that maps a first set of identifiers for the nodes and the edges to offsets of the first set of fixed-size blocks; and use the static representation of the graph to process one or more queries of the graph. - View Dependent Claims (13, 14, 15, 16, 17)
-
-
18. A system, comprising:
-
a management non-transitory computer-readable medium comprising instructions that, when executed by one or more processors, cause the system to; obtain a graph of a social network, wherein the graph comprises; a set of nodes representing users in the social network; and a set of edges representing relationships between pairs of the users; and store a static representation of the graph, wherein the static representation comprises; a first set of fixed-size blocks representing the nodes and the edges; and a first index that maps a set of identifiers for the nodes and the edges to offsets of the first set of fixed-size blocks; and a query-processing non-transitory computer-readable medium comprising instructions that, when executed by one or more processors, cause the system to use the static representation of the graph to process one or more queries of the graph. - View Dependent Claims (19, 20)
-
Specification