Piggybacking on Social Networks

Summary: Proposes social piggybacking to serve two friends' requests via a shared hub view, reducing updates and queries. NP-hard; offers an O(log n) approximation and a heuristic, with large-scale Twitter/Flickr tests showing up to 2× throughput. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 10706
Venue: VLDB
Year: 2013
Pagerank: 7.136763e-05
Overall Rank: 3,403 | 76.33%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
2,039	Local Algorithms for Hierarchical Dense Subgraph Discovery	2019	VLDB	9.7061003e-05
2,512	Fast Hierarchy Construction for Dense Subgraphs	2017	VLDB	8.6196023e-05
2,909	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB	7.9305767e-05
3,005	Clay: Fine-Grained Adaptive Partitioning for General Database Schemas	2017	VLDB	7.7303579e-05
3,575	Finding Locally Densest Subgraphs: A Convex Programming Approach	2022	VLDB	6.9528126e-05
9,403	A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery	2024	SIGMOD	4.3441378e-05
9,557	An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery	2024	SIGMOD	4.3254416e-05
10,072	Efficient and Scalable Directed Densest Subgraph Discovery	2026	SIGMOD	4.1945683e-05
10,681	Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory	2025	VLDB	4.1945683e-05
11,410	Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques	2022	VLDB	4.1945683e-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,139	Feeding Frenzy: Selectively Materializing Users' Event Feeds	2010	SIGMOD	0.00013725337

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
90	A Data-Based Approach to Social Influence Maximization	2012	VLDB	0.00052068982
10,710	Approximate 2-hop neighborhoods on incremental graphs: An efficient lazy approach	2025	VLDB	4.1945683e-05
1,665	The More the Merrier: Efficient Multi-Source Graph Traversal	2015	VLDB	0.00010967716
11,793	Efficient Computation of Feedback Arc Set at Web-Scale	2017	VLDB	4.1945683e-05
9,282	Hybrid Pulling/Pushing for I/O-Efficient Distributed and Iterative Graph Computing	2016	SIGMOD	4.3634964e-05
7,129	Scalable Social Coordination with Group Constraints using Enmeshed Queries	2013	CIDR	4.8228141e-05
9,712	Maximizing Fair Content Spread via Edge Suggestion in Social Networks	2022	VLDB	4.299267e-05
3,232	Managing Large Dynamic Graphs Efficiently	2012	SIGMOD	7.336861e-05
9,550	Supporting Distributed Feed-Following Apps over Edge Devices	2013	VLDB	4.325612e-05
3,032	An efficient reconciliation algorithm for social networks	2014	VLDB	7.6762757e-05