An Efficient Implementation of Persistent Objects

  • Jacob Sparre Andersen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6106)

Abstract

Persistent objects form a general and very useful method for storing internal program data between executions of a program. And as  points out, Ada is an excellent language for implementing persistent objects. This paper introduces a low-impact, efficient implementation of persistent objects based on storage pools and the “POSIX.Memory_ Mapping” API . The performance and reliability of the implementation is compared with serialisation.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Card, M.P.: Why Ada is the right choice for object databases. CrossTalk (1997)Google Scholar
  2. 2.
    IEEE: IEEE STD 1003.5: 1990, Information Technology – POSIX Ada Language Interfaces Part 1: Binding for System Application Program Interface, as amended by IEEE STD 1003.5b: 1996, Amendment 1: Realtime Extensions (1996)Google Scholar
  3. 3.
    Crawley, S., Oudshoorn, M.: Orthogonal persistence and Ada. In: Proceedings of the conference on TRI-Ada 1994, pp. 298–308. ACM, New York (1994)CrossRefGoogle Scholar
  4. 4.
    The Open Group Base Specifications: mmap (2004), http://www.opengroup.org/onlinepubs/000095399/functions/mmap.html
  5. 5.
    Wikipedia, the free encyclopedia: Memory-mapped file (2010), http://en.wikipedia.org/wiki/Memory-mapped_file
  6. 6.
    García, R.G., Strohmeier, A., Keller, L.: Automatic Serialization of Dynamic Structures in Ada. Technical report, École Polytechnique Fédérale de Lausanne, Infoscience (2003)Google Scholar
  7. 7.
    Adalog: AdaControl (2009), http://www.adalog.fr/adacontrol2.htm

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Jacob Sparre Andersen
    • 1
  1. 1.Jacob Sparre Andersen Research & InnovationKøbenhavn VDanmark

Personalised recommendations