Cache-oblivious persistence

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

    Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish (US)
    Title of host publicationAlgorithms, ESA 2014 - 22nd Annual European Symposium, Proceedings
    PublisherSpringer Verlag
    Pages296-308
    Number of pages13
    ISBN (Print)9783662447765
    DOIs
    StatePublished - 2014
    Event22nd Annual European Symposium on Algorithms, ESA 2014 - Wroclaw, Poland
    Duration: Sep 8 2014Sep 10 2014

    Publication series

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

    Other

    Other22nd Annual European Symposium on Algorithms, ESA 2014
    CountryPoland
    CityWroclaw
    Period9/8/149/10/14

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Fingerprint Dive into the research topics of 'Cache-oblivious persistence'. Together they form a unique fingerprint.

  • 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