A Memory Efficient Reachability Data Structure Through Bit Vector Compression

Summary: Memory-efficient reachability data structure for transitive closure using a novel bit-vector compression based on WAH with word partitions to exploit clustering of reachable vertices. Demonstrates tighter compactness than interval lists, fast membership tests, and scalability to graphs far larger than prior methods (Path-Tree/3-HOP) in experiments. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 4443
Venue: SIGMOD
Year: 2011
Pagerank: 0.00011395294
Overall Rank: 1,551 | 89.23%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Sebastiaan J. van Schaik
2. Oege de Moor

Incoming Citations (Sorted by Pagerank)

Showing 18 of 18 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,572	Query Preserving Graph Compression	2012	SIGMOD	0.00011296109
1,588	Druid: A Real-time Analytical Data Store	2014	SIGMOD	0.00011232949
1,776	Reachability Queries on Large Dynamic Graphs: A Total Order Approach	2014	SIGMOD	0.0001058029
1,879	TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph	2013	SIGMOD	0.00010227906
2,762	K-Reach: Who is in Your Small World	2012	VLDB	8.1614818e-05
3,130	SCARAB: Scaling Reachability Computation on Large Graphs	2012	SIGMOD	7.5054361e-05
3,221	Landmark Indexing for Evaluation of Label-Constrained Reachability Queries	2017	SIGMOD	7.3541078e-05
3,676	Simple, Fast, and Scalable Reachability Oracle	2013	VLDB	6.8500097e-05
4,478	Reachability Querying: An Independent Permutation Labeling Approach	2014	VLDB	6.1452192e-05
5,488	Microblog Entity Linking with Social Temporal Context	2015	SIGMOD	5.4798261e-05
5,548	Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs	2021	VLDB	5.4445937e-05
6,008	Compression of Uncertain Trajectories in Road Networks	2020	VLDB	5.2365238e-05
6,531	Labeling Workflow Views with Fine-Grained Dependencies	2012	VLDB	5.0196961e-05
6,796	Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond	2020	VLDB	4.9195203e-05
7,595	DAG Reduction: Fast Answering Reachability Queries	2017	SIGMOD	4.6980168e-05
8,667	Distributed Set Reachability	2016	SIGMOD	4.467539e-05
9,485	I/O Efficient Label-Constrained Reachability Queries in Large Graphs	2024	VLDB	4.3300131e-05
9,897	Top-k Relevant Semantic Place Retrieval on Spatial RDF Data	2016	SIGMOD	4.2559233e-05

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
255	Efficient Management of Transitive Relationships in Large Data and Knowledge Bases	1989	SIGMOD	0.00030342925
280	3-HOP: A High-Compression Indexing Scheme for Reachability Query	2009	SIGMOD	0.00029092277
784	Efficiently Answering Reachability Queries on Very Large Directed Graphs	2008	SIGMOD	0.00016648392
815	Direct Algorithms for Computing the Transitive Closure of Database Relations	1987	VLDB	0.0001629507

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
1,776	Reachability Queries on Large Dynamic Graphs: A Total Order Approach	2014	SIGMOD	0.0001058029
10,161	Enabling Efficient Direct Update on Rule-Based Compressed Graph	2026	SIGMOD	4.1905499e-05
885	Efficient Transitive Closure Algorithms	1988	VLDB	0.00015565543
7,595	DAG Reduction: Fast Answering Reachability Queries	2017	SIGMOD	4.6980168e-05
9,485	I/O Efficient Label-Constrained Reachability Queries in Large Graphs	2024	VLDB	4.3300131e-05
255	Efficient Management of Transitive Relationships in Large Data and Knowledge Bases	1989	SIGMOD	0.00030342925
784	Efficiently Answering Reachability Queries on Very Large Directed Graphs	2008	SIGMOD	0.00016648392
5,504	Mixed-Approach Algorithms for Transitive Closure	1991	PODS	5.4716648e-05
1,572	Query Preserving Graph Compression	2012	SIGMOD	0.00011296109
280	3-HOP: A High-Compression Indexing Scheme for Reachability Query	2009	SIGMOD	0.00029092277