Reverse Chaining for Answering Temporal Logical Queries
Yannis Manolopoulos · The Computer Journal · 1992
A possible structure for the past data of a partitioned temporal database is reverse field chaining. Under this technique field versions are chained by descending time. Exact analysis derives the expected number of block accesses when logical queries against a partitioned temporal database with reverse chaining are satisfied. Numerical results are given.