Partitioning social networks for data locality on a memory budget
Stein, David
Loading…
Permalink
https://hdl.handle.net/2142/31040
Description
Title
Partitioning social networks for data locality on a memory budget
Author(s)
Stein, David
Issue Date
2012-05-22T00:23:50Z
Director of Research (if dissertation) or Advisor (if thesis)
Lu, Yi
Department of Study
Electrical & Computer Eng
Discipline
Electrical & Computer Engr
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
M.S.
Degree Level
Thesis
Keyword(s)
Social networks
Partitioning
Locality
Abstract
"Typical queries on online social network (OSN) applications are complex and require ""feeds"" to be compiled with timely information about many friends and friends' friends, which may be stored across many servers. Partitioning the OSN social graph in such a way as to promote data locality, i.e. such that a user's data will be stored on the same server as his friends' data, has proven difficult to do, and many existing OSN partitioning systems do not even attempt this. However, recent work has demonstrated techniques that do achieve data locality for social network queries by placing replicas of user data. We show that exploiting temporal characteristics of user behavior can enable effective partitioning for data locality without replication. We then build on this concept and demonstrate improved data locality by placing replicas sparingly. The result is a system which allows one to allocate a memory budget for replication and in return get a commensurate improvement in data locality."
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
