Abstract
In broadband networks, appropriate use of database migration can drastically shorten the average transaction processing time of a distributed database system. In previous work, we have proposed a transaction processing method based on database migration, in which we assumed that the network bandwidth is very broad and almost uniform over the whole network. However, WANs consist of various types of networks, including private LANs, narrowband public networks and broadband backbones; thus, that method cannot be applied directly in WAN environments. In this paper, we propose a database migration scheduling method which gives the shortest communication time for database operations, and is suitable for use in WANs. We also prove that the proposed method can find the database migration schedule which gives the shortest communication time for a given access sequence.
This research was supported in part by Research for the Future Program of Japan Society for the Promotion of Science under the Project “Advanced Multimedia Content Processing (JSPS-RFTF97P00501)”.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Acharya, S. and Zdonik, S.B., “An Efficient Scheme for Dynamic Data Replication,” Technical Report CS-93-43, Brown University, Providence, RI (Sept. 1993).
Banerjee, S., Li, V.O.K., and Wang, C., “Distributed Database Systems in High-Speed Wide-Area Networks,” IEEE Journal on Selected Areas in Commun., Vol. 11, No. 4, pp. 617–630 (May 1993).
Banerjee, S. and Chrysanthis, P.K., “Network latency optimizations in distributed database systems,” Proc. of 14th Int’l Conf. on Data Engineering (ICDE’98), pp. 532–540 (Feb. 1998).
DeWitt, D., Katz, R., Olken, F., Shapiro, L., Stonebraker, M., and Wood, D., “Implementation Techniques for Main Memory Database Systems,” Proc. of ACM SIGMOD’84, pp. 1–8 (June 1984).
Garcia-Molina, H., Lipton, R.J., and Valdes, J., “A Massive Memory Machine,” IEEE Trans. Comput., Vol. C-33, pp. 391–399 (May 1984).
Hara, T., Harumoto, K., Tsukamoto, M., and Nishio, S., “Database Migration: A New Architecture for Transaction Processing in Broadband Networks,” IEEE Trans. on Knowledge and Data Engineering, Vol. 10, No. 5, pp. 839–854 (Sept./Oct. 1998).
Hara, T., Harumoto, K., Tsukamoto, M., and Nishio, S., “DB-MAN: A Distributed Database System Based on Database Migration in ATM Networks,” Proc. of 14th Int’l Conf. on Data Engineering (ICDE’98), pp. 522–531 (Feb. 1998).
Hara, T., Harumoto, K., Tsukamoto, M., and Nishio, S., “Main Memory Database for Supporting Database Migration,” Proc. of IEEE Pacific Rim Conf. on Communications, Computers and Signal Processing (IEEE PACRIM’ 97), Vol. 1, pp. 231–234 (Aug. 1997).
Herman, G., Gopal, G., Lee, K., and Weinrib, A., “The Datacycle Architecture for Very High Throughput Database Systems,” Proc. of ACM SIGMOD’87, pp. 97–103 (1987).
Stonebraker, M., Aoki, P.M., Devine, R., Litwin, W., and Olson, M., “Mariposa: A New Architecture for Distributed Data,” Proc. of 10th Int’l Conf. on Data Engineering (ICDE’94), pp. 54–65 (1994).
Wolfson, O. and Jajodia, S., “Distributed Algorithms for Dynamic Replication of Data,” Proc. of ACM PODS’92, pp. 149–163 (June 1992).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hara, T., Tsukamoto, M., Nishio, S. (2000). Database Migration in WAN Environments: How Can It Earn Good Performance?. In: Ibrahim, M., Küng, J., Revell, N. (eds) Database and Expert Systems Applications. DEXA 2000. Lecture Notes in Computer Science, vol 1873. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44469-6_8
Download citation
DOI: https://doi.org/10.1007/3-540-44469-6_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67978-3
Online ISBN: 978-3-540-44469-5
eBook Packages: Springer Book Archive