Computation-Tuple Sequences and Object Histories: Extended Abstract

  • Seymour Ginsburg
  • Katsumi Tanaka


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.


Computation Scheme Semantic Constraint Check Account Object History Local Reconstructability 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [A]
    AFIPS Office Automation Conference Digests, 1980–1983.Google Scholar
  2. [CW]
    J. Clifford and D.S.Warren, “Formal Semantics for Time in Databases”, ACM TODS ,Vol. 1, pp.214–254, 1983.CrossRefGoogle Scholar
  3. [EN]
    C.A.Ellis and G.J.Nutt, “Office Information Systems and Computer Science”, ACM Computing Surveys ,Vol . 12, pp.27–60, 1980.CrossRefGoogle Scholar
  4. [GT]
    S.Ginsburg and K.Tanaka, “Computation-tuple Sequences and Object Histories”, USC Technical Report ,TR-83-217, Nov. 1983.Google Scholar
  5. [GT2]
    S.Ginsburg and K.Tanaka, “Interval Queries on Object Histories”, USC Technical Report ,TR-84-302, Feb. 1984.Google Scholar
  6. [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
  7. [GT4]
    S.Ginsburg and C.Tang, “Projections on Object Histories”, USC Technical Report ,TR-84-311, Oct. 1984.Google Scholar
  8. [PFK]
    R.Purvy, J.Farrell and P.Klose, “The Design of Star’s Record Processing” , ACM TOOIS ,Vol. 1 , pp.3–24 , 1983.CrossRefGoogle Scholar
  9. [SIGMOD]
    ACM Databases for Business and Office Applications Proceedings, 1983.Google Scholar
  10. [SSLKG]
    M.Stonebraker, H.Stettner, N.Lynn, J.Kalash and A.Guttman, “Document Processing in a Relational Database System”, ACM TOOIS ,Vol. 1 , pp. 143–158, 1983-CrossRefGoogle Scholar
  11. [U]
    J.D.Ullman, Principles of Database Systems, 2nd Ed. ,Computer Science Press, Potomac, Maryland, 1982.MATHGoogle Scholar

Copyright information

© Plenum Press, New York 1987

Authors and Affiliations

  • Seymour Ginsburg
    • 1
  • Katsumi Tanaka
    • 2
  1. 1.Computer Science Dept.University of Southern CaliforniaLos AngelesUSA
  2. 2.Dept. of Instrumentation EngineeringKobe UniversityRokkodai, Nada, Kobe 657Japan

Personalised recommendations