Reverse Chaining for Answering Temporal Logical Queries
Open Access
- 1 December 1992
- journal article
- research article
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 35 (6) , 666-668
- https://doi.org/10.1093/comjnl/35.6.666
Abstract
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.Keywords
This publication has 0 references indexed in Scilit: