Issue No. 03 - May-June (1997 vol. 9)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.599929
<p><b>Abstract</b>—An efficient multiversion access structure for a transaction-time database is presented. Our method requires optimal storage and query times for several important queries and logarithmic update times. Three version operations—inserts, updates, and deletes—are allowed on the current database, while queries are allowed on any version, present or past. The following query operations are performed in optimal query time: key range search, key history search, and time range view. The key-range query retrieves all records having keys in a specified key range at a specified time; the key history query retrieves all records with a given key in a specified time range; and the time range view query retrieves all records that were current during a specified time interval. Special cases of these queries include the key search query, which retrieves a particular version of a record, and the snapshot query which reconstructs the database at some past time. To the best of our knowledge no previous multiversion access structure simultaneously supports all these query and version operations within these time and space bounds. The bounds on query operations are worst case per operation, while those for storage space and version operations are (worst-case) amortized over a sequence of version operations. Simulation results show that good storage utilization and query performance is obtained.</p>
Transaction-time database, multidimensional data, access methods, data structures, indexing, I/O complexity.
P. J. Varman and R. M. Verma, "An Efficient Multiversion Access Structure," in IEEE Transactions on Knowledge & Data Engineering, vol. 9, no. , pp. 391-409, 1997.