2026-06-09T20:54:38Z https://meral.edu.mm/oai

oai:meral.edu.mm:recid/4730 2021-12-13T00:25:49Z 1582963302567:1597824273898 user-ucsy

Light Materialized Path View for Location Based Services Ohsawa, Yutaka Hlaing, Aye Thida This paper proposes a shortest path searchalgorithm based on materialized-path-viewconstructed only on partitioned subgraphs, and itsthree variations referring different levels of distancematerialization. A road network is partitioned into thesubgraphs, and the distance materialization isperformed only in the subgraphs. Therefore, theamount of pre-computed data is greatly reduced. Theshortest path is retrieved by a best-first-search using apriority queue. The difference between threevariations of the algorithm is the materialization levelof the distance in the subgraphs. The performance ofthem is evaluated comparing with A* algorithm andHEPV experimentally. Through the results, we showthe proposed algorithm outperforms the conventionalmethods. 2014-02-17 http://hdl.handle.net/20.500.12678/0000004730 https://meral.edu.mm/records/4730