Orthogonal Persistence Revisited

Dearle, Alan; Kirby, Graham N. C.; Morrison, Ronald

doi:10.1007/978-3-642-14681-7_1

Cited by 13 publications

(25 citation statements)

References 26 publications

(32 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Grasshopper was an operating system that provided support for Orthogonal Persistence so no modifications to Java were needed in order to add persistence. It was sufficient to instantiate "the entire Java machine within a persistent address space" [Dearle et al, 2009]. Although this solution does not strictly comply with our request to address the problem at a language level, it is interesting because show that other approaches are possible.…”

Section: Persistent Javamentioning

confidence: 98%

“…It is worth reporting the footnote regarding the principle of persistence identification written by Morrison in [Dearle et al, 2009]. He stated that the experience showed that the only mechanism for implementation was persistence by reachability, also known as transitive persistence.…”

Section: Orthogonal Persistencementioning

confidence: 99%

“…In the former program an object is associated in the store to the string sp1. public class SaveSpag { public static void main (String[] args) { Spaghetti sp1 = new Spaghetti(27); Spaghetti sp2 = new Spaghetti(5); sp1.add("Pesto"); sp1.add("Pepper"); sp2.add("Quattro Fromaggio"); 9 try { PJavaStore pjs = PJavaStore.getStore(); pjs.newPRoot("Spag1", sp1); } catch (PJSException e) { ... } } } 6 Previously reported in [Dearle et al, 2009]. 7 It was formerly known as PJava, but then that name was reserved for Personal Java, as reported in [Jordan and Atkinson, 1998].…”

Section: Persistent Javamentioning

confidence: 99%

“…In listing 2.1 an example from [Dearle et al, 2009] is shown to give a flavour of the language. The code fragment show how to add an element to a database: the procedure s.enter store the person p in the table table with the key "al".…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Spray: programming with a persistent distributed heap

Grandi

2016

Companion Proceedings of the 2016 ACM SIGPLAN International Conference on Systems, Programming, Languages and Applications: Sof

View full text Add to dashboard Cite

We introduce a programming paradigm for distributed applications based on a persistent distributed heap. A proof-of-concept implementation is provided as a JavaScript library, together with several examples that embody popular patterns for web applications.To those I love, especially to my grandmother Rita, my brother Leonardo, and Carlotta. AcknowledgementsThis work would have been much harder, and surely longer, without the contributions and help I received from many people. I would especially like to thank my supervisors Vincenzo Gervasi and Antonio Cisternino who encouraged me to investigate persistence and distribution in programming languages. The conversations I had with them laid the groundwork of my thesis and helped me during its development.I believe that a valuable contribution to this work comes from Vincenzo Gervasi, who gave me advice on how to write a scientific paper and suggested I adopt a shallow approach to persistence.I thank Andrea Canciani, who gave me his previous research proposal about persistence. It was a good starting point for my study on the stateof-the-art of persistence. I am also particularly grateful for the assistance given by Simone Zenzaro, who helped me to understand the Abstract State Machine method.I would like to thank my friends who closely shared with me the time spent working on the development of a thesis. I would especially thank Daniele Virgilio, who supported me at the beginning of this work with several hints about how to face a thesis, Marco Ponza, who proved one more time to be a priceless adventure companion, Nicola Corti, who always made coffee for me and whose laugh is contagious, and Alessandro Lenzi, who was an amusing desk neighbour.Thanks to the "Il Parcheggione" juggling group, especially the President Cristiana, Federica, Massimo and Valentino, with whom I enjoy my free time. Thanks to the "Food Bytes" community, with whom I enjoyed tasty food and had a good time, and to "Geckosoft", namely Fabio and Davide, who supported me at the end of this work. I also greatly appreciate the support of all the other friends I have in Pisa.My family and all my Venetian friends deserve special credits for supporting me through the entire development of this thesis.Finally, I would like to express my gratitude to Carlotta, who has always believed in me and accompanied me to the end of this path in my life. ContentsIntroduction 1 Persistence and distribution of state are two important aspects in modern distributed applications. Although they may be considered two orthogonal concepts, because persistence concerns the extent in time of state, while distribution concerns its extent in space, they are in fact closely connected.In distributed applications, these two aspects are combined in order to let users access the application from different locations at different times. In general, these applications preserve their state after being used and restore it the next time they are accessed, without regard of locations. However, the state of an application may change ...

show abstract

Section: Persistent Javamentioning

confidence: 98%

Section: Orthogonal Persistencementioning

confidence: 99%

Section: Persistent Javamentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Spray: programming with a persistent distributed heap

Grandi

2016

Companion Proceedings of the 2016 ACM SIGPLAN International Conference on Systems, Programming, Languages and Applications: Sof

View full text Add to dashboard Cite

show abstract

“…In a recent review of the field, Dearle et al [12] state the main goal of persistent programming: supporting the design, construction, maintenance and operation of long-lived, concurrently accessed and potentially large bodies of data and programs.…”

Section: Orthogonal Persistencementioning

confidence: 99%

Extending Scala with Database Query Capability.

García¹,

Izmaylova²,

Schupp³

2010

JOT

View full text Add to dashboard Cite

The integration of database and programming languages is difficult due to the different data models and type systems prevalent in each field. We present a solution where the developer may express queries encompassing program and database data. The notation used for queries is based on comprehensions, a declarative style that does not impose any specific execution strategy. In our approach, the type safety of languageintegrated queries is analyzed at compile-time, followed by a translation that optimizes for database evaluation. We show the translation total and semantics preserving, and introduce a language-independent classification. According to this classification, our approach compares favorably with Microsoft's LINQ, today's best-known representative. We provide an implementation in terms of Scala compiler plugins, accepting two notations for queries: LINQ and the native Scala syntax for comprehensions. The prototype relies on Ferry, a query language that already supports comprehensions yet targets SQL:1999. The reported techniques pave the way for further progress in bridging the programming and the database worlds.

show abstract

Modularizing application and database evolution - an aspect-oriented framework for orthogonal persistence

Pereira

Perez-Schofield

Ortín

2016

Softw. Pract. Exper.

View full text Add to dashboard Cite

Summary In the maintenance of software applications, database evolution is one common difficulty. In object‐oriented databases, this process comprises schema evolution and instance adaptation. Both tasks usually require significant effort from programmers and database administrators. In this paper, we propose orthogonal persistence and aspect‐oriented programming to support semi‐transparent database evolution. A default mechanism for instance evolution is defined, but the user may provide modularized solutions using the aspect‐oriented paradigm. We present our framework AOF4OOP to test the feasibility of our proposed approach. This prototype allows programmes to transparently access data in other versions of the database schema. We evaluate our framework, comparing it to related approaches using two real applications and measuring the improvement of the productivity of the programmer. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

Orthogonal Persistence Revisited

Cited by 13 publications

References 26 publications

Spray: programming with a persistent distributed heap

Spray: programming with a persistent distributed heap

Extending Scala with Database Query Capability.

Modularizing application and database evolution - an aspect-oriented framework for orthogonal persistence

Contact Info

Product

Resources

About