Database Cache Management Algorithms of a Timing Constrained Database System in Mobile Computing Environments

Yuji WADA; Tadanori MIZUNO

Database Cache Management Algorithms of a Timing Constrained Database System in Mobile Computing Environments

Yuji WADA, Tadanori MIZUNO

Full Text Views

0

Share
Cite this

Summary :

In this paper, we propose a timing constrained database system which accesses a database at a host computer via a mobile support server with a wireless portable computer running in mobile computing environments, so that we can provide seamless database access between a communication cell and the host computer even if the user of the portable computer moves from one communication cell to another. Then, we also provide some new kind of database cache algorihm, such as all-cell-cache, neighbour-cell-cache, 1-cell-skip-cache, 2-cell-skip-cache and 3-cell-skip-cache methods, each of which manages the data downloading and uploading among the host database and some cell databases at the mobile support servers so as to minimize the database access fault probability when the user moves from one communication cell to another. And, we show the averaged database access time and the averaged database cache hit ratio which are computed by simulating each of the above database cache algorithms with random variables generation method. Finally, we conclude that each above cache alogorithm is advantageous to the database in mobile computineg einvironments.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E79-A No.7 pp.1027-1033

Publication Date: 1996/07/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on Multi-dimensional Mobile Informatin Network)

Category

Cite this

Copy

Yuji WADA, Tadanori MIZUNO, "Database Cache Management Algorithms of a Timing Constrained Database System in Mobile Computing Environments" in IEICE TRANSACTIONS on Fundamentals, vol. E79-A, no. 7, pp. 1027-1033, July 1996, doi: .
Abstract: In this paper, we propose a timing constrained database system which accesses a database at a host computer via a mobile support server with a wireless portable computer running in mobile computing environments, so that we can provide seamless database access between a communication cell and the host computer even if the user of the portable computer moves from one communication cell to another. Then, we also provide some new kind of database cache algorihm, such as all-cell-cache, neighbour-cell-cache, 1-cell-skip-cache, 2-cell-skip-cache and 3-cell-skip-cache methods, each of which manages the data downloading and uploading among the host database and some cell databases at the mobile support servers so as to minimize the database access fault probability when the user moves from one communication cell to another. And, we show the averaged database access time and the averaged database cache hit ratio which are computed by simulating each of the above database cache algorithms with random variables generation method. Finally, we conclude that each above cache alogorithm is advantageous to the database in mobile computineg einvironments.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e79-a_7_1027/_p

Copy

@ARTICLE{e79-a_7_1027,
author={Yuji WADA, Tadanori MIZUNO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Database Cache Management Algorithms of a Timing Constrained Database System in Mobile Computing Environments},
year={1996},
volume={E79-A},
number={7},
pages={1027-1033},
abstract={In this paper, we propose a timing constrained database system which accesses a database at a host computer via a mobile support server with a wireless portable computer running in mobile computing environments, so that we can provide seamless database access between a communication cell and the host computer even if the user of the portable computer moves from one communication cell to another. Then, we also provide some new kind of database cache algorihm, such as all-cell-cache, neighbour-cell-cache, 1-cell-skip-cache, 2-cell-skip-cache and 3-cell-skip-cache methods, each of which manages the data downloading and uploading among the host database and some cell databases at the mobile support servers so as to minimize the database access fault probability when the user moves from one communication cell to another. And, we show the averaged database access time and the averaged database cache hit ratio which are computed by simulating each of the above database cache algorithms with random variables generation method. Finally, we conclude that each above cache alogorithm is advantageous to the database in mobile computineg einvironments.},
keywords={},
doi={},
ISSN={},
month={July},}

Copy

TY - JOUR
TI - Database Cache Management Algorithms of a Timing Constrained Database System in Mobile Computing Environments
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1027
EP - 1033
AU - Yuji WADA
AU - Tadanori MIZUNO
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E79-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 1996
AB - In this paper, we propose a timing constrained database system which accesses a database at a host computer via a mobile support server with a wireless portable computer running in mobile computing environments, so that we can provide seamless database access between a communication cell and the host computer even if the user of the portable computer moves from one communication cell to another. Then, we also provide some new kind of database cache algorihm, such as all-cell-cache, neighbour-cell-cache, 1-cell-skip-cache, 2-cell-skip-cache and 3-cell-skip-cache methods, each of which manages the data downloading and uploading among the host database and some cell databases at the mobile support servers so as to minimize the database access fault probability when the user moves from one communication cell to another. And, we show the averaged database access time and the averaged database cache hit ratio which are computed by simulating each of the above database cache algorithms with random variables generation method. Finally, we conclude that each above cache alogorithm is advantageous to the database in mobile computineg einvironments.
ER -