The distance label compression unit preserves acceptability, the graph shortest path search system uses this compression unit, and the graph shortest path search method is implemented by this system.

Abstract

The invention relates to a distance label compressor that preserves acceptability, a graph shortest path search system using this compressor, and a method implemented by this system. The compressor is configured to compress distance labels from a set of K₀ teacher landmarks into m-dimensional compressed labels, where m < K₀. The compressor comprises a module for receiving teacher labels, a module for generating a selection matrix or a row-constrained merge matrix, a module for generating compression labels, and a module for calculating a compression estimator function. The selection matrix or merge matrix has non-negative elements and the sum of the elements in each row does not exceed 1, thereby preserving acceptability.

Images