Lean Index Structures for Snapshot Access in Transaction-Time Databases

In this work we introduce two lean temporal index structures to efficiently support snapshot access (i.e., Time-slice queries) in transaction-time databases. The two proposed structures, the RABTree and its RAB-Tree variant, are conceptually simple, easy to implement and efficient secondary index solutions. In particular, the RABTree index guarantees optimal performances for transaction-time data which are naturally clustered according to their insertion time without redundancy. A preliminary experimental evaluation of the two indexes is also provided.