Dynamic Data Allocation Method considering Communication Cost in Distributed Database Systems

2 Citations 5 References
  • KUSABA Daisuke
    Department of Information and Computer Science, Faculty of Engineering Science Osaka University
  • TADA Harumasa
    Department of Information and Computer Science, Faculty of Engineering Science Osaka University
  • HIGUCHI Masahiro
    Department of Information and Computer Science, Faculty of Engineering Science Osaka University
  • FUJII Mamoru
    Department of Information and Computer Science, Faculty of Engineering Science Osaka University

Bibliographic Information

Other Title
  • 分散データベースにおける通信量を考慮した動的データ配置法

Search this article

Description

In distributed database systems, data allocation has a great influence on the communication cost. However, it is hard to know future data accesses in each site. Moreover, frequently accessed data in each site may change as time goes by. Therefore, it is difficult to determine the optimal data allocation statically. In this paper, we propose the dynamic data allocation in distributed databasa systems to suppress the communication cost. In order to evaluate usefulness of the proposed method, we compared the communication cost of it with that of an usual caching method through simulations. In addition, we examined how to introduce the multiversion concurrency control to suppress the communication cost by avoiding abortion of transactions.

Journal

  • IPSJ SIG Notes

    IPSJ SIG Notes 91 67-72, 1999-01-21

    Information Processing Society of Japan (IPSJ)

Citations (2)*help

See more

References(5)*help

See more

Details 詳細情報について

  • CRID
    1572824502059978880
  • NII Article ID
    110002938342
  • NII Book ID
    AN10116224
  • ISSN
    09196072
  • Text Lang
    ja
  • Data Source
    • CiNii Articles

Report a problem

Back to top