Social piggybacking

Leveraging common friends to generate event streams

Aristides Gionis, Flavio Junqueira, Vincent Leroy, Marco Serafini, Ingmar Weber

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Social networking systems present users with online event streams that include recent activities of their friends. Materialized per-user views are a common way to generate such event streams on-line and with low latency. We propose improving throughput by using social piggybacking: process the requests of two friends by just querying and updating the view of a third common friend. By using one such hub view, the system can serve requests of the first friend without querying nor updating the view of the second. This reduces the overall load on views, and can be implemented with minimal adaptations by existing social networking architectures. We show that, given a social graph, there exist hub-based schedules that minimize the overall number of view requests, but computing them is NP-hard. We propose a heuristic to solve the problem and evaluate it using samples from the Twitter and Flickr social graphs. The evaluation shows that existing solutions generate up to 2.4 times the amount of view requests induced by our heuristic.

Original languageEnglish
Title of host publicationProceedings of the 5th Workshop on Social Network Systems, SNS'12
DOIs
Publication statusPublished - 14 May 2012
Externally publishedYes
Event5th Workshop on Social Network Systems, SNS'12 - Bern, Switzerland
Duration: 10 Apr 201210 Apr 2012

Other

Other5th Workshop on Social Network Systems, SNS'12
CountrySwitzerland
CityBern
Period10/4/1210/4/12

Fingerprint

Throughput

Keywords

  • social dissemination
  • social piggybacking

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Gionis, A., Junqueira, F., Leroy, V., Serafini, M., & Weber, I. (2012). Social piggybacking: Leveraging common friends to generate event streams. In Proceedings of the 5th Workshop on Social Network Systems, SNS'12 https://doi.org/10.1145/2181176.2181184

Social piggybacking : Leveraging common friends to generate event streams. / Gionis, Aristides; Junqueira, Flavio; Leroy, Vincent; Serafini, Marco; Weber, Ingmar.

Proceedings of the 5th Workshop on Social Network Systems, SNS'12. 2012.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Gionis, A, Junqueira, F, Leroy, V, Serafini, M & Weber, I 2012, Social piggybacking: Leveraging common friends to generate event streams. in Proceedings of the 5th Workshop on Social Network Systems, SNS'12. 5th Workshop on Social Network Systems, SNS'12, Bern, Switzerland, 10/4/12. https://doi.org/10.1145/2181176.2181184
Gionis A, Junqueira F, Leroy V, Serafini M, Weber I. Social piggybacking: Leveraging common friends to generate event streams. In Proceedings of the 5th Workshop on Social Network Systems, SNS'12. 2012 https://doi.org/10.1145/2181176.2181184
Gionis, Aristides ; Junqueira, Flavio ; Leroy, Vincent ; Serafini, Marco ; Weber, Ingmar. / Social piggybacking : Leveraging common friends to generate event streams. Proceedings of the 5th Workshop on Social Network Systems, SNS'12. 2012.
@inproceedings{ba4462f4f2214283b22b9a6986a373b1,
title = "Social piggybacking: Leveraging common friends to generate event streams",
abstract = "Social networking systems present users with online event streams that include recent activities of their friends. Materialized per-user views are a common way to generate such event streams on-line and with low latency. We propose improving throughput by using social piggybacking: process the requests of two friends by just querying and updating the view of a third common friend. By using one such hub view, the system can serve requests of the first friend without querying nor updating the view of the second. This reduces the overall load on views, and can be implemented with minimal adaptations by existing social networking architectures. We show that, given a social graph, there exist hub-based schedules that minimize the overall number of view requests, but computing them is NP-hard. We propose a heuristic to solve the problem and evaluate it using samples from the Twitter and Flickr social graphs. The evaluation shows that existing solutions generate up to 2.4 times the amount of view requests induced by our heuristic.",
keywords = "social dissemination, social piggybacking",
author = "Aristides Gionis and Flavio Junqueira and Vincent Leroy and Marco Serafini and Ingmar Weber",
year = "2012",
month = "5",
day = "14",
doi = "10.1145/2181176.2181184",
language = "English",
isbn = "9781450311649",
booktitle = "Proceedings of the 5th Workshop on Social Network Systems, SNS'12",

}

TY - GEN

T1 - Social piggybacking

T2 - Leveraging common friends to generate event streams

AU - Gionis, Aristides

AU - Junqueira, Flavio

AU - Leroy, Vincent

AU - Serafini, Marco

AU - Weber, Ingmar

PY - 2012/5/14

Y1 - 2012/5/14

N2 - Social networking systems present users with online event streams that include recent activities of their friends. Materialized per-user views are a common way to generate such event streams on-line and with low latency. We propose improving throughput by using social piggybacking: process the requests of two friends by just querying and updating the view of a third common friend. By using one such hub view, the system can serve requests of the first friend without querying nor updating the view of the second. This reduces the overall load on views, and can be implemented with minimal adaptations by existing social networking architectures. We show that, given a social graph, there exist hub-based schedules that minimize the overall number of view requests, but computing them is NP-hard. We propose a heuristic to solve the problem and evaluate it using samples from the Twitter and Flickr social graphs. The evaluation shows that existing solutions generate up to 2.4 times the amount of view requests induced by our heuristic.

AB - Social networking systems present users with online event streams that include recent activities of their friends. Materialized per-user views are a common way to generate such event streams on-line and with low latency. We propose improving throughput by using social piggybacking: process the requests of two friends by just querying and updating the view of a third common friend. By using one such hub view, the system can serve requests of the first friend without querying nor updating the view of the second. This reduces the overall load on views, and can be implemented with minimal adaptations by existing social networking architectures. We show that, given a social graph, there exist hub-based schedules that minimize the overall number of view requests, but computing them is NP-hard. We propose a heuristic to solve the problem and evaluate it using samples from the Twitter and Flickr social graphs. The evaluation shows that existing solutions generate up to 2.4 times the amount of view requests induced by our heuristic.

KW - social dissemination

KW - social piggybacking

UR - http://www.scopus.com/inward/record.url?scp=84860746207&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84860746207&partnerID=8YFLogxK

U2 - 10.1145/2181176.2181184

DO - 10.1145/2181176.2181184

M3 - Conference contribution

SN - 9781450311649

BT - Proceedings of the 5th Workshop on Social Network Systems, SNS'12

ER -