H-BRICK: Hierarchical Boundary Reachability Index with Compressed Kleene Closure for Directed Grid Graphs
Overview
This paper introduces H-BRICK, a method for efficient reachability queries on directed grid graphs. By partitioning the graph into tiles and computing local Boolean Kleene closures, H-BRICK projects summaries onto tile boundaries and composes them recursively. The authors prove the construction is exact within Boolean Kleene algebra. Experiments show that H-BRICK outperforms directed search and component-based baselines in storage efficiency and throughput, achieving up to 22.9x speedup in batched queries compared to scalar loops.
Generated from attributed reports · Updated 2 days ago
Event evidence and corrections
0 attributed source owners. Ownership does not establish independent confirmation. Quantities are reported separately and are never added together.
Reported quantity · throughput improvement: 5 other · Basis not reported · Differing source assertions
“ng endpoint lifts across many-source/many-target queries amortizes hierarchical traversal and, at k=64, yields a 5.0x-22.9x throughput improvement over the scalar query loop. The results show that hierarchical boundary compression is most advantageous in query-intensive spatial graphs where online search traverses large reachable regions and the hierarchy maintains compact boundary interfaces.”
Exact source · revision 1Source owner not reported
Reported quantity · throughput improvement: 22.9 other · Basis not reported · Differing source assertions
“ng endpoint lifts across many-source/many-target queries amortizes hierarchical traversal and, at k=64, yields a 5.0x-22.9x throughput improvement over the scalar query loop. The results show that hierarchical boundary compression is most advantageous in query-intensive spatial graphs where online search traverses large reachable regions and the hierarchy maintains compact boundary interfaces.”
Exact source · revision 1Source owner not reported
Reported quantity · query count: 64 other · Basis not reported
“ng endpoint lifts across many-source/many-target queries amortizes hierarchical traversal and, at k=64, yields a 5.0x-22.9x throughput improvement over the scalar query loop. The results show that hierarchical boundary compression is most advantageous in query-intensive spatial graphs where online search traverses large reachable regions and the hierarchy maintains compact boundary interfaces.”
Exact source · revision 1Source owner not reported
Report timeline
Follow attributed reports and material updates.
- arXiv Robotics — research abstractsSignalH-BRICK: Hierarchical Boundary Reachability Index with Compressed Kleene Closure for Directed Grid Graphs
This paper introduces H-BRICK, a method for efficient reachability queries on directed grid graphs. By partitioning the graph into tiles and computing local Boolean Kleene closures, H-BRICK projects summaries onto tile boundaries and composes them recursively. The authors prove the construction is exact within Boolean Kleene algebra. Experiments show that H-BRICK outperforms directed search and component-based baselines in storage efficiency and throughput, achieving up to 22.9x speedup in batched queries compared to scalar loops.
Timezone · UTC
Article dates follow your selected timezone. Briefing editions use Hong Kong time (UTC+8).