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: h2b91b4a9bf699a28
Venue: VLDB
Year: 2013
Pagerank: 7.8780984e-05
Overall Rank: 2,905 | 80.47%
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 11 of 11 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,443	Local Algorithms for Hierarchical Dense Subgraph Discovery	2019	VLDB	0.00010635542
2,042	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB	9.1416822e-05
2,119	Fast Hierarchy Construction for Dense Subgraphs	2017	VLDB	9.0102885e-05
2,288	Clay: Fine-Grained Adaptive Partitioning for General Database Schemas	2017	VLDB	8.6912082e-05
3,064	Finding Locally Densest Subgraphs: A Convex Programming Approach	2022	VLDB	7.6898682e-05
7,807	A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery	2024	SIGMOD	5.4495451e-05
8,963	An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery	2024	SIGMOD	5.2486992e-05
10,562	Efficient and Scalable Directed Densest Subgraph Discovery	2026	SIGMOD	4.9793485e-05
10,808	Efficient Locally h-Clique Densest Subgraph Discovery via Divide-and-Conquer	2026	VLDB	4.9793485e-05
11,321	Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory	2025	VLDB	4.9793485e-05
11,916	Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques	2022	VLDB	4.9793485e-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,701	Feeding Frenzy: Selectively Materializing Users' Event Feeds	2010	SIGMOD	9.8371359e-05

Semantically Similar Papers

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