Retroactive Data Structures

Erik D. Demaine, John Iacono, Stefan Langerman

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    We introduce a new data structuring paradigm in which operations can be performed on a data structure not only in the present but also in the past. In this new paradigm, called retroactive data structures, the historical sequence of operations performed on the data structure is not fixed. The data structure allows arbitrary insertion and deletion of operations at arbitrary times, subject only to consistency requirements. We initiate the study of retroactive data structures by formally defining the model and its variants. We prove that, unlike persistence, efficient retroactivity is not always achievable, so we go on to present several specific retroactive data structures.

    Original languageEnglish (US)
    Title of host publicationProceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms
    Pages274-283
    Number of pages10
    Volume15
    StatePublished - 2004
    EventProceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms - New Orleans, LA., United States
    Duration: Jan 11 2004Jan 13 2004

    Other

    OtherProceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms
    CountryUnited States
    CityNew Orleans, LA.
    Period1/11/041/13/04

    Fingerprint

    Data structures
    Data Structures
    Paradigm
    Arbitrary
    Persistence
    Deletion
    Insertion
    Requirements

    ASJC Scopus subject areas

    • Chemical Health and Safety
    • Software
    • Safety, Risk, Reliability and Quality
    • Discrete Mathematics and Combinatorics

    Cite this

    Demaine, E. D., Iacono, J., & Langerman, S. (2004). Retroactive Data Structures. In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 15, pp. 274-283)

    Retroactive Data Structures. / Demaine, Erik D.; Iacono, John; Langerman, Stefan.

    Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms. Vol. 15 2004. p. 274-283.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Demaine, ED, Iacono, J & Langerman, S 2004, Retroactive Data Structures. in Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms. vol. 15, pp. 274-283, Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA., United States, 1/11/04.
    Demaine ED, Iacono J, Langerman S. Retroactive Data Structures. In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms. Vol. 15. 2004. p. 274-283
    Demaine, Erik D. ; Iacono, John ; Langerman, Stefan. / Retroactive Data Structures. Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms. Vol. 15 2004. pp. 274-283
    @inproceedings{afc56078e5ac41f5ba64f2869d7ba50c,
    title = "Retroactive Data Structures",
    abstract = "We introduce a new data structuring paradigm in which operations can be performed on a data structure not only in the present but also in the past. In this new paradigm, called retroactive data structures, the historical sequence of operations performed on the data structure is not fixed. The data structure allows arbitrary insertion and deletion of operations at arbitrary times, subject only to consistency requirements. We initiate the study of retroactive data structures by formally defining the model and its variants. We prove that, unlike persistence, efficient retroactivity is not always achievable, so we go on to present several specific retroactive data structures.",
    author = "Demaine, {Erik D.} and John Iacono and Stefan Langerman",
    year = "2004",
    language = "English (US)",
    volume = "15",
    pages = "274--283",
    booktitle = "Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms",

    }

    TY - GEN

    T1 - Retroactive Data Structures

    AU - Demaine, Erik D.

    AU - Iacono, John

    AU - Langerman, Stefan

    PY - 2004

    Y1 - 2004

    N2 - We introduce a new data structuring paradigm in which operations can be performed on a data structure not only in the present but also in the past. In this new paradigm, called retroactive data structures, the historical sequence of operations performed on the data structure is not fixed. The data structure allows arbitrary insertion and deletion of operations at arbitrary times, subject only to consistency requirements. We initiate the study of retroactive data structures by formally defining the model and its variants. We prove that, unlike persistence, efficient retroactivity is not always achievable, so we go on to present several specific retroactive data structures.

    AB - We introduce a new data structuring paradigm in which operations can be performed on a data structure not only in the present but also in the past. In this new paradigm, called retroactive data structures, the historical sequence of operations performed on the data structure is not fixed. The data structure allows arbitrary insertion and deletion of operations at arbitrary times, subject only to consistency requirements. We initiate the study of retroactive data structures by formally defining the model and its variants. We prove that, unlike persistence, efficient retroactivity is not always achievable, so we go on to present several specific retroactive data structures.

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

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

    M3 - Conference contribution

    AN - SCOPUS:1842435923

    VL - 15

    SP - 274

    EP - 283

    BT - Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms

    ER -