An orthogonally persistent Java

  • Authors:
  • M. P. Atkinson;L. Daynès;M. J. Jordan;T. Printezis;S. Spence

  • Affiliations:
  • Department of Computing Science, University of Glasgow, Scotland;Department of Computing Science, University of Glasgow, Scotland;Sun Microsystems Laboratories, Mountain View, CA;Department of Computing Science, University of Glasgow, Scotland;Department of Computing Science, University of Glasgow, Scotland

  • Venue:
  • ACM SIGMOD Record
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

The language Java is enjoying a rapid rise in popularity as an application programming language. For many applications an effective provision of database facilities is required. Here we report on a particular approach to providing such facilities, called “orthogonal persistence”. Persistence allows data to have lifetimes that vary from transient to (the best approximation we can achieve to) indefinite. It is orthogonal persistence if the available lifetimes are the same for all kinds of data. We aim to show that the programmer productivity gains and possible performance gains make orthogonal persistence a valuable augmentation of Java.