Patent Document ID: 10025867
Application ID: 14869656

Base Claim:
1. A method for improving storage efficiency of a social network system, comprising: receiving an instruction to improve cache or memory efficiency of social graph data of a social graph, wherein the social graph includes multiple vertices representing social network users and some of the social network users are friends in a social network; generating, based on the social graph, a partitioning tree including multiple bottom-level buckets, the partitioning tree dividing the vertices of the social graph into the bottom-level buckets and ordering the bottom-level buckets such that a social network metric corresponding to the vertices is optimized; assigning user identities (IDs) to the vertices of the social network in a numerical sequence based on the ordering of the bottom-level buckets; storing the social graph data of the users in storage locations in a storage device in an order according to the numeral sequence of the assigned user IDs of the vertices; and responding to a social graph data request for a list of requested users by retrieving social graph data of the requested users together from storage locations that are close to each other in the storage device, wherein the requested users are related users who have been assigned the user IDs that are close to each other.

---

Claim 12:
12. The method of claim 1 , wherein the social network metric regarding the vertices is calculated by sampling a number of representative vertices from the buckets of the social graph.