The RABTree and RAB(-)Tree: lean index structures for snapshot access in transaction-time databases

作者：Grandi Fabio^*

来源：Annals of Mathematics and Artificial Intelligence, 2017, 80(3-4): 219-245.

DOI：10.1007/s10472-016-9509-7

• Temporal database
• Transaction time
• Access methods
• Index structures
• B-Tree

In this work we introduce two lean temporal index structures to efficiently support snapshot access (i.e., timeslice queries) in a transaction-time database. The two proposed structures, the RABTree and its RAB(-)Tree variant, are conceptually simple, easy to implement and efficient 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 theoretical and experimental evaluation of the two indexes, in comparison with their previously proposed competitors, is also provided.

• 出版日期2017-8