Retroactive Data Structure

m Nikhil, Vipin Shukla

Abstract


It supports efficient modifications to a sequence of operations that have been performed on the structure. Retroactive arbitrary insertion, deletion or updating an operation can occur at any point in time in the past. A data structure is fully retroactive if it supports queries and updates   to current and past version.

Keywords


modifications; updating; retroactivity; persistence

Full Text:

PDF


Bookmark and Share


Copyright (c) 2014 m Nikhil, Vipin Shukla

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

 

All published Articles are Open Access at  https://journals.pen2print.org/index.php/ijr/ 


Paper submission: ijr@pen2print.org