Talk:Persistence (computer science)

From Wikipedia, the free encyclopedia
Jump to: navigation, search
WikiProject Computing (Rated Stub-class, Mid-importance)
WikiProject icon This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
Stub-Class article Stub  This article has been rated as Stub-Class on the project's quality scale.
 Mid  This article has been rated as Mid-importance on the project's importance scale.
 

I dispute: "Orthogonal persistence has never featured in commercially used programming languages."[edit]

"Orthogonal persistence has never featured in commercially used programming languages" is just plain false. Perl, for one, provides it with the "opendbm" mechanism for presenting an on-disk key/value file using the same interface as the language's in-memory associative arrays, which was later generalized into Perl's "tie" interface, which provides a framework for transparent persistence for all of Perl's data types. David Nicol — Preceding unsigned comment added by 68.70.67.226 (talk) 16:36, 20 July 2011 (UTC)

Convoluted Definition for Transparent Persistence[edit]

This definition was removed because it is based on concepts more advanced than Persistence itself:

"Persistence is said to be "orthogonal" or "transparent" when the data model is independent of the length of time for which the data persists. Data created in a high-level, typed programming language is caused to outlive the execution of that process by the identification of an external frame of reference to which it can be bound, but without the requirement to translate the data into a different semantic context. The same data may be subsequently bound by a different process, via reference to the same point of binding, again without the requirement to perform any translation. If the persistence is purely orthogonal, then the semantics of the re-bound data is indistinguishable from its semantics in any other execution context." — Preceding unsigned comment added by 186.206.121.191 (talk) 03:50, 21 July 2011 (UTC)

Orthogonal Persistence Disadvantages Removed[edit]

"The disadvantages include confusion over what is persistent and what isn't" - This needs to be better elaborated.

"and the trickiness of getting timing/locking right when multiple processes simultaneously access the same persistent data." - That is a specific implementation problem that applies to regular non-orthogonal persistence also. — Preceding unsigned comment added by 186.206.121.191 (talk) 03:59, 21 July 2011 (UTC)