Authors: Jeng-Kuen Chiu, San-Yih Hwang
Tags: 1998, conceptual modeling
The location information of users can be replicated at various databases in a hierarchy to improve the efficiency of call lookups at the expense of increase in update and storage cost. In this paper, we systematically investigate this problem and propose two solutions. The first solution has optimal lookup and update cost, but the execution time could be exponential to the number of databases. The second solution makes some assumptions and then uses dynamic programming to tackle this problem. Its execution time is dramatically reduced with the result being less optimal. Finally, to further improve efficiency and reducing storage requirements, we propose the incorporation of clustering techniques.Read the full paper here: https://link.springer.com/chapter/10.1007/978-3-540-49121-7_24
