Comparison of access methods for time-evolving data

Betty Salzberg, Vassilis J. Tsotras
1999 ACM Computing Surveys  
This paper compares different indexing techniques proposed for supporting efficient access to temporal data. The comparison is based on a collection of important performance criteria, including the space consumed, update processing, and query time for representative queries. The comparison is based on worst-case analysis, hence no assumptions on data distribution or query frequencies are made. When a number of methods have the same asymptotic worst-case behavior, features in the methods that
more » ... ect average case behavior are discussed. Additional criteria examined are the pagination of an index, the ability to cluster related data together, and the ability to efficiently separate old from current data (so that larger archival storage media such as write-once optical disks can be used). The purpose of the paper is to identify the difficult problems in accessing temporal data and describe how the different methods aim to solve them. A general lower bound for answering basic temporal queries is also introduced. 16 Where m denotes the size of the ephemeral Bϩ-tree at the time of interest. 17 The pure-key query performance assumes the existence of the C-lists on top of the MVAS structure.
doi:10.1145/319806.319816 fatcat:box27sww4zcy7bva6nfa75xdpi