Skip to main content
SpringerLink
Log in

Logical Data Expiration for Fixpoint Extensions of Temporal Logics

  • Conference paper
Advances in Spatial and Temporal Databases (SSTD 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2750))

Included in the following conference series:

Abstract

We study the differences between the future and the past fragments of fixpoint extensions of first-order temporal logics in their relationship to expiration of database histories. We show that while the past fragment admits a bounded expiration operator, the future one requires retaining data of size bounded from below by a function linear in the length of the history. We also discuss fragments of future fixpoint temporal logic for which bounded expiration operators can exist.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

References

  1. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)

    MATH  Google Scholar 

  2. Chomicki, J.: Efficient Checking of Temporal Integrity Constraints Using Bounded History Encoding. ACM Transactions on Database Systems 20(2), 149–186 (1995)

    Article  Google Scholar 

  3. Chomick, J., Niwinski, D.: On the Feasibility of Checking Temporal Integrity Constraints. Journal of Computer and System Sciences 51(3), 523–535 (1995)

    Article  MathSciNet  Google Scholar 

  4. Chomicki, J., Toman, D.: Implementing Temporal Integrity Constraints Using an Active DBMS. IEEE Transactions on Data and Knowledge Engineering 7(4), 566–582 (1995)

    Article  Google Scholar 

  5. Chomicki, J., Toman, D.: Temporal Logic in Information Systems. In: Chomicki, J., Saake, G. (eds.) Logics for Databases and Information Systems, pp. 31–70. Kluwer, Dordrecht (1998)

    Google Scholar 

  6. Chomicki, J., Toman, D., Böhlen, M.H.: Querying ATSQL databases with temporal logic. ACM Transactions on Database Systems (TODS) 26(2), 145–178 (2001)

    Article  MATH  Google Scholar 

  7. Gabbay, D.M., Hodkinson, I.M., Reynolds, M.: Temporal Logic: Mathematical Foundations and Computational Aspects. Oxford University Press, Oxford (1994)

    MATH  Google Scholar 

  8. Hodkinson, I.M., Wolter, F., Zakharyaschev, M.: Decidable fragment of first-order temporal logics. Annals of Pure and Applied Logic 106(1-3), 85–134 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  9. Hülsmann, K., Saake, G.: Theoretical Foundations of Handling Large Substitution Sets in Temporal Integrity Monitoring. Acta Informatica 28(4) (1991)

    Google Scholar 

  10. Jensen, C.S.: Vacuuming. In: Snodgrass, R.T. (ed.) The TSQL2 Temporal Query Language, pp. 447–460. Kluwer Academic Publishers, Dordrecht (1995)

    Google Scholar 

  11. Lipeck, U.W.: Transformation of Dynamic Integrity Constraints into Transaction Specifications. Theoretical Computer Science 76(1) (1990)

    Google Scholar 

  12. Lipeck, U.W., Feng, D.: Construction of Deterministic Transition Graphs from Dynamic Integrity Constraints. In: van Leeuwen, J. (ed.) WG 1988. LNCS, vol. 344, pp. 166–179. Springer, Heidelberg (1989)

    Google Scholar 

  13. Lipeck, U.W., Gertz, M., Saake, G.: Transitional Monitoring of Dynamic Integrity Constraints. IEEE Data Engineering Bulletin (June 1994)

    Google Scholar 

  14. Lipeck, U.W., Saake, G.: Monitoring Dynamic Integrity Constraints Based on Temporal Logic. Information Systems 12(3), 255–269 (1987)

    Article  MATH  Google Scholar 

  15. Lipeck, U.W., Zhou, H.: Monitoring Dynamic Integrity Constraints on Finite State Sequences and Existence Intervals. In: Workshop on Foundations of Models and Languages for Data and Objects. FMLDO 1991, pp. 115–130 (1991)

    Google Scholar 

  16. Skyt, J., Jensen, C.S., Mark, L.: A foundation for Vacuuming Temporal Databases. Data and Knowledge Engineering 44(1), 1–29 (2003)

    Article  MATH  Google Scholar 

  17. Snodgrass, R.T. (ed.): The TSQL2 Temporal Query Language. Kluwer, Dordrecht (1995)

    MATH  Google Scholar 

  18. Toman, D.: Point-based Temporal Extensions of SQL. In: International Conference on Deductive and Object-Oriented Databases, pp. 103–121 (1997)

    Google Scholar 

  19. Toman, D.: Point-Based Temporal Extensions of SQL and Their Efficient Implementation. In: Etzion, O., Jajodia, S., Sripada, S. (eds.) Temporal Databases: Research and Practice, Springer LNCS State-of-the-Art Survey, pp. 211–237,(1998)

    Google Scholar 

  20. Toman, D.: Expiration of Historical Databases. In: International Symposium on Temporal Representation and Reasoning, pp. 128–135. IEEE Press, Los Alamitos (2001)

    Google Scholar 

  21. Toman, D.: Logical Data Expiration. In: Chomicki, J., Saake, G., van der Meyden, R. (eds.) Logics for Emerging Applications of Databases, vol. ch. 7. Springer, Heidelberg (2003)

    Google Scholar 

  22. Vardi, M.Y.: A Temporal Fixpoint Calculus. In: ACM Symposium on Principles of Programming Languages, pp. 250–259 (1988)

    Google Scholar 

  23. Vardi, M.Y., Wolper, P.: An Automata-Theoretic Approach to Automatic Program Verification. In: IEEE Symposium on Logic in Computer Science (1986)

    Google Scholar 

  24. Wolper, P.: Temporal Logic Can Be More Expressive. Information and Control 56(1/2), 72–99 (1983)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada, N2L 3G1

    David Toman

Authors
  1. David Toman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Academic Computer Technology Institute, Patras, Greece

    Thanasis Hadzilacos

  2. Data Engineering Research Lab. Department of Informatics,, Aristotle University, 54124, Thessaloniki, Greece

    Yannis Manolopoulos

  3. Flinders University, Adelaide, Australia

    John Roddick

  4. Department of Informatics, University of Piraeus, Greece

    Yannis Theodoridis

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Toman, D. (2003). Logical Data Expiration for Fixpoint Extensions of Temporal Logics. In: Hadzilacos, T., Manolopoulos, Y., Roddick, J., Theodoridis, Y. (eds) Advances in Spatial and Temporal Databases. SSTD 2003. Lecture Notes in Computer Science, vol 2750. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45072-6_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45072-6_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40535-1

  • Online ISBN: 978-3-540-45072-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation