<ul>
<li><p><a href="https://urresearch.rochester.edu/fileDownloadForInstitutionalItem.action?itemId=5260&amp;itemFileId=8146" rel="nofollow">Paul F. Dietz's "Fully Persistent Arrays"</a> uses a variant on van Emde Boas trees, which rely on arrays and also on integers being represented as words.</p></li>
<li><p><a href="http://www.cs.au.dk/~gerth/pub/soda12.html" rel="nofollow">Brodal et al.'s "Fully Persistent B-Trees"</a> relies on arrays.</p></li>
<li><p><a href="http://arxiv.org/abs/1402.5492" rel="nofollow">Davoodi et al.'s "Cache-Oblivious Persistence"</a> applies a persistence transform to data structures that don't necessarily work in the pointer model.</p></li>
<li><p><a href="https://cstheory.stackexchange.com/questions/7642/i-dreamt-of-a-data-structure-does-it-exist">The Bentley-Saxe logarithmic method, also known as cache-oblivious lookahead arrays</a> is naturally partially persistent, and relies on arrays for the insert time to be $o(\log_B n)$ in an external-memory setting.</p></li>
</ul>

CC BY-SA 3.0
2015-01-24T22:44:56.690Z
2015-01-25T05:00:19.423Z
2015-01-25T05:00:19.423Z
jbapple
<p>Always when I read about any efficient persistent data structures they use pointer computational model. I'm wondering if you know any efficient implementation which uses power of RAM model?</p>

<ds.data-structures>
Persistent data structures in RAM computational model
immp
# Persistent data structures in RAM computational model

(Asked by: username_0 on 2015-01-24)

Always when I read about any efficient persistent data structures they use pointer computational model. I'm wondering if you know any efficient implementation which uses power of RAM model?

**Tags:** ds.data-structures

---

## 1 answers

### Answer by username_1 on 2015-01-24. Score: 3

* [Paul F. Dietz's "Fully Persistent Arrays"](https://urresearch.rochester.edu/fileDownloadForInstitutionalItem.action?itemId=5260&itemFileId=8146) uses a variant on van Emde Boas trees, which rely on arrays and also on integers being represented as words.
* [Brodal et al.'s "Fully Persistent B-Trees"](http://www.cs.au.dk/~gerth/pub/soda12.html) relies on arrays.
* [Davoodi et al.'s "Cache-Oblivious Persistence"](http://arxiv.org/abs/1402.5492) applies a persistence transform to data structures that don't necessarily work in the pointer model.
* [The Bentley-Saxe logarithmic method, also known as cache-oblivious lookahead arrays](https://cstheory.stackexchange.com/questions/7642/i-dreamt-of-a-data-structure-does-it-exist) is naturally partially persistent, and relies on arrays for the insert time to be $o(\log\_B n)$ in an external-memory setting.


---

