SCALABLE UPDATE PROPAGATION IN PARTIALLY REPLICATED, DISCONNECTED CLIENT SERVER DATABASES
Liton Chakraborty, Ajit singh, Kshirasagar Naik
2006
Abstract
Modern databases allow mobile clients, that subscribe to replicated data, to process the replica forgoing continuous connectivity, and to receive the updates while connected to the server. Based on the overlap in client interest pattern, the server can do update processing for manageable number of data-groups instead of per-client basis, and hence decouple the update processing cost from the client population. In this paper, we propose an efficient update propagation method that can be applied to a relational database system irrespective of its inherent data organization. We present computationally efficient algorithms for group design and maintenance based on a heuristic function. We provide experimental results that demonstrate that our approach achieves a significant increase in overall scalability over the client-centric approach.
References
- Badrinath, B. R. (1999). An architecture for mobile Databases. Department of Computer Science Technical Report DCS-TR-531, Rutgers University, New Jersy.
- Bernstein, P. A., Hadzilacos, V., and Goodman, N. (1987). Concurrency Control and Recovery in Distributed Database Systems. Addison Wesley, Reading, Massachusetts.
- Breitbart, Y. and Korth, H. F. (1997). Replication and consistency: Being lazy helps sometimes. Proceedings of ACM SIGMOD.
- Chakraborty, L., Singh, A., and Naik, S. (2002). An Efficient Vertical Partitioning Algorithm for Partially replicated Database in Disconnected Environment. Report, Network Programming Lab, Dept. of Electrical & Computer Engineering, University of Waterloo.
- Chakraborty, L., Singh, A., and Naik, S. (2004). Pruning update log files in intermittently connected databases. proceedings of the Third International Workshop on Wireless Information Systems, pages 63-72.
- Daudjee, K. and Salem, K. (2004). Lazy database replication with freshness gaurantees. Proceedings of ICDE.
- Davidson, S. B. (1984). Optimism and consistency in partitioned distributed database systems. ACM Transactions on Database Systems, 9(3):456-481.
- Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., and Terry, D. (1987). Epidemic algorithms for replicated database maintenance. Proceedings of the Sixth Symposium on Principles of Distributed Computing, pages 1-12.
- Demers, A., Peterson, K., Spreitzer, M., Theimer, M., and Welch, B. (1994). The bayou architecture: Support for data sharing among mobile users. Proceedings of Mobile Computing Systems and Applications.
- Diener, A. R., Bragger, R., Dudler, A., and Zehnder, C. A. (1985). Replicating and allocating data is a distributed database system for workstations. ACM Symposium on Small Systems, pages 5-9.
- Gray, J., Holland, P., O'Neil, P., and Shasha, D. (1996). The dangers of replication and a solution. Proceedings of ACM SIGMOD, pages 173-182.
- Gross, J. and Yellen, J. (1999). Graph theory and its application. CRC Press, Boca Raton.
- Gupta, A. and Mumick, I. S. (1995). Maintenance of materialized views: Problems, techniques, and applications. IEEE Data Engineering Bulletin, 18:3-18.
- Mahajan, S., Donahoo, M., Navathe, S., and Ammar, M. (1998). Grouping techniques for update propagation in termittently connected databases. Proceedings of Fourteenth International Conference on Data Engineering, pages 45-53.
- Ng, S. (1998). Advances in disk technology: performance issues. IEEE Computer, 31(5):75-81.
- Nievergelt, J. and Hinterberger, H. (1984). The grid file: An adaptable, symmetric multiple key file structure. ACM transactions on Database Systems, 9(1):38-71.
- Pacitti, E., Minet, P., and Simon, E. (1999). Fast algorithms for maintaining replica consistency in lazy master replicated databases. Proceedings of the Twenty fifth International Conference on Very Large Data Bases, pages 126-137.
- Pacitti, E. and Simon, E. (2000). Update propagation strategies to improve freshness in lazy master replicated databases. VLDB Journal, 8:305-318.
- Peterson, K., Spreitzer, M. J., Terry, D. B., Theimer, M. M., and Demers, A. J. (1997). flexible update propagation for weakly consistent replication. Proceedings of Sixteenth ACM Symposium on Operating Systems Principles, pages 288-301.
- Rabinovich, M., Gehani, N., and Kononov, A. (1996). Scalable update propagation in epidemic replicated databases. Prococeedings of International Conference on extending database technology.
- Satyanarayanan, M., Kistler, J. J., Mummert, L. B., Ebling, M. R., Kumar, P., and Liu, Q. (1993). Experience with disconnected operation in a mobile environment. Proceedings of USENIX Symposium on Mobile and Location-Independent Computing.
- Tanenbaum, A. S. (1996). Prentice Hall.
- Yee, W. G., Donahoo, M. J., Omiecinski, E., and Navathe, S. (2001). Scaling replica maintenance in intermittently synchronous mobile databases. Proceedings of CIKM, pages 450-457.
Paper Citation
in Harvard Style
Chakraborty L., singh A. and Naik K. (2006). SCALABLE UPDATE PROPAGATION IN PARTIALLY REPLICATED, DISCONNECTED CLIENT SERVER DATABASES . In Proceedings of the Eighth International Conference on Enterprise Information Systems - Volume 1: ICEIS, ISBN 978-972-8865-41-2, pages 11-21. DOI: 10.5220/0002490000110021
in Bibtex Style
@conference{iceis06,
author={Liton Chakraborty and Ajit singh and Kshirasagar Naik},
title={SCALABLE UPDATE PROPAGATION IN PARTIALLY REPLICATED, DISCONNECTED CLIENT SERVER DATABASES},
booktitle={Proceedings of the Eighth International Conference on Enterprise Information Systems - Volume 1: ICEIS,},
year={2006},
pages={11-21},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002490000110021},
isbn={978-972-8865-41-2},
}
in EndNote Style
TY - CONF
JO - Proceedings of the Eighth International Conference on Enterprise Information Systems - Volume 1: ICEIS,
TI - SCALABLE UPDATE PROPAGATION IN PARTIALLY REPLICATED, DISCONNECTED CLIENT SERVER DATABASES
SN - 978-972-8865-41-2
AU - Chakraborty L.
AU - singh A.
AU - Naik K.
PY - 2006
SP - 11
EP - 21
DO - 10.5220/0002490000110021