• 论文 •    

移动数据库的视图增量更新算法

林怀忠,周波,郑增威,陈纯   

  1. 1.浙江大学计算机学院,浙江杭州310027;2.浙江大学城市学院,浙江杭州310015
  • 出版日期:2004-03-15 发布日期:2004-03-25

Incremental View Update Algorithm in Mobile Databases

LIN Huai-zhong, ZHOU Bo, ZHENG Zeng-wei, CHEN Chun   

  1. 1.Coll. of Computer Science, Zhejiang Univ., Hangzhou310027,China;2.City Coll., Zhejiang Univ., Hangzhou310015,China
  • Online:2004-03-15 Published:2004-03-25

摘要: 在移动数据库中,数据缓存普遍采取实体化视图的方式,数据更新通过传输增量部分,以降低对网络带宽的要求。但是,以前的增量更新算法在无线带宽急剧下降的情况下,会引起数据更新的效率下降或无法完成任务。针对数据实时性要求较高的应用,提出了一个基于优先级的增量更新算法,根据数据的动态新鲜度进行排队,保证优先级高的数据先传输给移动计算机,从而提高了数据的传输效率和新鲜度。

关键词: 移动数据库, 实体化视图, 增量更新, 实时性, 新鲜度

Abstract: In mobile databases, data caching take the form of materialized views. Data is updated by communicating only the incremental part to reduce the demand for network bandwidth. But previous incremental update algorithms may be inefficient or cannot accomplish data update tasks when the wireless bandwidth drops dramatically. In the paper, a priority-based incremental update algorithm is proposed for real-time applications in mobile databases. The algorithm orders data items by dynamic freshness and transfers data to mobile computers according to the priority. The algorithm improves communication efficiency and data freshness when the wireless bandwidth is low and tends to vary widely.

Key words: mobile database, materialized view, incremental update, real-time, freshness

中图分类号: