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.
Lean Index Structures for Snapshot Access in Transaction-time Databases / Fabio Grandi. - STAMPA. - (2014), pp. 91-100. (Intervento presentato al convegno 21st International Symposium on Temporal Representation and Reasoning (TIME 14) tenutosi a Verona (Italia) nel Settembre 2014) [10.1109/TIME.2014.10].
Lean Index Structures for Snapshot Access in Transaction-time Databases
GRANDI, FABIO
2014
Abstract
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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
