School zones, speed-limit segments, no-parking intervals are typically stored as coordinate polygons — 80–160 floating-point values per zone, requiring spatial joins at every query. Under BSI, each zone reduces to 8–12 integers and every query becomes an integer comparison. A 0-cell / 1-cell / 2-cell topological attribute schema for the entire Korean address system.
Standard routing graphs split intersection nodes for every constraint — turn restriction, time-of-day, vehicle class. Node count grows multiplicatively. The Dual Graph encodes constraints as edge attributes; node count stays fixed. On Seoul: intra-district routing in 0.9 ms, cross-district hierarchical routing in 3.84 ms — 5.3× faster than flat Dijkstra.
The Korean Road Name Address Act mandates a monotonically increasing integer along every named road. That sequence is formally an ISO 19148 Linear Reference System measure — but has never been used as one. Activating it gives O(1) integer-arithmetic distance, a Dual Graph that scales over 100× better under routing constraints, and 24 ms district-level routing on commodity hardware.