HIERARCHICAL ENCODED PATH VIEW APPROACH AND ITS EVALUATION
Jing Ning, Yun-Wu Huang, Elke Angelika Rundensteiner · 1995
This paper proposes an approach towards optimizing shortest path queries by using a hierarchical graph model. The solution corresponds to a hierarchical encoded path view (HEPV) that partially encodes hierarchical paths. The HEPV approach reduces the view encoding time view updating time and storage requirements. Efficient path computation is a key requirement for many advanced database applications including Intelligent Transportation Systems (ITS) knowledge-based systems, and network routing.