Piggybacking on Social Networks

Summary: Introduces social piggybacking: serving two friends’ feed requests via a shared hub’s materialized view, reducing datastore accesses. Hub selection is NP-hard; an O(log n) approximation and heuristic yield up to 2× throughput gains at scale on Twitter/Flickr graphs. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: 10894
Venue: VLDB
Year: 2013
Pagerank: 7.8919874e-05
Overall Rank: 2,985 | 79.53%
DOI: 10.14778/2536336.2536341

Incoming Non-self Citations Over Time

Authors

1. Aristides Gionis (Aalto University; Helsinki Institute for Information Technology)
2. Flavio Junqueira (Microsoft)
3. Vincent Leroy (University of Grenoble)
4. Marco Serafini (Qatar Computing Research Institute)
5. Ingmar Weber (Qatar Computing Research Institute)

BibTeX Citation

@article{gionis_vldb13,
        title = {{Piggybacking on Social Networks}},
        author = {Gionis, Aristides and Junqueira, Flavio and Leroy, Vincent and Serafini, Marco and Weber, Ingmar},
        journal = {PVLDB},
        series = {{VLDB} '13},
        volume = {6},
        number = {6},
        pages = {409--420},
        doi = {10.14778/2536336.2536341},
        url = {https://doi.org/10.14778/2536336.2536341},
        year = {2013}
}

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,416	Local Algorithms for Hierarchical Dense Subgraph Discovery	2019	VLDB	0.00010839488
2,024	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB	9.2907829e-05
2,083	Fast Hierarchy Construction for Dense Subgraphs	2017	VLDB	9.1976617e-05
2,363	Clay: Fine-Grained Adaptive Partitioning for General Database Schemas	2017	VLDB	8.6873235e-05
3,148	Finding Locally Densest Subgraphs: A Convex Programming Approach	2022	VLDB	7.707548e-05
9,519	A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery	2024	SIGMOD	5.2562724e-05
9,696	An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery	2024	SIGMOD	5.2351259e-05
10,363	Efficient and Scalable Directed Densest Subgraph Discovery	2026	SIGMOD	5.093636e-05
10,930	Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory	2025	VLDB	5.093636e-05
11,608	Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques	2022	VLDB	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
1,676	Feeding Frenzy: Selectively Materializing Users' Event Feeds	2010	SIGMOD	0.00010034449

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	296	A Data-Based Approach to Social Influence Maximization	2012	VLDB
2	1,432	The More the Merrier: Efficient Multi-Source Graph Traversal	2015	VLDB
3	10,954	Approximate 2-hop neighborhoods on incremental graphs: An efficient lazy approach	2025	VLDB
4	11,997	Efficient Computation of Feedback Arc Set at Web-Scale	2017	VLDB
5	9,424	Hybrid Pulling/Pushing for I/O-Efficient Distributed and Iterative Graph Computing	2016	SIGMOD
6	7,644	Scalable Social Coordination with Group Constraints using Enmeshed Queries	2013	CIDR
7	9,848	Maximizing Fair Content Spread via Edge Suggestion in Social Networks	2022	VLDB
8	3,109	Managing Large Dynamic Graphs Efficiently	2012	SIGMOD
9	9,714	Supporting Distributed Feed-Following Apps over Edge Devices	2013	VLDB
10	3,358	An efficient reconciliation algorithm for social networks	2014	VLDB