Computation-Tuple Sequences and Object Histories: Extended Abstract
Recently, much attention has been focussed on database aspects of office automation and their associated research problems [A,EN,PFK,SIGMOD,SSLKG]. One major component in this area is a facility to manage historical data for many “objects”, namely, an object history (management) system. Examples of such systems are those for personal checking account, salary reviews and schedules. However, there has been little widely accepted mathematical formalism which captures major aspects of the historical data for the objects (here called object histories) and permits the identification and analysis of relevant issues. The purpose of the present paper is to introduce a mathematical model allowing such an investigation1.
KeywordsComputation Scheme Semantic Constraint Check Account Object History Local Reconstructability
Unable to display preview. Download preview PDF.
- [A]AFIPS Office Automation Conference Digests, 1980–1983.Google Scholar
- [GT]S.Ginsburg and K.Tanaka, “Computation-tuple Sequences and Object Histories”, USC Technical Report ,TR-83-217, Nov. 1983.Google Scholar
- [GT2]S.Ginsburg and K.Tanaka, “Interval Queries on Object Histories”, USC Technical Report ,TR-84-302, Feb. 1984.Google Scholar
- [GT3]S.Ginsburg and K.Tanaka, “Interval Queries on Object Histories: Extended Abstract”, Proc. of 10th International Conference on Very Large Data Bases ,August 1984, pp.208–217, Singapore.Google Scholar
- [GT4]S.Ginsburg and C.Tang, “Projections on Object Histories”, USC Technical Report ,TR-84-311, Oct. 1984.Google Scholar
- [SIGMOD]ACM Databases for Business and Office Applications Proceedings, 1983.Google Scholar