Skip to main content
SpringerLink
Log in

An Adaptive Data-Shipping Architecture for Client Caching Data Management Systems

  • Published:
Distributed and Parallel Databases Aims and scope Submit manuscript

Abstract

Data-shipping is an important form of data distribution architecture where data objects are retrieved from the server, and are cached and operated upon at the client nodes. This architecture reduces network latency and increases resource utilization at the client. Object database management systems (ODBMS), file-systems, mobile data management systems, multi-tiered Web-server systems and hybrid query-shipping/data-shipping architectures all use some variant of the data-shipping. Despite a decade of research, there is still a lack of consensus amongst the proponents of ODBMSs as to the type of data shipping architectures and algorithms that should be used. The absence of both robust (with respect to performance) algorithms, and a comprehensive performance study comparing the competing algorithms are the key reasons for this lack of agreement. In this paper we address both of these problems. We first present an adaptive data-shipping architecture which utilizes adaptive data transfer, cache consistency and recovery algorithms to improve the robustness (with respect to performance) of a data-shipping ODBMS. We then present a comprehensive performance study which evaluates the competing client-server architectures and algorithms. The study verifies the robustness of the new adaptive data-shipping architecture, provides new insights into the performance of the different competing algorithms, and helps to overturn some existing notions about some of the algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. Adya, R. Gruber, B. Liskov, and U. Maheshwari, “Efficient optimistic concurrency control using loosely synchronized clocks,” in Proc. ACM SIGMOD International Conference on Management of Data, 1995, pp. 23–34.

  2. R. Agrawal, M. Carey, and M. Livny, “Concurrency control performance modeling: Alternatives and implications,” ACM Transactions on Database Systems, vol. 12, no. 4, pp. 609–654, 1987.

    Google Scholar 

  3. P. Bernstein, M. Brodie, S. Ceri, M. Franklin, et al., “Asilomar report,” SIGMOD Record, vol. 27, no. 4, pp. 74–80, 1998.

    Google Scholar 

  4. A. Biliris and E. Panagos, “A high performance configurable storage manager,” in Proceedings of ICDE, 1995, pp. 35–43.

  5. Q. Cao, J. Torrellas, and H. Jagadish, “Unified fine-granularity buffering of index and data: Approach and implementation,” in Proceedings of IEEE International Conference on Computer Design: VLSI in Computers and Processors, 2000, pp. 175–186.

  6. M. Carey, D. DeWitt, M. Franklin, N. Hall, et al., “Shoring up persistent applications,” in Proc.ACMSIGMOD International Conference on Management of Data, 1994, pp. 383–394.

  7. M. Carey, D. DeWitt, and J. Naughton, “The OO7 benchmark,” in Proc. ACM SIGMOD International Conference on Management of Data, 1993, pp. 12–21.

  8. M. Carey, M. Franklin, M. Livny, and E. Shekita, “Data caching tradeoffs in client-serverDBMSarchitectures,” in Proc. ACM SIGMOD International Conference on Management of Data, 1991, pp. 357–366.

  9. M. Carey, M. Franklin, and M. Zaharioudakis, “Fine grained sharing in a page server OODBMS,” in Proc. ACM SIGMOD International Conference on Management of Data, 1994, pp. 359–370.

  10. M. Castro, A. Adya, B. Liskov, and A. Myers, “HAC: Hybrid adaptive caching for distributed storage systems,” in Proceedings of ACM Symposium on Operating System Principles, 1997, pp. 102–115.

  11. D. DeWitt, P. Futtersack, D. Maier, and F. Velez, “A study of three alternative workstation-server architectures for OODBS,” in Proc. 16th International Conference on Very Large Data Bases, 1990, pp. 107–121.

  12. M. Franklin, M. Carey, and M. Livny, “Global memory management in client-server DBMS,” in Proc. 16th International Conference on Very Large Data Bases, 1992, pp. 596–609.

  13. M. Franklin, M. Carey, and M. Livny, “Transactional client-server cache consistency: Alternatives and performance,” ACM Transactions on Database Systems, vol. 22, no. 3, pp. 315–363, 1997.

    Google Scholar 

  14. M. Franklin, M. Zwilling, C. Tan, M. Carey, and D. DeWitt, “Crash recovery in client-server EXODUS,” in Proc. ACM SIGMOD International Conference on Management of Data, 1992, pp. 165–174.

  15. C. Gerlhof and A. Kemper, “A multi-threaded architecture for prefetching in object bases,” in Proc. 4th EDBT Conference, 1994, pp. 351–364.

  16. S. Ghemawat, “The modified object buffer: A storage management technique for object-oriented databases,” Ph.D. thesis, MIT, 1995.

  17. J. Gray, “What next? A dozen remaining IT problems,” in Turing Award 1999 Lecture: www.research. microsoft. com/ gray/, 1999.

  18. J. Hamilton, “Networked data management design points,” in Proc. 25th International Conference on Very Large Data Bases, 1999, pp. 202–206.

  19. J. Karlsson, A. Lal, C. Leung, and T. Pham, “IBM DB2 everyplace: A small footprint relational database system,” in: Proc. 17th International Conference on Data Engineering, 2001, pp. 230–232.

  20. A. Kemper and D. Kossmann, “Dual-buffering strategies in object bases,” in Proc. 20th International Conference on Very Large Data Bases, 1994, pp. 427–438.

  21. W. Kim, J. Garza, N. Ballou, and D. Woelk, “Architecture of the ORION next-generation database system,” IEEE Transactions on Knowledge and Data Engineering, vol. 2, no. 13, pp. 109–124, 1990.

    Google Scholar 

  22. C. Lamb, G. Landis, J. Orenstein, and D. Weinreb, “The ObjectStore database system,” Communications of the ACM, vol. 34, no. 10, pp. 50–63, 1991.

    Google Scholar 

  23. B. Liskov, A. Adya, M. Castro, M. Day, et al., “Safe and efficient sharing of persistent objects in thor,” in Proc. ACM SIGMOD International Conference on Management of Data, 1996, pp. 318–329.

  24. Q. Luo, S. Krishnamurthy, C. Mohan, H. Pirahesh, H. Woo, B.G. Lindsay, and J.F. Naughton, “Middle-tier database caching for e-business,” in Proc. ACMSIGMOD International Conference on Management of Data, 2002, pp. 600–611.

  25. C. Mohan, D. Haderle, B. Lindsay, H. Pirahesh, and P. Schwarz, “ARIES: A transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging,” ACM Transactions on Database Systems, vol. 17, no. 1, pp. 94–162, 1992.

    Google Scholar 

  26. C. Mohan and I. Narang, “ARIES/CSA: A method for database recovery in client-server architectures,” in Proc. ACM SIGMOD International Conference on Management of Data, 1994, pp. 55–66.

  27. Objectivity, “White paper: Choosing an object database,” in www.objectivity.com/ObjectDatabase/WP/ Choosing/Choosing.html, 1998.

  28. J. O'Toole and L. Shrira, “Hybrid caching for large scale object systems,” in Proc. Workshop on Persistent Object Systems, 1994a, pp. 99–114.

  29. J. O'Toole and L. Shrira, “Opportunistic log: Efficient installation reads in reliable object server,” in Proc. 1st Usenix Symposium on Operating Systems Design and Implementation OSDI, 1994b, pp. 39–48.

  30. M.T. Özsu, K. Voruganti, and R. Unrau, “An asynchronous avoidance-based cache consistency algorithm for client caching DBMSs,” in Proc. 24th International Conference on Very Large Data Bases, 1998, pp. 440–451.

  31. E. Panagos, A. Biliris, H. Jagadish, and R. Rastogi, “Fine-granularity locking and client-based logging for distributed architectures,” in Proceedings of EDBT Conference, 1996, pp. 388–402.

  32. M. Tsangaris and J. Naughton, “On the performance of object clustering techniques,” in Proc. ACMSIGMOD International Conference on Management of data, 1992, pp. 144–153.

  33. Versant, “Versant delivers next generation suite of database products,” in http://www.versant.com, 1998.

  34. K. Voruganti, “An adaptive hybrid server architecture for client-caching ODBMSs,” Ph.D. thesis, University of Alberta, 2001.

  35. K. Voruganti, M.T. Özsu, and R. Unrau, “An adaptive hybrid server architecture for client caching ODBMSs,” in Proc. 25th International Conference on Very Large Data Bases, 1999, pp. 150–161.

  36. Y.Wang and L. Rowe, “Cache consistency and concurrency control in a client/server DBMS architecture,” in Proc. ACM SIGMOD International Conference on Management of Data, 1991, pp. 367–376.

  37. S. White and D. DeWitt, “QuickStore: A high performance mapped object store,” in Proc. ACM SIGMOD International Conference on Management of Data, 1994, pp. 395–406.

  38. S. White and D. DeWitt, “Implementing crash recovery in quickStore: A performance study,” in Proc. ACM SIGMOD International Conference on Management of Data, 1995, pp. 187–198.

  39. K. Wilkinson and M. Neimat, “Maintaining consistency of client-cached data,” in Proc. 16th International Conference on Very Large Data Bases, 1990, pp. 122–133.

Download references

Author information

Authors and Affiliations

  1. IBM Almaden Research Laboratory, San Jose, USA

    Kaladhar Voruganti

  2. School of Computer Science, University of Waterloo, Waterloo, Canada

    M. Tamer Özsu

  3. YottaYotta, Edmonton, Canada

    Ronald C. Unrau

Authors
  1. Kaladhar Voruganti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Tamer Özsu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ronald C. Unrau
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Voruganti, K., Özsu, M.T. & Unrau, R.C. An Adaptive Data-Shipping Architecture for Client Caching Data Management Systems. Distributed and Parallel Databases 15, 137–177 (2004). https://doi.org/10.1023/B:DAPD.0000013069.97679.62

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:DAPD.0000013069.97679.62

Search

Navigation