(Enter summary)
Abstract: : We present an efficient implementation method for temporal integrity constraints
formulated in Past Temporal Logic. Although the constraints can refer to past states of the database,
their checking does not require that the entire database history be stored. Instead, every database
state is extended with auxiliary relations that contain the historical information necessary for checking
constraints. Auxiliary relations can be implemented as materialized relational views.
1 Introduction... (Update)
Context of citations to this paper: More
...internal quantifier: undecidable, Not surprising, in view of the fact that first order temporal logic is highly undecidable. t ormulas [Chomicki, 1995] only past connectives arbitrary quantifiers potential constraint satisfaction undecidable a practical method that approximates...
.... explicit time in our situation calculus, for their similarity with dynamic integrity constraints [9] also called temporal constraints [3], we call these queries temporal queries . Furthermore, we call this queries hypothetical because we have an initial, physical...
Cited by: More
Logical Data Expiration - Toman (2003)
(Correct)
Hypothetical Temporal Reasoning with History Encoding.. - Arenas, Bertossi (1997)
(Correct)
Hypothetical Temporal Reasoning with History Encoding - Arenas, Bertossi (1997)
(Correct)
Active bibliography (related documents): More All
0.0: An Empirical Study of the Performance of Temporal.. - Iqbal Goralwalla.. (1994)
(Correct)
0.0: Incremental Join of Time-Oriented Data - Dieter Pfoser And (1998)
(Correct)
0.0: Efficient Differential Timeslice Computation - Torp, Mark, Jensen (1994)
(Correct)
Similar documents based on text: More All
0.1: Depth-Bounded Bottom-Up Evaluation Of Logic Programs - Chomicki (1993)
(Correct)
0.1: Temporal Deductive Databases - Baudinet, Chomicki, Wolper (1992)
(Correct)
0.1: On the Feasibility of Checking Temporal Integrity Constraints - Chomicki, Niwinski (1995)
(Correct)
Related documents from co-citation: More All
15: Implementing Temporal Integrity Constraints Using an Active DBMS
- Toman, Chomicki - 1994
15: Monitoring Dynamic Integrity Constraints Based on Temporal Logic (context) - Lipeck, Saake - 1987
14: On specifying database updates
- Reiter - 1992
BibTeX entry: (Update)
J. Chomicki. Efficient Checking of Temporal Integrity Constraints Using Bounded History Encoding. ACM Transactions on Database Systems, to appear. http://citeseer.ist.psu.edu/chomicki95efficient.html More
@article{ chomicki95efficient,
author = "Jan Chomicki",
title = "Efficient Checking of Temporal Integrity Constraints Using Bounded History Encoding",
journal = "ACM Transactions on Database Systems",
volume = "20",
number = "2",
pages = "149--186",
year = "1995",
url = "citeseer.ist.psu.edu/chomicki95efficient.html" }
Citations (may not include all citations):
1044
Maintaining Knowledge about Temporal Intervals (context) - Allen - 1983
775
Foundations of Databases (context) - Abiteboul, Hull et al. - 1995
26
Partitioned Storage for Temporal Databases (context) - Ahn, Snodgrass - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://129.130.10.93/~schmidt/techreport/ftppub/CIS/CIS/Chomicki/): More
Polynomial Time Query Processing in Temporal Deductive Databases - Chomicki (1990)
(Correct)
Real-Time Integrity Constraints - Extended
(Correct)
Measuring Infinite Relations (Extended Abstract) - Chomicki, Kuper
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC