Skip to main content

Shared abstract data types: An algebraic methodology for their specification

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 364))

Abstract

In this paper a methodology for specifying data in a transaction system is proposed. We present the outline of a style of shared data definition, by which it is possible to avoid the unnecessary constraints on concurrency usually imposed by traditional transaction management approaches. The used method is based on the definition of the data as abstract data types in the well known algebraic method. The semantics of the data is given in two steps: the usual semantics of the operations and the specification of concurrency constraints among them. Uniformity in the semantics definition allows the user to employ semantic knowledge needed to exploit the maximum level of parallelism permitted by the expected notion of consistency on data.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

4. References

  1. A. Albano, L. Cardelli, O. Orsini, "Galileo: a strongly typed, interactive, conceptual language", ACM TODS, Vol. 10, No. 2, August 1985.

    Google Scholar 

  2. B. R. Badrinath, K. Ramamritham, "Synchronizing transactions on objects", IEEE Trans. on Comp., Vol. 37, No. 5, May 1988.

    Google Scholar 

  3. P.A. Bernstein, N. Goodman: "Concurrency Control in Distributed DatabaseSystems"; ACM Computing Surveys Vol. 13, No. 2, June 1981.

    Google Scholar 

  4. K. L. Chung, D. Rios-Zertuche, B. A. Nixon, J. Mylopoulos, "Process management and assertion enforcement for a semantic data model", EDBT '88, LNCS 303, Venice, March 1988.

    Google Scholar 

  5. M. Corti, "Algebraic specification and implementation of shared abstract data types", Th. Dissertation, forthcoming as Int. Rep., Comp. Sci. Dep., Univ. of Pisa.

    Google Scholar 

  6. H. Ehrig, B. Mahr, Fundamentals of algebraic specification 1, Springer-Verlag, Berlin 1985

    Google Scholar 

  7. K.P. Eswaran, J.N. Gray, et al.: "The notion of Consistency and Predicate Locks in a Database System"; Communications of the ACM Vol.19, No. 11, Nov 1976.

    Google Scholar 

  8. H. Garcia-Molina, "Using semantic knowledge for transaction processing in a distributed database", ACM Trans. Database Syst., 8, 2 (June 1983), pp. 186–213.

    Google Scholar 

  9. J.A. Goguen, J.W. Tatcher, E.G. Wagner "An initial algebra approach to the specification, correctness and implementation of abstract data types"; Recent trends in Programming methodology IV, (Yeh ed.) Prentice Hall 1978.

    Google Scholar 

  10. J.A. Goguen, Jose'Meseguer: "An initiality Primer" SRI International, Computer Science Laboratory, Menlo Park, CA

    Google Scholar 

  11. J. Gray, "A transaction model" IBM Res. Rept. RJ2895, IBM Research Lab., San Josè, Calif., Aug. 1980

    Google Scholar 

  12. M.P. Herlihy, J. M. Wing, "Axioms for concurrent objects", ACM 1987

    Google Scholar 

  13. H. F. Korth, "Locking primitives in database systems", J. ACM, Vol.30, January 1983, pp. 55–79.

    Google Scholar 

  14. H. F. Korth, G. D. Speegle, "Formal model of correctness without Serializability", ACM, 1988, pp. 379–386.

    Google Scholar 

  15. B. Lampson, "Atomic transactions", Distributed Systems: Architecture and implementation, LNCS 105, Springer-Verlag, Berlin 1981, pp. 246–265.

    Google Scholar 

  16. B. Liskov, R. Scheifler, "Guardians and actions: linguistic support for robust, distributed programs", ACM TOPLAS, Vol.5, No.3, July 1983, pp.381–444.

    Google Scholar 

  17. N. Lynch, M. Merrit, W. Weihl, A. Fekete "A theory of atomic transactions", ICDT '88, LNCS 326, Springer-Verlag, pp. 278–305.

    Google Scholar 

  18. J.E.B. Moss, "Nested transactions: an approach to reliable distributed computing", MIT Press, 1985.

    Google Scholar 

  19. P.M. Schwarz, A.Z. Spector, "Recovery of shared abstract types" CMU Rept, CMU-CS-83-151, Carnegie-Mellon University, Pittsburgh, Pa., Oct. 1983

    Google Scholar 

  20. P.M. Schwarz, A.Z. Spector, "Synchronizing shared abstract types", A.C.M. Trans. on Comp. systems Vol. 2, No. 3, Aug 1984.

    Google Scholar 

  21. A. Sernadas, C. Sernadas, "Object-oriented specification of databases: an algebraic approach", 13th VLDB Conf., Brighton 1987.

    Google Scholar 

  22. W. Weihl, B. Liskov, "Implementation of resilient, atomic data types" ACM TOPLAS, Vol.7, No.2, April 85, pp. 244–269.

    Google Scholar 

  23. G. Weikum, "A theoretical foundation of multi-level concurrency control, 5th ACM Symp. on PODS, 1986.

    Google Scholar 

  24. C. Beeri, H. J. Schek, G. Weikum, "Multi-level transaction management, Theoretical art or practical need?" EDBT '88, LNCS 303, Springer-Verlag, pp. 134–154.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

János Demetrovics Bernhard Thalheim

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bondavalli, A., De Francesco, N., Latella, D., Vaglini, G. (1989). Shared abstract data types: An algebraic methodology for their specification. In: Demetrovics, J., Thalheim, B. (eds) MFDBS 89. MFDBS 1989. Lecture Notes in Computer Science, vol 364. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51251-9_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-51251-9_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51251-6

  • Online ISBN: 978-3-540-46182-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics