Skip to main content

Computation-Tuple Sequences and Object Histories: Extended Abstract

  • Chapter
Foundations of Data Organization

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. AFIPS Office Automation Conference Digests, 1980–1983.

    Google Scholar 

  2. J. Clifford and D.S.Warren, “Formal Semantics for Time in Databases”, ACM TODS ,Vol. 1, pp.214–254, 1983.

    Article  Google Scholar 

  3. C.A.Ellis and G.J.Nutt, “Office Information Systems and Computer Science”, ACM Computing Surveys ,Vol . 12, pp.27–60, 1980.

    Article  Google Scholar 

  4. S.Ginsburg and K.Tanaka, “Computation-tuple Sequences and Object Histories”, USC Technical Report ,TR-83-217, Nov. 1983.

    Google Scholar 

  5. S.Ginsburg and K.Tanaka, “Interval Queries on Object Histories”, USC Technical Report ,TR-84-302, Feb. 1984.

    Google Scholar 

  6. 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. S.Ginsburg and C.Tang, “Projections on Object Histories”, USC Technical Report ,TR-84-311, Oct. 1984.

    Google Scholar 

  8. R.Purvy, J.Farrell and P.Klose, “The Design of Star’s Record Processing” , ACM TOOIS ,Vol. 1 , pp.3–24 , 1983.

    Article  Google Scholar 

  9. ACM Databases for Business and Office Applications Proceedings, 1983.

    Google Scholar 

  10. 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-

    Article  Google Scholar 

  11. J.D.Ullman, Principles of Database Systems, 2nd Ed. ,Computer Science Press, Potomac, Maryland, 1982.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Plenum Press, New York

About this chapter

Cite this chapter

Ginsburg, S., Tanaka, K. (1987). Computation-Tuple Sequences and Object Histories: Extended Abstract. In: Ghosh, S.P., Kambayashi, Y., Tanaka, K. (eds) Foundations of Data Organization. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1881-1_27

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-1881-1_27

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4612-9048-3

  • Online ISBN: 978-1-4613-1881-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics