Cache-oblivious persistence

Pooya Davoodi; Jeremy T. Fineman; John Iacono; Özgür Özkan

doi:10.1007/978-3-662-44777-2_25

Cache-oblivious persistence

Pooya Davoodi, Jeremy T. Fineman, John Iacono, Özgür Özkan

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Partial persistence is a general transformation that takes a data structure and allows queries to be executed on any past state of the structure. The cache-oblivious model is the leading model of a modern multi-level memory hierarchy. We present the first general transformation for making cache-oblivious model data structures partially persistent.

Original language	English (US)
Title of host publication	Algorithms, ESA 2014 - 22nd Annual European Symposium, Proceedings
Publisher	Springer Verlag
Pages	296-308
Number of pages	13
ISBN (Print)	9783662447765
DOIs	https://doi.org/10.1007/978-3-662-44777-2_25
State	Published - 2014
Event	22nd Annual European Symposium on Algorithms, ESA 2014 - Wroclaw, Poland Duration: Sep 8 2014 → Sep 10 2014

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8737 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	22nd Annual European Symposium on Algorithms, ESA 2014
Country/Territory	Poland
City	Wroclaw
Period	9/8/14 → 9/10/14

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-662-44777-2_25

Cite this

Davoodi, P., Fineman, J. T., Iacono, J., & Özkan, Ö. (2014). Cache-oblivious persistence. In Algorithms, ESA 2014 - 22nd Annual European Symposium, Proceedings (pp. 296-308). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8737 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-662-44777-2_25

Cache-oblivious persistence. / Davoodi, Pooya; Fineman, Jeremy T.; Iacono, John et al.
Algorithms, ESA 2014 - 22nd Annual European Symposium, Proceedings. Springer Verlag, 2014. p. 296-308 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8737 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Davoodi, P, Fineman, JT, Iacono, J & Özkan, Ö 2014, Cache-oblivious persistence. in Algorithms, ESA 2014 - 22nd Annual European Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8737 LNCS, Springer Verlag, pp. 296-308, 22nd Annual European Symposium on Algorithms, ESA 2014, Wroclaw, Poland, 9/8/14. https://doi.org/10.1007/978-3-662-44777-2_25

@inproceedings{106b821081bf46288eb932ce1acf5d02,

title = "Cache-oblivious persistence",

abstract = "Partial persistence is a general transformation that takes a data structure and allows queries to be executed on any past state of the structure. The cache-oblivious model is the leading model of a modern multi-level memory hierarchy. We present the first general transformation for making cache-oblivious model data structures partially persistent.",

author = "Pooya Davoodi and Fineman, {Jeremy T.} and John Iacono and {\"O}zg{\"u}r {\"O}zkan",

year = "2014",

doi = "10.1007/978-3-662-44777-2_25",

language = "English (US)",

isbn = "9783662447765",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "296--308",

booktitle = "Algorithms, ESA 2014 - 22nd Annual European Symposium, Proceedings",

note = "22nd Annual European Symposium on Algorithms, ESA 2014 ; Conference date: 08-09-2014 Through 10-09-2014",

}

TY - GEN

T1 - Cache-oblivious persistence

AU - Davoodi, Pooya

AU - Fineman, Jeremy T.

AU - Iacono, John

AU - Özkan, Özgür

PY - 2014

Y1 - 2014

N2 - Partial persistence is a general transformation that takes a data structure and allows queries to be executed on any past state of the structure. The cache-oblivious model is the leading model of a modern multi-level memory hierarchy. We present the first general transformation for making cache-oblivious model data structures partially persistent.

AB - Partial persistence is a general transformation that takes a data structure and allows queries to be executed on any past state of the structure. The cache-oblivious model is the leading model of a modern multi-level memory hierarchy. We present the first general transformation for making cache-oblivious model data structures partially persistent.

UR - http://www.scopus.com/inward/record.url?scp=84958531324&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84958531324&partnerID=8YFLogxK

U2 - 10.1007/978-3-662-44777-2_25

DO - 10.1007/978-3-662-44777-2_25

M3 - Conference contribution

AN - SCOPUS:84958531324

SN - 9783662447765

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 296

EP - 308

BT - Algorithms, ESA 2014 - 22nd Annual European Symposium, Proceedings

PB - Springer Verlag

T2 - 22nd Annual European Symposium on Algorithms, ESA 2014

Y2 - 8 September 2014 through 10 September 2014

ER -

Cache-oblivious persistence

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this