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\u2013 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

The RABTree and RAB-Tree: 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., 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

Erratum to: “The RABTree and RAB-Tree: Lean Index Structures for Snapshot Access in Transaction-time Databases”

(non c'è abstract

21st International Symposium on Temporal Representation and Reasoning, TIME 2014, Verona, Italy, September 8-10, 2014

The proceedings contain 18 papers. The topics discussed include: a tractable generalization of simple temporal networks and its relation to mean payoff games; sound and complete algorithms for checking the dynamic controllability of temporal networks with uncertainty, disjunction and observation; a formal account of planning with flexible timelines; metric propositional neighborhood logic with an equivalence relation; checking interval properties of computations; approximate interval-based temporal dependencies: the complexity landscape; a framework for managing temporal dimensions in archaeological data; lean index structures for snapshot access in transaction-time databases; high-level operations for creation and maintenance of temporal and conventional schema in the tauXSchema framework; summarizability in multiversion data warehouse; fairness with EXPTIME bundled CTL tableau; and partially punctual metric temporal logic is decidable