Interval Queries on Object Histories
暂无分享,去创建一个
Abstract The present paper introduces the notion of “interval queries” on object histories and explores a certain closure property. In particular, conditions are provided under which an interval query applied to object histories described by one “computational-tuple sequence scheme” (CSS) yields, as its answer, the set of all object histories which can be described by another CSS.
[1] Katsumi Tanaka,et al. Computation-tuple sequences and object histories , 1986, TODS.
[2] Umeshwar Dayal,et al. On the Updatability of Relational Views , 1978, VLDB.
[3] Jeffrey D. Ullman,et al. Principles of Database Systems , 1980 .
[4] Irving L. Traiger,et al. Views, authorization, and locking in a relational data base system , 1975, AFIPS '75.
[5] Matthias Jarke,et al. Query Optimization in Database Systems , 1984, CSUR.