Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach

Summary: Disk-based, tree-structured index for single-source distance queries in massive graphs, leveraging vertex-cover partitioning to enable I/O-efficient query processing. I/O-efficient construction algorithm with explicit CPU/I/O bounds; validated on real-world large graphs, showing scalable performance. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 4545
Venue: SIGMOD
Year: 2012
Pagerank: 6.4795399e-05
Overall Rank: 4,067 | 71.71%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 12 of 12 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,024	Path Problems in Temporal Graphs	2014	VLDB	0.00014609643
1,171	Blogel: A Block-Centric Framework for Distributed Computation on Real-World Graphs	2014	VLDB	0.00013511313
1,838	IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying	2013	VLDB	0.00010349881
1,880	TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph	2013	SIGMOD	0.00010226347
2,529	Pregelix: Big(ger) Graph Analytics on A Dataflow Engine	2015	VLDB	8.5940768e-05
2,756	K-Reach: Who is in Your Small World	2012	VLDB	8.1682536e-05
2,927	Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees	2014	VLDB	7.8823626e-05
3,342	P2H: Efficient Distance Querying on Road Networks by Projected Vertex Separators	2021	SIGMOD	7.197276e-05
4,193	Relative Subboundedness of Contraction Hierarchy and Hierarchical 2-Hop Index in Dynamic Road Networks	2022	SIGMOD	6.37019e-05
4,430	Finding the Cost-Optimal Path with Time Constraint over Time-Dependent Graphs	2014	VLDB	6.1942479e-05
5,932	Hub Labeling for Shortest Path Counting	2020	SIGMOD	5.2670741e-05
7,673	Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling	2017	SIGMOD	4.6826056e-05

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
376	TEDI: Efficient Shortest Path Query Answering on Graphs	2010	SIGMOD	0.00025097452
686	Finding Maximal Cliques in Massive Networks by H*-graph	2010	SIGMOD	0.00018178029

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
1,777	Reachability Queries on Large Dynamic Graphs: A Total Order Approach	2014	SIGMOD	0.00010589591
10,075	Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach	2026	SIGMOD	4.1945683e-05
2,201	When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks	2018	SIGMOD	9.3048105e-05
1,823	Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks	2014	VLDB	0.00010413508
5,035	Scaling Up Distance Labeling on Graphs with Core-Periphery Properties	2020	SIGMOD	5.7470184e-05
506	On Graph Query Optimization in Large Networks	2010	VLDB	0.00021475362
7,444	Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach	2022	VLDB	4.7281454e-05
9,483	I/O Efficient Label-Constrained Reachability Queries in Large Graphs	2024	VLDB	4.3341665e-05
5,597	Efficient Shortest Path Counting on Large Road Networks	2022	VLDB	5.4178241e-05
788	Efficiently Answering Reachability Queries on Very Large Directed Graphs	2008	SIGMOD	0.00016650034