Retroactive data structures

Erik D. Demaine, John Iacono, Stefan Langerman

    Research output: Contribution to journalArticle

    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. Thus, we present efficient retroactive data structures for queues, doubly ended queues, priority queues, union-find, and decomposable search structures.

    Original languageEnglish (US)
    Article number1240236
    JournalACM Transactions on Algorithms
    Volume3
    Issue number2
    DOIs
    StatePublished - May 1 2007

    Fingerprint

    Data Structures
    Queue
    Paradigm
    Priority Queue
    Arbitrary
    Decomposable
    Persistence
    Deletion
    Insertion
    Union
    Requirements

    Keywords

    • History
    • Persistence
    • Point location
    • Rollback
    • Time travel

    ASJC Scopus subject areas

    • Mathematics (miscellaneous)

    Cite this

    Demaine, E. D., Iacono, J., & Langerman, S. (2007). Retroactive data structures. ACM Transactions on Algorithms, 3(2), [1240236]. https://doi.org/10.1145/1240233.1240236

    Retroactive data structures. / Demaine, Erik D.; Iacono, John; Langerman, Stefan.

    In: ACM Transactions on Algorithms, Vol. 3, No. 2, 1240236, 01.05.2007.

    Research output: Contribution to journalArticle

    Demaine, ED, Iacono, J & Langerman, S 2007, 'Retroactive data structures', ACM Transactions on Algorithms, vol. 3, no. 2, 1240236. https://doi.org/10.1145/1240233.1240236
    Demaine ED, Iacono J, Langerman S. Retroactive data structures. ACM Transactions on Algorithms. 2007 May 1;3(2). 1240236. https://doi.org/10.1145/1240233.1240236
    Demaine, Erik D. ; Iacono, John ; Langerman, Stefan. / Retroactive data structures. In: ACM Transactions on Algorithms. 2007 ; Vol. 3, No. 2.
    @article{8afa6459d8ca4d2fa154c1f822501119,
    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. Thus, we present efficient retroactive data structures for queues, doubly ended queues, priority queues, union-find, and decomposable search structures.",
    keywords = "History, Persistence, Point location, Rollback, Time travel",
    author = "Demaine, {Erik D.} and John Iacono and Stefan Langerman",
    year = "2007",
    month = "5",
    day = "1",
    doi = "10.1145/1240233.1240236",
    language = "English (US)",
    volume = "3",
    journal = "ACM Transactions on Algorithms",
    issn = "1549-6325",
    publisher = "Association for Computing Machinery (ACM)",
    number = "2",

    }

    TY - JOUR

    T1 - Retroactive data structures

    AU - Demaine, Erik D.

    AU - Iacono, John

    AU - Langerman, Stefan

    PY - 2007/5/1

    Y1 - 2007/5/1

    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. Thus, we present efficient retroactive data structures for queues, doubly ended queues, priority queues, union-find, and decomposable search 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. Thus, we present efficient retroactive data structures for queues, doubly ended queues, priority queues, union-find, and decomposable search structures.

    KW - History

    KW - Persistence

    KW - Point location

    KW - Rollback

    KW - Time travel

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

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

    U2 - 10.1145/1240233.1240236

    DO - 10.1145/1240233.1240236

    M3 - Article

    VL - 3

    JO - ACM Transactions on Algorithms

    JF - ACM Transactions on Algorithms

    SN - 1549-6325

    IS - 2

    M1 - 1240236

    ER -